./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.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 5bfe5681b6d73d5859a119345279b9da165675f4eb4d814fdf24f92881f7a27f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:43:30,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:43:30,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:43:30,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:43:30,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:43:30,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:43:30,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:43:30,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:43:30,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:43:30,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:43:30,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:43:30,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:43:30,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:43:30,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:43:30,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:43:30,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:43:30,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:43:30,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:43:30,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:43:30,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:43:30,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:43:30,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:43:30,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:43:30,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:43:30,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:43:30,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:43:30,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:43:30,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:43:30,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:43:30,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:43:30,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:43:30,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:43:30,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:43:30,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:43:30,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:43:30,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:43:30,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:43:30,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:43:30,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:43:30,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:43:30,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:43:30,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:43:30,145 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:43:30,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:43:30,150 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:43:30,150 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:43:30,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:43:30,151 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:43:30,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:43:30,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:43:30,152 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:43:30,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:43:30,153 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:43:30,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:43:30,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:43:30,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:43:30,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:43:30,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:43:30,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:43:30,154 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:43:30,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:43:30,154 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:43:30,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:43:30,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:43:30,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:43:30,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:43:30,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:43:30,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:43:30,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:43:30,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:43:30,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:43:30,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:43:30,156 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:43:30,156 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:43:30,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:43:30,156 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 -> 5bfe5681b6d73d5859a119345279b9da165675f4eb4d814fdf24f92881f7a27f [2022-02-20 17:43:30,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:43:30,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:43:30,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:43:30,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:43:30,389 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:43:30,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c [2022-02-20 17:43:30,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1dc2ace/7d1120419634431483866075d3ee0800/FLAGec5326acb [2022-02-20 17:43:30,767 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:43:30,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c [2022-02-20 17:43:30,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1dc2ace/7d1120419634431483866075d3ee0800/FLAGec5326acb [2022-02-20 17:43:30,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1dc2ace/7d1120419634431483866075d3ee0800 [2022-02-20 17:43:30,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:43:30,796 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:43:30,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:43:30,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:43:30,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:43:30,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:43:30" (1/1) ... [2022-02-20 17:43:30,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4612ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:30, skipping insertion in model container [2022-02-20 17:43:30,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:43:30" (1/1) ... [2022-02-20 17:43:30,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:43:30,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:43:30,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c[458,471] [2022-02-20 17:43:30,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:43:30,990 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:43:31,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c[458,471] [2022-02-20 17:43:31,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:43:31,039 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:43:31,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:31 WrapperNode [2022-02-20 17:43:31,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:43:31,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:43:31,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:43:31,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:43:31,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:31" (1/1) ... [2022-02-20 17:43:31,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:31" (1/1) ... [2022-02-20 17:43:31,079 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2022-02-20 17:43:31,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:43:31,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:43:31,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:43:31,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:43:31,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:31" (1/1) ... [2022-02-20 17:43:31,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:31" (1/1) ... [2022-02-20 17:43:31,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:31" (1/1) ... [2022-02-20 17:43:31,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:31" (1/1) ... [2022-02-20 17:43:31,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:31" (1/1) ... [2022-02-20 17:43:31,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:31" (1/1) ... [2022-02-20 17:43:31,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:31" (1/1) ... [2022-02-20 17:43:31,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:43:31,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:43:31,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:43:31,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:43:31,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:31" (1/1) ... [2022-02-20 17:43:31,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:43:31,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:31,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:43:31,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:43:31,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:43:31,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:43:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:43:31,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:43:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:43:31,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:43:31,209 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:43:31,210 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:43:31,368 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:43:31,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:43:31,373 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:43:31,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:43:31 BoogieIcfgContainer [2022-02-20 17:43:31,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:43:31,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:43:31,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:43:31,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:43:31,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:43:30" (1/3) ... [2022-02-20 17:43:31,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c66115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:43:31, skipping insertion in model container [2022-02-20 17:43:31,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:31" (2/3) ... [2022-02-20 17:43:31,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c66115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:43:31, skipping insertion in model container [2022-02-20 17:43:31,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:43:31" (3/3) ... [2022-02-20 17:43:31,380 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound50.c [2022-02-20 17:43:31,384 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:43:31,384 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:43:31,423 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:43:31,430 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:43:31,431 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:43:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:43:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:43:31,460 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:31,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:31,461 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash -579246775, now seen corresponding path program 1 times [2022-02-20 17:43:31,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:31,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413503271] [2022-02-20 17:43:31,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:31,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:31,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#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);~counter~0 := 0; {23#true} is VALID [2022-02-20 17:43:31,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {23#true} is VALID [2022-02-20 17:43:31,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {24#false} is VALID [2022-02-20 17:43:31,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {24#false} is VALID [2022-02-20 17:43:31,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} assume !true; {24#false} is VALID [2022-02-20 17:43:31,613 INFO L272 TraceCheckUtils]: 5: Hoare triple {24#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {24#false} is VALID [2022-02-20 17:43:31,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-02-20 17:43:31,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-02-20 17:43:31,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 17:43:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:43:31,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:31,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413503271] [2022-02-20 17:43:31,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413503271] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:43:31,615 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:43:31,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:43:31,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319267780] [2022-02-20 17:43:31,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:31,621 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:43:31,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:31,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:31,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:31,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:43:31,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:31,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:43:31,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:43:31,662 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:31,825 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-02-20 17:43:31,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:43:31,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:43:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:31,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-02-20 17:43:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-02-20 17:43:31,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2022-02-20 17:43:31,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:31,936 INFO L225 Difference]: With dead ends: 37 [2022-02-20 17:43:31,936 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 17:43:31,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:43:31,940 INFO L933 BasicCegarLoop]: 23 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, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:31,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 17:43:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 17:43:31,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:31,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:31,962 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:31,963 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:31,982 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:43:31,982 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:43:31,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:31,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:31,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-02-20 17:43:31,983 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-02-20 17:43:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:31,985 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:43:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:43:31,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:31,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:31,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:31,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-20 17:43:31,989 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2022-02-20 17:43:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:31,989 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-20 17:43:31,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:43:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:43:31,990 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:31,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:31,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:43:31,991 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:31,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1986551203, now seen corresponding path program 1 times [2022-02-20 17:43:31,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:31,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662568053] [2022-02-20 17:43:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:32,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:32,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#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);~counter~0 := 0; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:43:32,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:43:32,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {131#(= ~counter~0 0)} is VALID [2022-02-20 17:43:32,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:43:32,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {131#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {132#(= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:43:32,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 50);havoc main_#t~post5#1; {130#false} is VALID [2022-02-20 17:43:32,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {130#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {130#false} is VALID [2022-02-20 17:43:32,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {130#false} ~cond := #in~cond; {130#false} is VALID [2022-02-20 17:43:32,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {130#false} assume 0 == ~cond; {130#false} is VALID [2022-02-20 17:43:32,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2022-02-20 17:43:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:43:32,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:32,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662568053] [2022-02-20 17:43:32,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662568053] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:43:32,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:43:32,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:43:32,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121735214] [2022-02-20 17:43:32,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:32,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:43:32,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:32,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:32,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:32,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:43:32,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:32,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:43:32,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:43:32,099 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:32,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:32,195 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 17:43:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:43:32,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:43:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-20 17:43:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-20 17:43:32,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-02-20 17:43:32,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:32,244 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:43:32,244 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 17:43:32,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:43:32,247 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:32,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:32,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 17:43:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 17:43:32,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:32,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:32,252 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:32,253 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:32,254 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 17:43:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 17:43:32,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:32,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:32,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-02-20 17:43:32,256 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-02-20 17:43:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:32,260 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 17:43:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 17:43:32,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:32,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:32,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:32,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-20 17:43:32,263 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2022-02-20 17:43:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:32,263 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-20 17:43:32,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 17:43:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:43:32,264 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:32,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:32,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:43:32,265 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:32,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1984763743, now seen corresponding path program 1 times [2022-02-20 17:43:32,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:32,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906909570] [2022-02-20 17:43:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:32,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:32,278 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:32,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526349560] [2022-02-20 17:43:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:32,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:32,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:32,288 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:43:32,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:43:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:32,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:43:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:32,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:32,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#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);~counter~0 := 0; {230#true} is VALID [2022-02-20 17:43:32,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {230#true} is VALID [2022-02-20 17:43:32,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#true} assume !(0 == assume_abort_if_not_~cond#1); {230#true} is VALID [2022-02-20 17:43:32,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {230#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:32,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:32,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:32,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:32,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:32,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {231#false} is VALID [2022-02-20 17:43:32,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#false} assume !false; {231#false} is VALID [2022-02-20 17:43:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:43:32,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:43:32,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:32,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906909570] [2022-02-20 17:43:32,466 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:32,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526349560] [2022-02-20 17:43:32,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526349560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:43:32,467 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:43:32,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:43:32,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208237681] [2022-02-20 17:43:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:32,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:43:32,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:32,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:32,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:32,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:43:32,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:32,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:43:32,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:43:32,478 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:57,239 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 17:43:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:43:57,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:43:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-20 17:43:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-20 17:43:57,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-02-20 17:43:57,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:57,278 INFO L225 Difference]: With dead ends: 28 [2022-02-20 17:43:57,283 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:43:57,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:43:57,284 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:57,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:43:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:43:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:43:57,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:57,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:43:57,295 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:43:57,296 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:43:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:57,300 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 17:43:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:43:57,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:57,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:57,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 17:43:57,310 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 17:43:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:57,313 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 17:43:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:43:57,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:57,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:57,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:57,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:43:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-20 17:43:57,315 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2022-02-20 17:43:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:57,315 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-20 17:43:57,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:43:57,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:43:57,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:57,316 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:57,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:43:57,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:57,528 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:57,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:57,528 INFO L85 PathProgramCache]: Analyzing trace with hash -69803837, now seen corresponding path program 1 times [2022-02-20 17:43:57,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:57,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078247634] [2022-02-20 17:43:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:57,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:57,544 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:57,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197189198] [2022-02-20 17:43:57,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:57,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:57,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:57,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:43:57,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:43:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:57,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:43:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:57,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:57,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#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);~counter~0 := 0; {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:57,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:57,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:57,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {389#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:57,683 INFO L290 TraceCheckUtils]: 4: Hoare triple {389#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:57,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:57,684 INFO L272 TraceCheckUtils]: 6: Hoare triple {402#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:57,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#(<= ~counter~0 1)} ~cond := #in~cond; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:57,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {402#(<= ~counter~0 1)} assume !(0 == ~cond); {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:57,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {402#(<= ~counter~0 1)} assume true; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:57,686 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {402#(<= ~counter~0 1)} {402#(<= ~counter~0 1)} #47#return; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:57,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {402#(<= ~counter~0 1)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:57,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {402#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {427#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-20 17:43:57,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {427#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 50);havoc main_#t~post5#1; {385#false} is VALID [2022-02-20 17:43:57,687 INFO L272 TraceCheckUtils]: 14: Hoare triple {385#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {385#false} is VALID [2022-02-20 17:43:57,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2022-02-20 17:43:57,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {385#false} assume 0 == ~cond; {385#false} is VALID [2022-02-20 17:43:57,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {385#false} assume !false; {385#false} is VALID [2022-02-20 17:43:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:43:57,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:57,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {385#false} assume !false; {385#false} is VALID [2022-02-20 17:43:57,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {385#false} assume 0 == ~cond; {385#false} is VALID [2022-02-20 17:43:57,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2022-02-20 17:43:57,782 INFO L272 TraceCheckUtils]: 14: Hoare triple {385#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {385#false} is VALID [2022-02-20 17:43:57,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(< |ULTIMATE.start_main_#t~post5#1| 50)} assume !(main_#t~post5#1 < 50);havoc main_#t~post5#1; {385#false} is VALID [2022-02-20 17:43:57,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(< ~counter~0 50)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {455#(< |ULTIMATE.start_main_#t~post5#1| 50)} is VALID [2022-02-20 17:43:57,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#(< ~counter~0 50)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {459#(< ~counter~0 50)} is VALID [2022-02-20 17:43:57,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {384#true} {459#(< ~counter~0 50)} #47#return; {459#(< ~counter~0 50)} is VALID [2022-02-20 17:43:57,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#true} assume true; {384#true} is VALID [2022-02-20 17:43:57,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {384#true} assume !(0 == ~cond); {384#true} is VALID [2022-02-20 17:43:57,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#true} ~cond := #in~cond; {384#true} is VALID [2022-02-20 17:43:57,785 INFO L272 TraceCheckUtils]: 6: Hoare triple {459#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {384#true} is VALID [2022-02-20 17:43:57,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {459#(< ~counter~0 50)} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {459#(< ~counter~0 50)} is VALID [2022-02-20 17:43:57,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {484#(< ~counter~0 49)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {459#(< ~counter~0 50)} is VALID [2022-02-20 17:43:57,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {484#(< ~counter~0 49)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {484#(< ~counter~0 49)} is VALID [2022-02-20 17:43:57,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#(< ~counter~0 49)} assume !(0 == assume_abort_if_not_~cond#1); {484#(< ~counter~0 49)} is VALID [2022-02-20 17:43:57,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#(< ~counter~0 49)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {484#(< ~counter~0 49)} is VALID [2022-02-20 17:43:57,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#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);~counter~0 := 0; {484#(< ~counter~0 49)} is VALID [2022-02-20 17:43:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:43:57,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:57,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078247634] [2022-02-20 17:43:57,788 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:57,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197189198] [2022-02-20 17:43:57,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197189198] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:43:57,789 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:43:57,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:43:57,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708817888] [2022-02-20 17:43:57,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:43:57,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:57,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:57,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:57,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:43:57,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:57,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:43:57,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:43:57,833 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:58,028 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-02-20 17:43:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:43:58,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:43:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-02-20 17:43:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-02-20 17:43:58,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2022-02-20 17:43:58,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:58,112 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:43:58,112 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 17:43:58,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:43:58,114 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:58,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 82 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 17:43:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-02-20 17:43:58,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:58,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:43:58,136 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:43:58,136 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:43:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:58,138 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 17:43:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-02-20 17:43:58,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:58,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:58,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-02-20 17:43:58,139 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-02-20 17:43:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:58,141 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 17:43:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-02-20 17:43:58,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:58,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:58,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:58,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:43:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-02-20 17:43:58,147 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 18 [2022-02-20 17:43:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:58,147 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-02-20 17:43:58,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-02-20 17:43:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:43:58,148 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:58,148 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:58,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:43:58,364 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,SelfDestructingSolverStorable3 [2022-02-20 17:43:58,365 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:58,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:58,365 INFO L85 PathProgramCache]: Analyzing trace with hash -68016377, now seen corresponding path program 1 times [2022-02-20 17:43:58,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:58,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473902559] [2022-02-20 17:43:58,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:58,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:58,383 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:58,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866160211] [2022-02-20 17:43:58,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:58,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:58,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:58,384 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:43:58,385 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:43:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:58,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:43:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:58,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:58,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {747#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);~counter~0 := 0; {747#true} is VALID [2022-02-20 17:43:58,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {747#true} is VALID [2022-02-20 17:43:58,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume !(0 == assume_abort_if_not_~cond#1); {747#true} is VALID [2022-02-20 17:43:58,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {747#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:58,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:58,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:58,525 INFO L272 TraceCheckUtils]: 6: Hoare triple {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {747#true} is VALID [2022-02-20 17:43:58,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} ~cond := #in~cond; {747#true} is VALID [2022-02-20 17:43:58,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {747#true} assume !(0 == ~cond); {747#true} is VALID [2022-02-20 17:43:58,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#true} assume true; {747#true} is VALID [2022-02-20 17:43:58,526 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {747#true} {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #47#return; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:58,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} is VALID [2022-02-20 17:43:58,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} is VALID [2022-02-20 17:43:58,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} is VALID [2022-02-20 17:43:58,528 INFO L272 TraceCheckUtils]: 14: Hoare triple {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:58,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:58,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {748#false} is VALID [2022-02-20 17:43:58,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-02-20 17:43:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:43:58,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:58,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-02-20 17:43:58,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {748#false} is VALID [2022-02-20 17:43:58,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:58,646 INFO L272 TraceCheckUtils]: 14: Hoare triple {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:58,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:58,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:58,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:58,780 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {747#true} {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} #47#return; {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:58,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#true} assume true; {747#true} is VALID [2022-02-20 17:43:58,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {747#true} assume !(0 == ~cond); {747#true} is VALID [2022-02-20 17:43:58,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} ~cond := #in~cond; {747#true} is VALID [2022-02-20 17:43:58,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {747#true} is VALID [2022-02-20 17:43:58,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:58,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:58,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {747#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {816#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:58,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume !(0 == assume_abort_if_not_~cond#1); {747#true} is VALID [2022-02-20 17:43:58,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {747#true} is VALID [2022-02-20 17:43:58,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {747#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);~counter~0 := 0; {747#true} is VALID [2022-02-20 17:43:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:43:58,784 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:58,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473902559] [2022-02-20 17:43:58,784 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:58,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866160211] [2022-02-20 17:43:58,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866160211] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:58,784 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:58,784 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:43:58,784 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916321480] [2022-02-20 17:43:58,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:58,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 17:43:58,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:58,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:43:58,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:58,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:43:58,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:58,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:43:58,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:43:58,901 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:43:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:58,985 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-02-20 17:43:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:43:58,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 17:43:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:43:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-02-20 17:43:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:43:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-02-20 17:43:58,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-02-20 17:43:59,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:59,118 INFO L225 Difference]: With dead ends: 60 [2022-02-20 17:43:59,118 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 17:43:59,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:43:59,119 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 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:43:59,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 17:43:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-02-20 17:43:59,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:59,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:43:59,135 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:43:59,136 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:43:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:59,140 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-02-20 17:43:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-02-20 17:43:59,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:59,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:59,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-02-20 17:43:59,144 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-02-20 17:43:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:59,149 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-02-20 17:43:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-02-20 17:43:59,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:59,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:59,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:59,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:43:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-02-20 17:43:59,151 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 18 [2022-02-20 17:43:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:59,152 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-02-20 17:43:59,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:43:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-02-20 17:43:59,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:43:59,153 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:59,153 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:59,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:43:59,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:59,367 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:59,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:59,368 INFO L85 PathProgramCache]: Analyzing trace with hash 156635680, now seen corresponding path program 1 times [2022-02-20 17:43:59,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:59,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22759648] [2022-02-20 17:43:59,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:59,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:59,378 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:59,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866065306] [2022-02-20 17:43:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:59,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:59,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:59,385 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:43:59,386 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:43:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:59,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:43:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:59,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:59,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {1110#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);~counter~0 := 0; {1110#true} is VALID [2022-02-20 17:43:59,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1110#true} is VALID [2022-02-20 17:43:59,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume !(0 == assume_abort_if_not_~cond#1); {1110#true} is VALID [2022-02-20 17:43:59,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {1110#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:59,728 INFO L290 TraceCheckUtils]: 4: Hoare triple {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:59,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:59,728 INFO L272 TraceCheckUtils]: 6: Hoare triple {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1110#true} is VALID [2022-02-20 17:43:59,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-02-20 17:43:59,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-02-20 17:43:59,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-02-20 17:43:59,729 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1110#true} {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:59,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1149#(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:43:59,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1149#(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:43:59,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#(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_#t~post5#1 < 50);havoc main_#t~post5#1; {1149#(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:43:59,731 INFO L272 TraceCheckUtils]: 14: Hoare triple {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1110#true} is VALID [2022-02-20 17:43:59,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-02-20 17:43:59,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-02-20 17:43:59,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-02-20 17:43:59,732 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1110#true} {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #47#return; {1149#(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:43:59,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {1149#(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); {1174#(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:43:59,748 INFO L272 TraceCheckUtils]: 20: Hoare triple {1174#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1110#true} is VALID [2022-02-20 17:43:59,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-02-20 17:43:59,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-02-20 17:43:59,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-02-20 17:43:59,749 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1110#true} {1174#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #49#return; {1174#(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:43:59,749 INFO L272 TraceCheckUtils]: 25: Hoare triple {1174#(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)); {1193#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:59,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {1193#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1197#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:59,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {1197#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1111#false} is VALID [2022-02-20 17:43:59,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-02-20 17:43:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:43:59,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:00,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:00,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22759648] [2022-02-20 17:44:00,048 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:00,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866065306] [2022-02-20 17:44:00,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866065306] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:00,048 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:00,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:44:00,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438215360] [2022-02-20 17:44:00,048 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:00,049 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), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-02-20 17:44:00,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:00,049 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), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:44:00,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:00,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:44:00,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:00,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:44:00,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:44:00,071 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:44:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:00,229 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-02-20 17:44:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:44:00,229 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), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-02-20 17:44:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:00,229 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), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:44:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-02-20 17:44:00,230 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), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:44:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-02-20 17:44:00,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-02-20 17:44:00,253 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:44:00,254 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:44:00,254 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:44:00,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 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:44:00,254 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:00,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:44:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 17:44:00,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:00,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:00,271 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:00,271 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:00,272 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-20 17:44:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:44:00,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:00,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:00,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 45 states. [2022-02-20 17:44:00,273 INFO L87 Difference]: Start difference. First operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 45 states. [2022-02-20 17:44:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:00,274 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-20 17:44:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:44:00,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:00,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:00,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:00,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-02-20 17:44:00,276 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 29 [2022-02-20 17:44:00,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:00,276 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-02-20 17:44:00,276 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), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:44:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:44:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 17:44:00,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:00,277 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:00,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:00,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:00,491 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1793229318, now seen corresponding path program 2 times [2022-02-20 17:44:00,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:00,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942423661] [2022-02-20 17:44:00,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:00,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:00,502 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:00,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022721546] [2022-02-20 17:44:00,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:44:00,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:00,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:00,507 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:00,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:44:00,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:44:00,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:00,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:44:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:00,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:00,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {1490#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);~counter~0 := 0; {1490#true} is VALID [2022-02-20 17:44:00,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1490#true} is VALID [2022-02-20 17:44:00,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume !(0 == assume_abort_if_not_~cond#1); {1490#true} is VALID [2022-02-20 17:44:00,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {1490#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:00,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:00,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:00,895 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:44:00,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:44:00,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:44:00,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:44:00,896 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1490#true} {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:00,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:00,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:00,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:00,897 INFO L272 TraceCheckUtils]: 14: Hoare triple {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:44:00,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:44:00,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:44:00,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:44:00,898 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1490#true} {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #47#return; {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:00,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:44:00,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:44:00,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {1554#(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_#t~post5#1 < 50);havoc main_#t~post5#1; {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:44:00,900 INFO L272 TraceCheckUtils]: 22: Hoare triple {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:44:00,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:44:00,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:44:00,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:44:00,900 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1490#true} {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} #47#return; {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:44:00,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {1554#(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); {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:00,901 INFO L272 TraceCheckUtils]: 28: Hoare triple {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:44:00,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:44:00,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:44:00,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:44:00,902 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1490#true} {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} #49#return; {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:00,903 INFO L272 TraceCheckUtils]: 33: Hoare triple {1579#(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)); {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:00,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:00,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {1602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1491#false} is VALID [2022-02-20 17:44:00,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-02-20 17:44:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:44:00,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:01,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:01,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942423661] [2022-02-20 17:44:01,173 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:01,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022721546] [2022-02-20 17:44:01,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022721546] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:01,173 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:01,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:44:01,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662423133] [2022-02-20 17:44:01,174 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:01,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-02-20 17:44:01,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:01,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:44:01,195 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:44:01,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:44:01,195 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:44:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:44:01,196 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:44:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:01,402 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-02-20 17:44:01,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:44:01,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-02-20 17:44:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:44:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 17:44:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:44:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 17:44:01,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-02-20 17:44:01,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:01,434 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:44:01,434 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:44:01,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:44:01,435 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:01,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 150 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:44:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:44:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 17:44:01,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:01,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:01,450 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:01,451 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:01,452 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 17:44:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 17:44:01,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:01,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:01,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 44 states. [2022-02-20 17:44:01,453 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 44 states. [2022-02-20 17:44:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:01,454 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 17:44:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 17:44:01,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:01,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:01,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:01,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-02-20 17:44:01,456 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 37 [2022-02-20 17:44:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:01,456 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-02-20 17:44:01,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:44:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 17:44:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 17:44:01,457 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:01,457 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:01,463 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:44:01,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:01,663 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:01,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:01,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1183870932, now seen corresponding path program 3 times [2022-02-20 17:44:01,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:01,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886206127] [2022-02-20 17:44:01,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:01,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:01,695 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:01,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272426472] [2022-02-20 17:44:01,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:44:01,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:01,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:01,700 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:44:01,701 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:44:02,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 17:44:02,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:02,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 17:44:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:02,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:03,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {1889#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);~counter~0 := 0; {1889#true} is VALID [2022-02-20 17:44:03,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {1889#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1889#true} is VALID [2022-02-20 17:44:03,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {1889#true} assume !(0 == assume_abort_if_not_~cond#1); {1889#true} is VALID [2022-02-20 17:44:03,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {1889#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:03,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:03,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:03,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1889#true} is VALID [2022-02-20 17:44:03,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-02-20 17:44:03,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-02-20 17:44:03,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-02-20 17:44:03,135 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1889#true} {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:03,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:03,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:03,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:03,136 INFO L272 TraceCheckUtils]: 14: Hoare triple {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1889#true} is VALID [2022-02-20 17:44:03,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-02-20 17:44:03,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-02-20 17:44:03,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-02-20 17:44:03,138 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1889#true} {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #47#return; {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:03,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |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_~y~0#1 + main_~x~0#1; {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:03,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:03,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:03,139 INFO L272 TraceCheckUtils]: 22: Hoare triple {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1889#true} is VALID [2022-02-20 17:44:03,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-02-20 17:44:03,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-02-20 17:44:03,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-02-20 17:44:03,140 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1889#true} {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #47#return; {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:03,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1978#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:44:03,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {1978#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1978#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:44:03,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {1978#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {1978#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:44:03,141 INFO L272 TraceCheckUtils]: 30: Hoare triple {1978#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1889#true} is VALID [2022-02-20 17:44:03,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-02-20 17:44:03,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-02-20 17:44:03,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-02-20 17:44:03,142 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1889#true} {1978#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} #47#return; {1978#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:44:03,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {1978#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} assume !(main_~c~0#1 < main_~k~0#1); {2003#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:44:03,146 INFO L272 TraceCheckUtils]: 36: Hoare triple {2003#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1889#true} is VALID [2022-02-20 17:44:03,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-02-20 17:44:03,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-02-20 17:44:03,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-02-20 17:44:03,146 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1889#true} {2003#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #49#return; {2003#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:44:03,147 INFO L272 TraceCheckUtils]: 41: Hoare triple {2003#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2022#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:03,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {2022#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2026#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:03,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {2026#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1890#false} is VALID [2022-02-20 17:44:03,148 INFO L290 TraceCheckUtils]: 44: Hoare triple {1890#false} assume !false; {1890#false} is VALID [2022-02-20 17:44:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:44:03,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:03,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:03,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886206127] [2022-02-20 17:44:03,412 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:03,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272426472] [2022-02-20 17:44:03,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272426472] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:03,412 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:03,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-02-20 17:44:03,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901444501] [2022-02-20 17:44:03,413 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:03,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2022-02-20 17:44:03,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:03,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:03,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:03,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:44:03,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:03,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:44:03,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:44:03,438 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:03,717 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-02-20 17:44:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:44:03,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2022-02-20 17:44:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-02-20 17:44:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-02-20 17:44:03,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2022-02-20 17:44:03,752 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:44:03,753 INFO L225 Difference]: With dead ends: 52 [2022-02-20 17:44:03,753 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:44:03,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 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:44:03,754 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 195 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:44:03,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 195 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:44:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:44:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 17:44:03,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:03,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:03,773 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:03,773 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:03,774 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-02-20 17:44:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-02-20 17:44:03,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:03,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:03,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-02-20 17:44:03,775 INFO L87 Difference]: Start difference. First operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-02-20 17:44:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:03,776 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-02-20 17:44:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-02-20 17:44:03,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:03,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:03,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:03,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-02-20 17:44:03,778 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-02-20 17:44:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:03,778 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-02-20 17:44:03,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-02-20 17:44:03,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 17:44:03,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:03,779 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:03,787 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:44:03,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:03,985 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:03,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:03,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1854611729, now seen corresponding path program 1 times [2022-02-20 17:44:03,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:03,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63729728] [2022-02-20 17:44:03,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:03,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:03,995 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:03,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801165525] [2022-02-20 17:44:03,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:03,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:03,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:03,998 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:44:03,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:44:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:04,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:44:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:04,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:04,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {2323#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);~counter~0 := 0; {2328#(<= ~counter~0 0)} is VALID [2022-02-20 17:44:04,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {2328#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2328#(<= ~counter~0 0)} is VALID [2022-02-20 17:44:04,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {2328#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {2328#(<= ~counter~0 0)} is VALID [2022-02-20 17:44:04,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {2328#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2328#(<= ~counter~0 0)} is VALID [2022-02-20 17:44:04,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {2328#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:44:04,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {2341#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:44:04,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {2341#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:44:04,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {2341#(<= ~counter~0 1)} ~cond := #in~cond; {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:44:04,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {2341#(<= ~counter~0 1)} assume !(0 == ~cond); {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:44:04,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {2341#(<= ~counter~0 1)} assume true; {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:44:04,265 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2341#(<= ~counter~0 1)} {2341#(<= ~counter~0 1)} #47#return; {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:44:04,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {2341#(<= ~counter~0 1)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:44:04,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {2341#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:44:04,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {2366#(<= ~counter~0 2)} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:44:04,267 INFO L272 TraceCheckUtils]: 14: Hoare triple {2366#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:44:04,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {2366#(<= ~counter~0 2)} ~cond := #in~cond; {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:44:04,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {2366#(<= ~counter~0 2)} assume !(0 == ~cond); {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:44:04,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {2366#(<= ~counter~0 2)} assume true; {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:44:04,268 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2366#(<= ~counter~0 2)} {2366#(<= ~counter~0 2)} #47#return; {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:44:04,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {2366#(<= ~counter~0 2)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:44:04,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {2366#(<= ~counter~0 2)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:44:04,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {2391#(<= ~counter~0 3)} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:44:04,269 INFO L272 TraceCheckUtils]: 22: Hoare triple {2391#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:44:04,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {2391#(<= ~counter~0 3)} ~cond := #in~cond; {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:44:04,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {2391#(<= ~counter~0 3)} assume !(0 == ~cond); {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:44:04,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {2391#(<= ~counter~0 3)} assume true; {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:44:04,271 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2391#(<= ~counter~0 3)} {2391#(<= ~counter~0 3)} #47#return; {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:44:04,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {2391#(<= ~counter~0 3)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:44:04,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {2391#(<= ~counter~0 3)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:44:04,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {2416#(<= ~counter~0 4)} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:44:04,272 INFO L272 TraceCheckUtils]: 30: Hoare triple {2416#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:44:04,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {2416#(<= ~counter~0 4)} ~cond := #in~cond; {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:44:04,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {2416#(<= ~counter~0 4)} assume !(0 == ~cond); {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:44:04,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {2416#(<= ~counter~0 4)} assume true; {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:44:04,279 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2416#(<= ~counter~0 4)} {2416#(<= ~counter~0 4)} #47#return; {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:44:04,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {2416#(<= ~counter~0 4)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:44:04,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {2416#(<= ~counter~0 4)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2441#(<= |ULTIMATE.start_main_#t~post5#1| 4)} is VALID [2022-02-20 17:44:04,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {2441#(<= |ULTIMATE.start_main_#t~post5#1| 4)} assume !(main_#t~post5#1 < 50);havoc main_#t~post5#1; {2324#false} is VALID [2022-02-20 17:44:04,282 INFO L272 TraceCheckUtils]: 38: Hoare triple {2324#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2324#false} is VALID [2022-02-20 17:44:04,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {2324#false} ~cond := #in~cond; {2324#false} is VALID [2022-02-20 17:44:04,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {2324#false} assume !(0 == ~cond); {2324#false} is VALID [2022-02-20 17:44:04,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {2324#false} assume true; {2324#false} is VALID [2022-02-20 17:44:04,282 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2324#false} {2324#false} #49#return; {2324#false} is VALID [2022-02-20 17:44:04,282 INFO L272 TraceCheckUtils]: 43: Hoare triple {2324#false} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2324#false} is VALID [2022-02-20 17:44:04,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {2324#false} ~cond := #in~cond; {2324#false} is VALID [2022-02-20 17:44:04,282 INFO L290 TraceCheckUtils]: 45: Hoare triple {2324#false} assume 0 == ~cond; {2324#false} is VALID [2022-02-20 17:44:04,282 INFO L290 TraceCheckUtils]: 46: Hoare triple {2324#false} assume !false; {2324#false} is VALID [2022-02-20 17:44:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:44:04,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:04,508 INFO L290 TraceCheckUtils]: 46: Hoare triple {2324#false} assume !false; {2324#false} is VALID [2022-02-20 17:44:04,508 INFO L290 TraceCheckUtils]: 45: Hoare triple {2324#false} assume 0 == ~cond; {2324#false} is VALID [2022-02-20 17:44:04,508 INFO L290 TraceCheckUtils]: 44: Hoare triple {2324#false} ~cond := #in~cond; {2324#false} is VALID [2022-02-20 17:44:04,508 INFO L272 TraceCheckUtils]: 43: Hoare triple {2324#false} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2324#false} is VALID [2022-02-20 17:44:04,508 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2323#true} {2324#false} #49#return; {2324#false} is VALID [2022-02-20 17:44:04,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-02-20 17:44:04,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {2323#true} assume !(0 == ~cond); {2323#true} is VALID [2022-02-20 17:44:04,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {2323#true} ~cond := #in~cond; {2323#true} is VALID [2022-02-20 17:44:04,509 INFO L272 TraceCheckUtils]: 38: Hoare triple {2324#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2323#true} is VALID [2022-02-20 17:44:04,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {2499#(< |ULTIMATE.start_main_#t~post5#1| 50)} assume !(main_#t~post5#1 < 50);havoc main_#t~post5#1; {2324#false} is VALID [2022-02-20 17:44:04,509 INFO L290 TraceCheckUtils]: 36: Hoare triple {2503#(< ~counter~0 50)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2499#(< |ULTIMATE.start_main_#t~post5#1| 50)} is VALID [2022-02-20 17:44:04,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {2503#(< ~counter~0 50)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2503#(< ~counter~0 50)} is VALID [2022-02-20 17:44:04,510 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2323#true} {2503#(< ~counter~0 50)} #47#return; {2503#(< ~counter~0 50)} is VALID [2022-02-20 17:44:04,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-02-20 17:44:04,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {2323#true} assume !(0 == ~cond); {2323#true} is VALID [2022-02-20 17:44:04,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {2323#true} ~cond := #in~cond; {2323#true} is VALID [2022-02-20 17:44:04,510 INFO L272 TraceCheckUtils]: 30: Hoare triple {2503#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2323#true} is VALID [2022-02-20 17:44:04,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {2503#(< ~counter~0 50)} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {2503#(< ~counter~0 50)} is VALID [2022-02-20 17:44:04,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {2528#(< ~counter~0 49)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2503#(< ~counter~0 50)} is VALID [2022-02-20 17:44:04,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {2528#(< ~counter~0 49)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2528#(< ~counter~0 49)} is VALID [2022-02-20 17:44:04,512 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2323#true} {2528#(< ~counter~0 49)} #47#return; {2528#(< ~counter~0 49)} is VALID [2022-02-20 17:44:04,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-02-20 17:44:04,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {2323#true} assume !(0 == ~cond); {2323#true} is VALID [2022-02-20 17:44:04,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {2323#true} ~cond := #in~cond; {2323#true} is VALID [2022-02-20 17:44:04,512 INFO L272 TraceCheckUtils]: 22: Hoare triple {2528#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2323#true} is VALID [2022-02-20 17:44:04,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {2528#(< ~counter~0 49)} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {2528#(< ~counter~0 49)} is VALID [2022-02-20 17:44:04,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {2553#(< ~counter~0 48)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2528#(< ~counter~0 49)} is VALID [2022-02-20 17:44:04,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {2553#(< ~counter~0 48)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2553#(< ~counter~0 48)} is VALID [2022-02-20 17:44:04,520 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2323#true} {2553#(< ~counter~0 48)} #47#return; {2553#(< ~counter~0 48)} is VALID [2022-02-20 17:44:04,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-02-20 17:44:04,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {2323#true} assume !(0 == ~cond); {2323#true} is VALID [2022-02-20 17:44:04,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {2323#true} ~cond := #in~cond; {2323#true} is VALID [2022-02-20 17:44:04,520 INFO L272 TraceCheckUtils]: 14: Hoare triple {2553#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2323#true} is VALID [2022-02-20 17:44:04,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {2553#(< ~counter~0 48)} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {2553#(< ~counter~0 48)} is VALID [2022-02-20 17:44:04,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {2578#(< ~counter~0 47)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2553#(< ~counter~0 48)} is VALID [2022-02-20 17:44:04,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {2578#(< ~counter~0 47)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2578#(< ~counter~0 47)} is VALID [2022-02-20 17:44:04,522 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2323#true} {2578#(< ~counter~0 47)} #47#return; {2578#(< ~counter~0 47)} is VALID [2022-02-20 17:44:04,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-02-20 17:44:04,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {2323#true} assume !(0 == ~cond); {2323#true} is VALID [2022-02-20 17:44:04,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {2323#true} ~cond := #in~cond; {2323#true} is VALID [2022-02-20 17:44:04,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {2578#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2323#true} is VALID [2022-02-20 17:44:04,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {2578#(< ~counter~0 47)} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {2578#(< ~counter~0 47)} is VALID [2022-02-20 17:44:04,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {2603#(< ~counter~0 46)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2578#(< ~counter~0 47)} is VALID [2022-02-20 17:44:04,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {2603#(< ~counter~0 46)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2603#(< ~counter~0 46)} is VALID [2022-02-20 17:44:04,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {2603#(< ~counter~0 46)} assume !(0 == assume_abort_if_not_~cond#1); {2603#(< ~counter~0 46)} is VALID [2022-02-20 17:44:04,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#(< ~counter~0 46)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2603#(< ~counter~0 46)} is VALID [2022-02-20 17:44:04,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {2323#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);~counter~0 := 0; {2603#(< ~counter~0 46)} is VALID [2022-02-20 17:44:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:44:04,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:04,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63729728] [2022-02-20 17:44:04,525 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:04,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801165525] [2022-02-20 17:44:04,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801165525] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:44:04,525 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:44:04,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-02-20 17:44:04,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235535376] [2022-02-20 17:44:04,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:04,526 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 47 [2022-02-20 17:44:04,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:04,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:44:04,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:04,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:44:04,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:04,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:44:04,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:44:04,577 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:44:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:05,040 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-02-20 17:44:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 17:44:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 47 [2022-02-20 17:44:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:44:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 137 transitions. [2022-02-20 17:44:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:44:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 137 transitions. [2022-02-20 17:44:05,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 137 transitions. [2022-02-20 17:44:05,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:05,149 INFO L225 Difference]: With dead ends: 132 [2022-02-20 17:44:05,149 INFO L226 Difference]: Without dead ends: 122 [2022-02-20 17:44:05,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-02-20 17:44:05,149 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 128 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:05,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 127 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:44:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-02-20 17:44:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2022-02-20 17:44:05,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:05,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:44:05,186 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:44:05,187 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:44:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:05,189 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-02-20 17:44:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-02-20 17:44:05,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:05,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:05,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand 122 states. [2022-02-20 17:44:05,190 INFO L87 Difference]: Start difference. First operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand 122 states. [2022-02-20 17:44:05,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:05,192 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-02-20 17:44:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-02-20 17:44:05,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:05,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:05,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:05,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:44:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2022-02-20 17:44:05,195 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 47 [2022-02-20 17:44:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:05,195 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2022-02-20 17:44:05,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:44:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2022-02-20 17:44:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 17:44:05,196 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:05,196 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:05,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:05,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:05,401 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:05,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash 348710830, now seen corresponding path program 4 times [2022-02-20 17:44:05,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:05,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90836849] [2022-02-20 17:44:05,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:05,417 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:05,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [300365299] [2022-02-20 17:44:05,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:44:05,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:05,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:05,418 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:05,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 17:44:05,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:44:05,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:05,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 17:44:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:05,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:05,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {3198#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);~counter~0 := 0; {3198#true} is VALID [2022-02-20 17:44:05,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {3198#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3198#true} is VALID [2022-02-20 17:44:05,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {3198#true} assume !(0 == assume_abort_if_not_~cond#1); {3198#true} is VALID [2022-02-20 17:44:05,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {3198#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:05,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:05,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:05,841 INFO L272 TraceCheckUtils]: 6: Hoare triple {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3198#true} is VALID [2022-02-20 17:44:05,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {3198#true} ~cond := #in~cond; {3198#true} is VALID [2022-02-20 17:44:05,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {3198#true} assume !(0 == ~cond); {3198#true} is VALID [2022-02-20 17:44:05,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {3198#true} assume true; {3198#true} is VALID [2022-02-20 17:44:05,842 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3198#true} {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:05,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:05,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:05,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:05,843 INFO L272 TraceCheckUtils]: 14: Hoare triple {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3198#true} is VALID [2022-02-20 17:44:05,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {3198#true} ~cond := #in~cond; {3198#true} is VALID [2022-02-20 17:44:05,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {3198#true} assume !(0 == ~cond); {3198#true} is VALID [2022-02-20 17:44:05,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {3198#true} assume true; {3198#true} is VALID [2022-02-20 17:44:05,844 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3198#true} {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #47#return; {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:05,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |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_~y~0#1 + main_~x~0#1; {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:44:05,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:44:05,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:44:05,846 INFO L272 TraceCheckUtils]: 22: Hoare triple {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3198#true} is VALID [2022-02-20 17:44:05,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {3198#true} ~cond := #in~cond; {3198#true} is VALID [2022-02-20 17:44:05,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {3198#true} assume !(0 == ~cond); {3198#true} is VALID [2022-02-20 17:44:05,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {3198#true} assume true; {3198#true} is VALID [2022-02-20 17:44:05,846 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3198#true} {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #47#return; {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:44:05,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 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_~y~0#1 + main_~x~0#1; {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:44:05,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:44:05,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:44:05,850 INFO L272 TraceCheckUtils]: 30: Hoare triple {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3198#true} is VALID [2022-02-20 17:44:05,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {3198#true} ~cond := #in~cond; {3198#true} is VALID [2022-02-20 17:44:05,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {3198#true} assume !(0 == ~cond); {3198#true} is VALID [2022-02-20 17:44:05,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {3198#true} assume true; {3198#true} is VALID [2022-02-20 17:44:05,850 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3198#true} {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #47#return; {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:44:05,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3312#(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:44:05,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {3312#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3312#(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:44:05,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {3312#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {3312#(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:44:05,852 INFO L272 TraceCheckUtils]: 38: Hoare triple {3312#(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 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3198#true} is VALID [2022-02-20 17:44:05,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {3198#true} ~cond := #in~cond; {3198#true} is VALID [2022-02-20 17:44:05,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {3198#true} assume !(0 == ~cond); {3198#true} is VALID [2022-02-20 17:44:05,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {3198#true} assume true; {3198#true} is VALID [2022-02-20 17:44:05,852 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3198#true} {3312#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} #47#return; {3312#(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:44:05,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {3312#(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); {3337#(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:44:05,853 INFO L272 TraceCheckUtils]: 44: Hoare triple {3337#(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 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3198#true} is VALID [2022-02-20 17:44:05,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {3198#true} ~cond := #in~cond; {3198#true} is VALID [2022-02-20 17:44:05,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {3198#true} assume !(0 == ~cond); {3198#true} is VALID [2022-02-20 17:44:05,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {3198#true} assume true; {3198#true} is VALID [2022-02-20 17:44:05,853 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3198#true} {3337#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} #49#return; {3337#(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:44:05,854 INFO L272 TraceCheckUtils]: 49: Hoare triple {3337#(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)); {3356#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:05,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {3356#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3360#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:05,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {3360#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3199#false} is VALID [2022-02-20 17:44:05,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {3199#false} assume !false; {3199#false} is VALID [2022-02-20 17:44:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:44:05,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:06,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:06,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90836849] [2022-02-20 17:44:06,330 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:06,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300365299] [2022-02-20 17:44:06,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300365299] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:06,330 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:06,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-02-20 17:44:06,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967492341] [2022-02-20 17:44:06,332 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:06,333 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-02-20 17:44:06,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:06,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:06,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:06,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:44:06,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:06,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:44:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:44:06,362 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:06,736 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-02-20 17:44:06,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:44:06,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-02-20 17:44:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-02-20 17:44:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-02-20 17:44:06,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 51 transitions. [2022-02-20 17:44:06,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:06,781 INFO L225 Difference]: With dead ends: 102 [2022-02-20 17:44:06,781 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 17:44:06,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:44:06,782 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 246 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:44:06,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 246 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:44:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 17:44:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-02-20 17:44:06,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:06,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:44:06,818 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:44:06,818 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:44:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:06,820 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 17:44:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-20 17:44:06,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:06,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:06,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) Second operand 96 states. [2022-02-20 17:44:06,821 INFO L87 Difference]: Start difference. First operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) Second operand 96 states. [2022-02-20 17:44:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:06,822 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 17:44:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-20 17:44:06,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:06,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:06,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:06,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:44:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2022-02-20 17:44:06,824 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 53 [2022-02-20 17:44:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:06,824 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2022-02-20 17:44:06,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-20 17:44:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 17:44:06,825 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:06,825 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:06,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:07,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 17:44:07,044 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:07,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1021371784, now seen corresponding path program 5 times [2022-02-20 17:44:07,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:07,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954576590] [2022-02-20 17:44:07,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:07,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:07,057 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:07,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [973457629] [2022-02-20 17:44:07,058 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:44:07,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:07,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:07,059 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:07,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 17:44:07,547 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-20 17:44:07,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:07,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-20 17:44:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:07,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:08,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {3899#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);~counter~0 := 0; {3899#true} is VALID [2022-02-20 17:44:08,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {3899#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3899#true} is VALID [2022-02-20 17:44:08,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {3899#true} assume !(0 == assume_abort_if_not_~cond#1); {3899#true} is VALID [2022-02-20 17:44:08,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {3899#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:08,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:08,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:08,095 INFO L272 TraceCheckUtils]: 6: Hoare triple {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:44:08,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-02-20 17:44:08,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-02-20 17:44:08,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-02-20 17:44:08,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3899#true} {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:08,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:08,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:08,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:08,097 INFO L272 TraceCheckUtils]: 14: Hoare triple {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:44:08,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-02-20 17:44:08,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-02-20 17:44:08,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-02-20 17:44:08,102 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3899#true} {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #47#return; {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:08,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:08,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:08,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:08,103 INFO L272 TraceCheckUtils]: 22: Hoare triple {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:44:08,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-02-20 17:44:08,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-02-20 17:44:08,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-02-20 17:44:08,104 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3899#true} {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} #47#return; {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:08,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:08,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:08,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:08,106 INFO L272 TraceCheckUtils]: 30: Hoare triple {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:44:08,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-02-20 17:44:08,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-02-20 17:44:08,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-02-20 17:44:08,107 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3899#true} {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} #47#return; {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:08,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:08,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:08,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:08,108 INFO L272 TraceCheckUtils]: 38: Hoare triple {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:44:08,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {3899#true} ~cond := #in~cond; {4026#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:08,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {4026#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4030#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:44:08,109 INFO L290 TraceCheckUtils]: 41: Hoare triple {4030#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4030#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:44:08,110 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4030#(not (= |__VERIFIER_assert_#in~cond| 0))} {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #47#return; {4037#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:08,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {4037#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4041#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= (+ 1300 (* |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_~x~0#1|))} is VALID [2022-02-20 17:44:08,111 INFO L290 TraceCheckUtils]: 44: Hoare triple {4041#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= (+ 1300 (* |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_~x~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4041#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= (+ 1300 (* |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_~x~0#1|))} is VALID [2022-02-20 17:44:08,111 INFO L290 TraceCheckUtils]: 45: Hoare triple {4041#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= (+ 1300 (* |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_~x~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {4041#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= (+ 1300 (* |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_~x~0#1|))} is VALID [2022-02-20 17:44:08,114 INFO L272 TraceCheckUtils]: 46: Hoare triple {4041#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= (+ 1300 (* |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_~x~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:44:08,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-02-20 17:44:08,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-02-20 17:44:08,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-02-20 17:44:08,115 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3899#true} {4041#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= (+ 1300 (* |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_~x~0#1|))} #47#return; {4041#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= (+ 1300 (* |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_~x~0#1|))} is VALID [2022-02-20 17:44:08,115 INFO L290 TraceCheckUtils]: 51: Hoare triple {4041#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= (+ 1300 (* |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_~x~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {4066#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= (+ 1300 (* |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_~x~0#1|))} is VALID [2022-02-20 17:44:08,115 INFO L272 TraceCheckUtils]: 52: Hoare triple {4066#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= (+ 1300 (* |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_~x~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:44:08,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {3899#true} ~cond := #in~cond; {4026#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:08,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {4026#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4030#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:44:08,116 INFO L290 TraceCheckUtils]: 55: Hoare triple {4030#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4030#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:44:08,117 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4030#(not (= |__VERIFIER_assert_#in~cond| 0))} {4066#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= (+ 1300 (* |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_~x~0#1|))} #49#return; {4082#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:44:08,118 INFO L272 TraceCheckUtils]: 57: Hoare triple {4082#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4086#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:08,118 INFO L290 TraceCheckUtils]: 58: Hoare triple {4086#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4090#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:08,118 INFO L290 TraceCheckUtils]: 59: Hoare triple {4090#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3900#false} is VALID [2022-02-20 17:44:08,118 INFO L290 TraceCheckUtils]: 60: Hoare triple {3900#false} assume !false; {3900#false} is VALID [2022-02-20 17:44:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 39 proven. 65 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-02-20 17:44:08,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:39,555 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 18) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 120) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 119) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 65)) 12) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2022-02-20 17:44:39,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:39,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954576590] [2022-02-20 17:44:39,559 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:39,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973457629] [2022-02-20 17:44:39,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973457629] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:39,559 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:39,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-02-20 17:44:39,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503031880] [2022-02-20 17:44:39,559 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:39,559 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 61 [2022-02-20 17:44:39,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:39,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:39,611 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:44:39,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:44:39,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:44:39,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=4, NotChecked=36, Total=420 [2022-02-20 17:44:39,612 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:40,375 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-02-20 17:44:40,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:44:40,375 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 61 [2022-02-20 17:44:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-02-20 17:44:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-02-20 17:44:40,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2022-02-20 17:44:40,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:40,430 INFO L225 Difference]: With dead ends: 101 [2022-02-20 17:44:40,430 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 17:44:40,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=4, NotChecked=42, Total=552 [2022-02-20 17:44:40,430 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:40,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 289 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:44:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 17:44:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-20 17:44:40,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:40,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:44:40,485 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:44:40,486 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:44:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:40,488 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-02-20 17:44:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-02-20 17:44:40,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:40,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:40,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 95 states. [2022-02-20 17:44:40,489 INFO L87 Difference]: Start difference. First operand has 95 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 95 states. [2022-02-20 17:44:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:40,491 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-02-20 17:44:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-02-20 17:44:40,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:40,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:40,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:40,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:44:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-02-20 17:44:40,494 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 61 [2022-02-20 17:44:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:40,494 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-02-20 17:44:40,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-02-20 17:44:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 17:44:40,495 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:40,495 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:40,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-20 17:44:40,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:40,701 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:40,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:40,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1106405730, now seen corresponding path program 6 times [2022-02-20 17:44:40,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:40,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940835906] [2022-02-20 17:44:40,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:40,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:40,728 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:40,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1359965489] [2022-02-20 17:44:40,729 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:44:40,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:40,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:40,740 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:40,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 17:44:41,349 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-02-20 17:44:41,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:41,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 17:44:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:41,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:41,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {4628#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);~counter~0 := 0; {4628#true} is VALID [2022-02-20 17:44:41,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {4628#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4628#true} is VALID [2022-02-20 17:44:41,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {4628#true} assume !(0 == assume_abort_if_not_~cond#1); {4628#true} is VALID [2022-02-20 17:44:41,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {4628#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {4642#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:41,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {4642#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4642#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:41,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {4642#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {4642#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:41,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {4642#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:44:41,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:44:41,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:44:41,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:44:41,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4628#true} {4642#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {4642#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:41,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {4642#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4667#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:41,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {4667#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4667#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:41,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {4667#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {4667#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:41,772 INFO L272 TraceCheckUtils]: 14: Hoare triple {4667#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:44:41,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:44:41,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:44:41,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:44:41,773 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4628#true} {4667#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #47#return; {4667#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:41,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {4667#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4692#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:44:41,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {4692#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4692#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:44:41,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {4692#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {4692#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:44:41,774 INFO L272 TraceCheckUtils]: 22: Hoare triple {4692#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:44:41,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:44:41,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:44:41,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:44:41,775 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4628#true} {4692#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #47#return; {4692#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:44:41,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {4692#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 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_~y~0#1 + main_~x~0#1; {4717#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= 3 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:44:41,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {4717#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= 3 |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4717#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= 3 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:44:41,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {4717#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= 3 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {4717#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= 3 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:44:41,776 INFO L272 TraceCheckUtils]: 30: Hoare triple {4717#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= 3 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:44:41,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:44:41,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:44:41,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:44:41,777 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4628#true} {4717#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= 3 |ULTIMATE.start_main_~y~0#1|))} #47#return; {4717#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= 3 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:44:41,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {4717#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= 3 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4742#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:44:41,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {4742#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4742#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:44:41,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {4742#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {4742#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:44:41,778 INFO L272 TraceCheckUtils]: 38: Hoare triple {4742#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:44:41,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:44:41,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:44:41,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:44:41,779 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4628#true} {4742#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} #47#return; {4742#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:44:41,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {4742#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4767#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:41,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {4767#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4767#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:41,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {4767#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {4767#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:41,780 INFO L272 TraceCheckUtils]: 46: Hoare triple {4767#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:44:41,780 INFO L290 TraceCheckUtils]: 47: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:44:41,780 INFO L290 TraceCheckUtils]: 48: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:44:41,780 INFO L290 TraceCheckUtils]: 49: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:44:41,781 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4628#true} {4767#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} #47#return; {4767#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:41,781 INFO L290 TraceCheckUtils]: 51: Hoare triple {4767#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4792#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:41,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {4792#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4792#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:41,782 INFO L290 TraceCheckUtils]: 53: Hoare triple {4792#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {4792#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:41,782 INFO L272 TraceCheckUtils]: 54: Hoare triple {4792#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:44:41,782 INFO L290 TraceCheckUtils]: 55: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:44:41,782 INFO L290 TraceCheckUtils]: 56: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:44:41,782 INFO L290 TraceCheckUtils]: 57: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:44:41,782 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4628#true} {4792#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} #47#return; {4792#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:41,783 INFO L290 TraceCheckUtils]: 59: Hoare triple {4792#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {4817#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:41,783 INFO L272 TraceCheckUtils]: 60: Hoare triple {4817#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:44:41,783 INFO L290 TraceCheckUtils]: 61: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:44:41,783 INFO L290 TraceCheckUtils]: 62: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:44:41,783 INFO L290 TraceCheckUtils]: 63: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:44:41,784 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4628#true} {4817#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} #49#return; {4817#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:41,784 INFO L272 TraceCheckUtils]: 65: Hoare triple {4817#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |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)); {4836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:41,785 INFO L290 TraceCheckUtils]: 66: Hoare triple {4836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:41,785 INFO L290 TraceCheckUtils]: 67: Hoare triple {4840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4629#false} is VALID [2022-02-20 17:44:41,785 INFO L290 TraceCheckUtils]: 68: Hoare triple {4629#false} assume !false; {4629#false} is VALID [2022-02-20 17:44:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:44:41,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:42,049 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:42,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940835906] [2022-02-20 17:44:42,050 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:42,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359965489] [2022-02-20 17:44:42,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359965489] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:42,050 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:42,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-02-20 17:44:42,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524875350] [2022-02-20 17:44:42,051 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:42,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 69 [2022-02-20 17:44:42,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:42,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:42,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:42,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 17:44:42,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:42,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 17:44:42,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:44:42,096 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:42,659 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-02-20 17:44:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:44:42,668 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 69 [2022-02-20 17:44:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-02-20 17:44:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-02-20 17:44:42,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 61 transitions. [2022-02-20 17:44:42,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:42,718 INFO L225 Difference]: With dead ends: 100 [2022-02-20 17:44:42,718 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 17:44:42,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:44:42,719 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:42,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 366 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:44:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 17:44:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-02-20 17:44:42,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:42,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:44:42,761 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:44:42,761 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:44:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:42,764 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2022-02-20 17:44:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-02-20 17:44:42,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:42,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:42,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-02-20 17:44:42,765 INFO L87 Difference]: Start difference. First operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-02-20 17:44:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:42,767 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2022-02-20 17:44:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-02-20 17:44:42,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:42,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:42,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:42,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:44:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-02-20 17:44:42,769 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 69 [2022-02-20 17:44:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:42,769 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-02-20 17:44:42,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-02-20 17:44:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 17:44:42,770 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:42,770 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:42,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:42,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 17:44:42,976 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:42,976 INFO L85 PathProgramCache]: Analyzing trace with hash -317230276, now seen corresponding path program 7 times [2022-02-20 17:44:42,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:42,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426043020] [2022-02-20 17:44:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:42,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:42,987 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:42,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [244109042] [2022-02-20 17:44:42,988 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 17:44:42,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:42,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:42,989 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:42,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 17:44:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:43,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-20 17:44:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:43,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:44,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {5367#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);~counter~0 := 0; {5367#true} is VALID [2022-02-20 17:44:44,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {5367#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5367#true} is VALID [2022-02-20 17:44:44,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {5367#true} assume !(0 == assume_abort_if_not_~cond#1); {5367#true} is VALID [2022-02-20 17:44:44,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {5367#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {5381#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:44,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {5381#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5381#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:44,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {5381#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {5381#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:44,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {5381#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5367#true} is VALID [2022-02-20 17:44:44,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {5367#true} ~cond := #in~cond; {5367#true} is VALID [2022-02-20 17:44:44,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {5367#true} assume !(0 == ~cond); {5367#true} is VALID [2022-02-20 17:44:44,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-02-20 17:44:44,057 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5367#true} {5381#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {5381#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:44,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {5381#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5406#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:44,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {5406#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5406#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:44,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {5406#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {5406#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:44,059 INFO L272 TraceCheckUtils]: 14: Hoare triple {5406#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5367#true} is VALID [2022-02-20 17:44:44,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {5367#true} ~cond := #in~cond; {5367#true} is VALID [2022-02-20 17:44:44,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {5367#true} assume !(0 == ~cond); {5367#true} is VALID [2022-02-20 17:44:44,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-02-20 17:44:44,059 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5367#true} {5406#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #47#return; {5406#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:44,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {5406#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5431#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {5431#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5431#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {5431#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {5431#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,061 INFO L272 TraceCheckUtils]: 22: Hoare triple {5431#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5367#true} is VALID [2022-02-20 17:44:44,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {5367#true} ~cond := #in~cond; {5367#true} is VALID [2022-02-20 17:44:44,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {5367#true} assume !(0 == ~cond); {5367#true} is VALID [2022-02-20 17:44:44,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-02-20 17:44:44,061 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5367#true} {5431#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #47#return; {5431#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {5431#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5456#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:44,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {5456#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5456#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:44,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {5456#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {5456#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:44,063 INFO L272 TraceCheckUtils]: 30: Hoare triple {5456#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5367#true} is VALID [2022-02-20 17:44:44,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {5367#true} ~cond := #in~cond; {5367#true} is VALID [2022-02-20 17:44:44,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {5367#true} assume !(0 == ~cond); {5367#true} is VALID [2022-02-20 17:44:44,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-02-20 17:44:44,063 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5367#true} {5456#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} #47#return; {5456#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:44,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {5456#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:44,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {5481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:44,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {5481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {5481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:44,064 INFO L272 TraceCheckUtils]: 38: Hoare triple {5481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5367#true} is VALID [2022-02-20 17:44:44,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {5367#true} ~cond := #in~cond; {5367#true} is VALID [2022-02-20 17:44:44,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {5367#true} assume !(0 == ~cond); {5367#true} is VALID [2022-02-20 17:44:44,065 INFO L290 TraceCheckUtils]: 41: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-02-20 17:44:44,065 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5367#true} {5481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} #47#return; {5481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:44,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {5481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5506#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {5506#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5506#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {5506#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {5506#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,068 INFO L272 TraceCheckUtils]: 46: Hoare triple {5506#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5367#true} is VALID [2022-02-20 17:44:44,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {5367#true} ~cond := #in~cond; {5367#true} is VALID [2022-02-20 17:44:44,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {5367#true} assume !(0 == ~cond); {5367#true} is VALID [2022-02-20 17:44:44,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-02-20 17:44:44,069 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5367#true} {5506#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} #47#return; {5506#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,069 INFO L290 TraceCheckUtils]: 51: Hoare triple {5506#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5531#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,069 INFO L290 TraceCheckUtils]: 52: Hoare triple {5531#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5531#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {5531#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {5531#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,070 INFO L272 TraceCheckUtils]: 54: Hoare triple {5531#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5367#true} is VALID [2022-02-20 17:44:44,070 INFO L290 TraceCheckUtils]: 55: Hoare triple {5367#true} ~cond := #in~cond; {5367#true} is VALID [2022-02-20 17:44:44,070 INFO L290 TraceCheckUtils]: 56: Hoare triple {5367#true} assume !(0 == ~cond); {5367#true} is VALID [2022-02-20 17:44:44,070 INFO L290 TraceCheckUtils]: 57: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-02-20 17:44:44,070 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5367#true} {5531#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} #47#return; {5531#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,071 INFO L290 TraceCheckUtils]: 59: Hoare triple {5531#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5556#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:44:44,071 INFO L290 TraceCheckUtils]: 60: Hoare triple {5556#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5556#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:44:44,072 INFO L290 TraceCheckUtils]: 61: Hoare triple {5556#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {5556#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:44:44,072 INFO L272 TraceCheckUtils]: 62: Hoare triple {5556#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5367#true} is VALID [2022-02-20 17:44:44,072 INFO L290 TraceCheckUtils]: 63: Hoare triple {5367#true} ~cond := #in~cond; {5367#true} is VALID [2022-02-20 17:44:44,072 INFO L290 TraceCheckUtils]: 64: Hoare triple {5367#true} assume !(0 == ~cond); {5367#true} is VALID [2022-02-20 17:44:44,072 INFO L290 TraceCheckUtils]: 65: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-02-20 17:44:44,072 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5367#true} {5556#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} #47#return; {5556#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:44:44,073 INFO L290 TraceCheckUtils]: 67: Hoare triple {5556#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} assume !(main_~c~0#1 < main_~k~0#1); {5581#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:44,073 INFO L272 TraceCheckUtils]: 68: Hoare triple {5581#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5367#true} is VALID [2022-02-20 17:44:44,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {5367#true} ~cond := #in~cond; {5367#true} is VALID [2022-02-20 17:44:44,073 INFO L290 TraceCheckUtils]: 70: Hoare triple {5367#true} assume !(0 == ~cond); {5367#true} is VALID [2022-02-20 17:44:44,073 INFO L290 TraceCheckUtils]: 71: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-02-20 17:44:44,074 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5367#true} {5581#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} #49#return; {5581#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:44,074 INFO L272 TraceCheckUtils]: 73: Hoare triple {5581#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |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)); {5600#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:44,075 INFO L290 TraceCheckUtils]: 74: Hoare triple {5600#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5604#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:44,075 INFO L290 TraceCheckUtils]: 75: Hoare triple {5604#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5368#false} is VALID [2022-02-20 17:44:44,075 INFO L290 TraceCheckUtils]: 76: Hoare triple {5368#false} assume !false; {5368#false} is VALID [2022-02-20 17:44:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-02-20 17:44:44,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:44,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:44,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426043020] [2022-02-20 17:44:44,364 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:44,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244109042] [2022-02-20 17:44:44,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244109042] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:44,364 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:44,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-20 17:44:44,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045603286] [2022-02-20 17:44:44,364 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:44,365 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 77 [2022-02-20 17:44:44,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:44,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:44,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:44,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:44:44,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:44,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:44:44,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:44:44,404 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:45,092 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-02-20 17:44:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:44:45,092 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 77 [2022-02-20 17:44:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-02-20 17:44:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-02-20 17:44:45,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-02-20 17:44:45,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:45,156 INFO L225 Difference]: With dead ends: 99 [2022-02-20 17:44:45,156 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 17:44:45,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:44:45,156 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:45,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 435 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:44:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 17:44:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-02-20 17:44:45,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:45,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:44:45,196 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:44:45,196 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:44:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:45,197 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-20 17:44:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-20 17:44:45,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:45,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:45,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 93 states. [2022-02-20 17:44:45,198 INFO L87 Difference]: Start difference. First operand has 93 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 93 states. [2022-02-20 17:44:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:45,199 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-20 17:44:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-20 17:44:45,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:45,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:45,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:45,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:44:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-02-20 17:44:45,201 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 77 [2022-02-20 17:44:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:45,201 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-02-20 17:44:45,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-20 17:44:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-20 17:44:45,202 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:45,202 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:45,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-20 17:44:45,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 17:44:45,416 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:45,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:45,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1298793238, now seen corresponding path program 8 times [2022-02-20 17:44:45,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:45,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805584110] [2022-02-20 17:44:45,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:45,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:45,432 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:45,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582113405] [2022-02-20 17:44:45,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:44:45,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:45,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:45,433 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:45,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-20 17:44:46,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:44:46,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:46,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2022-02-20 17:44:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:46,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:46,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {6125#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);~counter~0 := 0; {6125#true} is VALID [2022-02-20 17:44:46,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {6125#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6125#true} is VALID [2022-02-20 17:44:46,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {6125#true} assume !(0 == assume_abort_if_not_~cond#1); {6125#true} is VALID [2022-02-20 17:44:46,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {6125#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {6139#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:46,670 INFO L290 TraceCheckUtils]: 4: Hoare triple {6139#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6139#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:46,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {6139#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {6139#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:46,671 INFO L272 TraceCheckUtils]: 6: Hoare triple {6139#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6125#true} is VALID [2022-02-20 17:44:46,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {6125#true} ~cond := #in~cond; {6125#true} is VALID [2022-02-20 17:44:46,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {6125#true} assume !(0 == ~cond); {6125#true} is VALID [2022-02-20 17:44:46,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {6125#true} assume true; {6125#true} is VALID [2022-02-20 17:44:46,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6125#true} {6139#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {6139#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:46,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {6139#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6164#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:46,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {6164#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6164#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:46,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {6164#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {6164#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:46,673 INFO L272 TraceCheckUtils]: 14: Hoare triple {6164#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6125#true} is VALID [2022-02-20 17:44:46,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {6125#true} ~cond := #in~cond; {6125#true} is VALID [2022-02-20 17:44:46,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {6125#true} assume !(0 == ~cond); {6125#true} is VALID [2022-02-20 17:44:46,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {6125#true} assume true; {6125#true} is VALID [2022-02-20 17:44:46,679 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6125#true} {6164#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #47#return; {6164#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:46,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {6164#(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_~y~0#1 + main_~x~0#1; {6189#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:46,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {6189#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6189#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:46,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {6189#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {6189#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:46,681 INFO L272 TraceCheckUtils]: 22: Hoare triple {6189#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6125#true} is VALID [2022-02-20 17:44:46,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {6125#true} ~cond := #in~cond; {6125#true} is VALID [2022-02-20 17:44:46,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {6125#true} assume !(0 == ~cond); {6125#true} is VALID [2022-02-20 17:44:46,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {6125#true} assume true; {6125#true} is VALID [2022-02-20 17:44:46,682 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6125#true} {6189#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #47#return; {6189#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:46,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {6189#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6214#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:46,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {6214#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6214#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:46,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {6214#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {6214#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:46,683 INFO L272 TraceCheckUtils]: 30: Hoare triple {6214#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6125#true} is VALID [2022-02-20 17:44:46,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {6125#true} ~cond := #in~cond; {6125#true} is VALID [2022-02-20 17:44:46,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {6125#true} assume !(0 == ~cond); {6125#true} is VALID [2022-02-20 17:44:46,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {6125#true} assume true; {6125#true} is VALID [2022-02-20 17:44:46,684 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6125#true} {6214#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} #47#return; {6214#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:46,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {6214#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6239#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:46,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {6239#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6239#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:46,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {6239#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {6239#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:46,685 INFO L272 TraceCheckUtils]: 38: Hoare triple {6239#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6125#true} is VALID [2022-02-20 17:44:46,685 INFO L290 TraceCheckUtils]: 39: Hoare triple {6125#true} ~cond := #in~cond; {6125#true} is VALID [2022-02-20 17:44:46,685 INFO L290 TraceCheckUtils]: 40: Hoare triple {6125#true} assume !(0 == ~cond); {6125#true} is VALID [2022-02-20 17:44:46,685 INFO L290 TraceCheckUtils]: 41: Hoare triple {6125#true} assume true; {6125#true} is VALID [2022-02-20 17:44:46,686 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6125#true} {6239#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #47#return; {6239#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:46,686 INFO L290 TraceCheckUtils]: 43: Hoare triple {6239#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6264#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:46,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {6264#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6264#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:46,687 INFO L290 TraceCheckUtils]: 45: Hoare triple {6264#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {6264#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:46,687 INFO L272 TraceCheckUtils]: 46: Hoare triple {6264#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6125#true} is VALID [2022-02-20 17:44:46,687 INFO L290 TraceCheckUtils]: 47: Hoare triple {6125#true} ~cond := #in~cond; {6125#true} is VALID [2022-02-20 17:44:46,687 INFO L290 TraceCheckUtils]: 48: Hoare triple {6125#true} assume !(0 == ~cond); {6125#true} is VALID [2022-02-20 17:44:46,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {6125#true} assume true; {6125#true} is VALID [2022-02-20 17:44:46,688 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6125#true} {6264#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} #47#return; {6264#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:46,688 INFO L290 TraceCheckUtils]: 51: Hoare triple {6264#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6289#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:46,689 INFO L290 TraceCheckUtils]: 52: Hoare triple {6289#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6289#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:46,689 INFO L290 TraceCheckUtils]: 53: Hoare triple {6289#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {6289#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:46,689 INFO L272 TraceCheckUtils]: 54: Hoare triple {6289#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6125#true} is VALID [2022-02-20 17:44:46,689 INFO L290 TraceCheckUtils]: 55: Hoare triple {6125#true} ~cond := #in~cond; {6125#true} is VALID [2022-02-20 17:44:46,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {6125#true} assume !(0 == ~cond); {6125#true} is VALID [2022-02-20 17:44:46,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {6125#true} assume true; {6125#true} is VALID [2022-02-20 17:44:46,690 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6125#true} {6289#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #47#return; {6289#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:46,690 INFO L290 TraceCheckUtils]: 59: Hoare triple {6289#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6314#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:46,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {6314#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6314#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:46,691 INFO L290 TraceCheckUtils]: 61: Hoare triple {6314#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {6314#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:46,691 INFO L272 TraceCheckUtils]: 62: Hoare triple {6314#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6125#true} is VALID [2022-02-20 17:44:46,691 INFO L290 TraceCheckUtils]: 63: Hoare triple {6125#true} ~cond := #in~cond; {6125#true} is VALID [2022-02-20 17:44:46,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {6125#true} assume !(0 == ~cond); {6125#true} is VALID [2022-02-20 17:44:46,691 INFO L290 TraceCheckUtils]: 65: Hoare triple {6125#true} assume true; {6125#true} is VALID [2022-02-20 17:44:46,692 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6125#true} {6314#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #47#return; {6314#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:46,692 INFO L290 TraceCheckUtils]: 67: Hoare triple {6314#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6339#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:46,692 INFO L290 TraceCheckUtils]: 68: Hoare triple {6339#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6339#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:46,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {6339#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {6339#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:46,693 INFO L272 TraceCheckUtils]: 70: Hoare triple {6339#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6125#true} is VALID [2022-02-20 17:44:46,693 INFO L290 TraceCheckUtils]: 71: Hoare triple {6125#true} ~cond := #in~cond; {6125#true} is VALID [2022-02-20 17:44:46,693 INFO L290 TraceCheckUtils]: 72: Hoare triple {6125#true} assume !(0 == ~cond); {6125#true} is VALID [2022-02-20 17:44:46,693 INFO L290 TraceCheckUtils]: 73: Hoare triple {6125#true} assume true; {6125#true} is VALID [2022-02-20 17:44:46,694 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6125#true} {6339#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} #47#return; {6339#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:46,694 INFO L290 TraceCheckUtils]: 75: Hoare triple {6339#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {6364#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:46,694 INFO L272 TraceCheckUtils]: 76: Hoare triple {6364#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6125#true} is VALID [2022-02-20 17:44:46,694 INFO L290 TraceCheckUtils]: 77: Hoare triple {6125#true} ~cond := #in~cond; {6125#true} is VALID [2022-02-20 17:44:46,694 INFO L290 TraceCheckUtils]: 78: Hoare triple {6125#true} assume !(0 == ~cond); {6125#true} is VALID [2022-02-20 17:44:46,694 INFO L290 TraceCheckUtils]: 79: Hoare triple {6125#true} assume true; {6125#true} is VALID [2022-02-20 17:44:46,695 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6125#true} {6364#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} #49#return; {6364#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:46,695 INFO L272 TraceCheckUtils]: 81: Hoare triple {6364#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |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)); {6383#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:46,696 INFO L290 TraceCheckUtils]: 82: Hoare triple {6383#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6387#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:46,696 INFO L290 TraceCheckUtils]: 83: Hoare triple {6387#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6126#false} is VALID [2022-02-20 17:44:46,696 INFO L290 TraceCheckUtils]: 84: Hoare triple {6126#false} assume !false; {6126#false} is VALID [2022-02-20 17:44:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 17:44:46,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:46,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:46,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805584110] [2022-02-20 17:44:46,957 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:46,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582113405] [2022-02-20 17:44:46,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582113405] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:46,957 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:46,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-02-20 17:44:46,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109997748] [2022-02-20 17:44:46,958 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:46,959 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 85 [2022-02-20 17:44:46,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:46,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:47,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:47,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:44:47,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:47,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:44:47,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:44:47,013 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:47,851 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2022-02-20 17:44:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:44:47,852 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 85 [2022-02-20 17:44:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-02-20 17:44:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-02-20 17:44:47,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 71 transitions. [2022-02-20 17:44:47,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:47,920 INFO L225 Difference]: With dead ends: 98 [2022-02-20 17:44:47,920 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 17:44:47,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:44:47,921 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:47,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 510 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:44:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 17:44:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-20 17:44:47,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:47,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:44:47,980 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:44:47,980 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:44:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:47,981 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-02-20 17:44:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-02-20 17:44:47,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:47,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:47,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 92 states. [2022-02-20 17:44:47,982 INFO L87 Difference]: Start difference. First operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 92 states. [2022-02-20 17:44:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:47,983 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-02-20 17:44:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-02-20 17:44:47,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:47,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:47,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:47,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:44:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-02-20 17:44:47,985 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 85 [2022-02-20 17:44:47,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:47,985 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-02-20 17:44:47,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-02-20 17:44:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 17:44:47,986 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:47,986 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:47,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:48,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-20 17:44:48,191 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1207691024, now seen corresponding path program 9 times [2022-02-20 17:44:48,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:48,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661330790] [2022-02-20 17:44:48,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:48,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:48,212 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:48,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636771486] [2022-02-20 17:44:48,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:44:48,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:48,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:48,215 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:48,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process