./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound50.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/cohencu-ll_valuebound50.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 0bcbcb4a55258889434b8bf703da9ec6fb29d07a2fbacad968a5ab15e005b314 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:15:21,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:15:21,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:15:21,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:15:21,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:15:21,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:15:21,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:15:21,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:15:21,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:15:21,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:15:21,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:15:21,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:15:21,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:15:21,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:15:21,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:15:21,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:15:21,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:15:21,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:15:21,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:15:21,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:15:21,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:15:21,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:15:21,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:15:21,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:15:21,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:15:21,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:15:21,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:15:21,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:15:21,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:15:21,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:15:21,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:15:21,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:15:21,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:15:21,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:15:21,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:15:21,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:15:21,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:15:21,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:15:21,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:15:21,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:15:21,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:15:21,166 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:15:21,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:15:21,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:15:21,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:15:21,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:15:21,180 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:15:21,180 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:15:21,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:15:21,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:15:21,181 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:15:21,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:15:21,181 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:15:21,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:15:21,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:15:21,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:15:21,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:15:21,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:15:21,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:15:21,182 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:15:21,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:15:21,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:15:21,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:15:21,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:15:21,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:15:21,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:15:21,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:15:21,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:15:21,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:15:21,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:15:21,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:15:21,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:15:21,184 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:15:21,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:15:21,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:15:21,184 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 -> 0bcbcb4a55258889434b8bf703da9ec6fb29d07a2fbacad968a5ab15e005b314 [2022-02-20 17:15:21,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:15:21,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:15:21,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:15:21,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:15:21,411 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:15:21,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound50.c [2022-02-20 17:15:21,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16098f01/b81ca4f63a05485fb2c5d96835ede3a1/FLAGa4cbe8d37 [2022-02-20 17:15:21,827 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:15:21,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound50.c [2022-02-20 17:15:21,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16098f01/b81ca4f63a05485fb2c5d96835ede3a1/FLAGa4cbe8d37 [2022-02-20 17:15:21,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16098f01/b81ca4f63a05485fb2c5d96835ede3a1 [2022-02-20 17:15:21,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:15:21,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:15:21,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:15:21,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:15:21,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:15:21,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:15:21" (1/1) ... [2022-02-20 17:15:21,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e611be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:21, skipping insertion in model container [2022-02-20 17:15:21,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:15:21" (1/1) ... [2022-02-20 17:15:21,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:15:21,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:15:22,051 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/cohencu-ll_valuebound50.c[588,601] [2022-02-20 17:15:22,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:15:22,086 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:15:22,097 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/cohencu-ll_valuebound50.c[588,601] [2022-02-20 17:15:22,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:15:22,127 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:15:22,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:22 WrapperNode [2022-02-20 17:15:22,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:15:22,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:15:22,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:15:22,129 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:15:22,134 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:15:22" (1/1) ... [2022-02-20 17:15:22,145 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:15:22" (1/1) ... [2022-02-20 17:15:22,170 INFO L137 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-02-20 17:15:22,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:15:22,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:15:22,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:15:22,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:15:22,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:22" (1/1) ... [2022-02-20 17:15:22,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:22" (1/1) ... [2022-02-20 17:15:22,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:22" (1/1) ... [2022-02-20 17:15:22,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:22" (1/1) ... [2022-02-20 17:15:22,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:22" (1/1) ... [2022-02-20 17:15:22,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:22" (1/1) ... [2022-02-20 17:15:22,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:22" (1/1) ... [2022-02-20 17:15:22,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:15:22,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:15:22,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:15:22,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:15:22,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:22" (1/1) ... [2022-02-20 17:15:22,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:15:22,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:22,235 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:15:22,248 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:15:22,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:15:22,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:15:22,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:15:22,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:15:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:15:22,269 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:15:22,309 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:15:22,310 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:15:22,432 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:15:22,437 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:15:22,437 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:15:22,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:15:22 BoogieIcfgContainer [2022-02-20 17:15:22,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:15:22,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:15:22,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:15:22,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:15:22,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:15:21" (1/3) ... [2022-02-20 17:15:22,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c506a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:15:22, skipping insertion in model container [2022-02-20 17:15:22,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:22" (2/3) ... [2022-02-20 17:15:22,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c506a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:15:22, skipping insertion in model container [2022-02-20 17:15:22,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:15:22" (3/3) ... [2022-02-20 17:15:22,444 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound50.c [2022-02-20 17:15:22,447 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:15:22,447 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:15:22,493 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:15:22,498 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:15:22,498 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:15:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:15:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:15:22,544 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:22,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:22,545 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash -588951690, now seen corresponding path program 1 times [2022-02-20 17:15:22,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:22,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153546899] [2022-02-20 17:15:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:22,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#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(13, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-02-20 17:15:22,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {30#true} is VALID [2022-02-20 17:15:22,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {31#false} is VALID [2022-02-20 17:15:22,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#false} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {31#false} is VALID [2022-02-20 17:15:22,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#false} assume false; {31#false} is VALID [2022-02-20 17:15:22,680 INFO L272 TraceCheckUtils]: 5: Hoare triple {31#false} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {31#false} is VALID [2022-02-20 17:15:22,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-02-20 17:15:22,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-02-20 17:15:22,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 17:15:22,681 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:15:22,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:22,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153546899] [2022-02-20 17:15:22,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153546899] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:22,684 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:22,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:15:22,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473559489] [2022-02-20 17:15:22,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:22,690 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:15:22,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:22,698 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:15:22,711 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:15:22,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:15:22,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:22,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:15:22,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:15:22,725 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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:15:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:22,800 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2022-02-20 17:15:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:15:22,801 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:15:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:22,801 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:15:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2022-02-20 17:15:22,808 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:15:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2022-02-20 17:15:22,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 89 transitions. [2022-02-20 17:15:22,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:22,933 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:15:22,933 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:15:22,935 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:15:22,937 INFO L933 BasicCegarLoop]: 37 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, 37 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:15:22,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:15:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:15:22,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:15:22,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:22,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 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:15:22,964 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 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:15:22,964 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 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:15:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:22,970 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2022-02-20 17:15:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-02-20 17:15:22,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:22,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:22,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 23 states. [2022-02-20 17:15:22,972 INFO L87 Difference]: Start difference. First operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 23 states. [2022-02-20 17:15:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:22,975 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2022-02-20 17:15:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-02-20 17:15:22,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:22,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:22,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:22,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 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:15:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2022-02-20 17:15:22,981 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2022-02-20 17:15:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:22,981 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2022-02-20 17:15:22,982 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:15:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-02-20 17:15:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:15:22,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:22,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:22,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:15:22,983 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:22,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1187604804, now seen corresponding path program 1 times [2022-02-20 17:15:22,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:22,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598415762] [2022-02-20 17:15:22,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:23,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {195#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(13, 2);call #Ultimate.allocInit(12, 3); {195#true} is VALID [2022-02-20 17:15:23,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {195#true} is VALID [2022-02-20 17:15:23,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} assume !(0 == assume_abort_if_not_~cond#1); {195#true} is VALID [2022-02-20 17:15:23,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {195#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {197#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-20 17:15:23,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {197#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} assume !false; {197#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-20 17:15:23,073 INFO L272 TraceCheckUtils]: 5: Hoare triple {197#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:23,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {199#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:15:23,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {196#false} is VALID [2022-02-20 17:15:23,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {196#false} assume !false; {196#false} is VALID [2022-02-20 17:15:23,074 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:15:23,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:23,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598415762] [2022-02-20 17:15:23,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598415762] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:23,075 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:23,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:15:23,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417810291] [2022-02-20 17:15:23,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:23,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:15:23,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:23,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:23,101 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:15:23,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:15:23,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:23,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:15:23,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:15:23,102 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:23,285 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-02-20 17:15:23,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:15:23,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:15:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:15:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:15:23,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-02-20 17:15:23,336 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:15:23,338 INFO L225 Difference]: With dead ends: 29 [2022-02-20 17:15:23,338 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 17:15:23,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:15:23,344 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:23,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 85 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:15:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 17:15:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 17:15:23,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:23,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:15:23,362 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:15:23,363 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:15:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:23,372 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 17:15:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 17:15:23,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:23,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:23,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 27 states. [2022-02-20 17:15:23,374 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 27 states. [2022-02-20 17:15:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:23,377 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 17:15:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 17:15:23,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:23,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:23,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:23,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:15:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-02-20 17:15:23,385 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2022-02-20 17:15:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:23,385 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-02-20 17:15:23,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 17:15:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:15:23,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:23,388 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:23,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:15:23,389 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:23,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1137950087, now seen corresponding path program 1 times [2022-02-20 17:15:23,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:23,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172863811] [2022-02-20 17:15:23,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:23,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:23,405 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:23,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316876974] [2022-02-20 17:15:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:23,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:23,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:23,448 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:15:23,466 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:15:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:23,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:15:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:23,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:23,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {342#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(13, 2);call #Ultimate.allocInit(12, 3); {342#true} is VALID [2022-02-20 17:15:23,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {342#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {342#true} is VALID [2022-02-20 17:15:23,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {342#true} assume !(0 == assume_abort_if_not_~cond#1); {342#true} is VALID [2022-02-20 17:15:23,648 INFO L290 TraceCheckUtils]: 3: Hoare triple {342#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:23,648 INFO L290 TraceCheckUtils]: 4: Hoare triple {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} assume !false; {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:23,648 INFO L272 TraceCheckUtils]: 5: Hoare triple {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {342#true} is VALID [2022-02-20 17:15:23,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {342#true} ~cond := #in~cond; {342#true} is VALID [2022-02-20 17:15:23,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#true} assume !(0 == ~cond); {342#true} is VALID [2022-02-20 17:15:23,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#true} assume true; {342#true} is VALID [2022-02-20 17:15:23,650 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {342#true} {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #54#return; {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:23,651 INFO L272 TraceCheckUtils]: 10: Hoare triple {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:23,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:23,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {343#false} is VALID [2022-02-20 17:15:23,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {343#false} assume !false; {343#false} is VALID [2022-02-20 17:15:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:15:23,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:15:23,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:23,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172863811] [2022-02-20 17:15:23,653 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:23,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316876974] [2022-02-20 17:15:23,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316876974] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:23,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:23,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:15:23,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279047822] [2022-02-20 17:15:23,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:23,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2022-02-20 17:15:23,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:23,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:15:23,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:23,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:15:23,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:23,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:15:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:15:23,667 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:15:23,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:23,854 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-02-20 17:15:23,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:15:23,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2022-02-20 17:15:23,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:15:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:15:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:15:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:15:23,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-02-20 17:15:23,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:23,915 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:15:23,915 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:15:23,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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:15:23,916 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:23,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 136 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:15:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:15:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2022-02-20 17:15:23,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:23,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 34 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:15:23,923 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 34 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:15:23,923 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 34 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:15:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:23,926 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-02-20 17:15:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2022-02-20 17:15:23,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:23,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:23,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-02-20 17:15:23,928 INFO L87 Difference]: Start difference. First operand has 34 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-02-20 17:15:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:23,930 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-02-20 17:15:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2022-02-20 17:15:23,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:23,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:23,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:23,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:15:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-02-20 17:15:23,933 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 14 [2022-02-20 17:15:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:23,933 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-02-20 17:15:23,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:15:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 17:15:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:15:23,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:23,934 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:23,953 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:15:24,147 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:15:24,147 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1500531996, now seen corresponding path program 1 times [2022-02-20 17:15:24,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:24,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397210934] [2022-02-20 17:15:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:24,160 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:24,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313553451] [2022-02-20 17:15:24,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:24,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:24,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:24,188 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:15:24,223 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:15:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:24,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:15:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:24,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:24,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#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(13, 2);call #Ultimate.allocInit(12, 3); {603#true} is VALID [2022-02-20 17:15:24,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {603#true} is VALID [2022-02-20 17:15:24,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} assume !(0 == assume_abort_if_not_~cond#1); {603#true} is VALID [2022-02-20 17:15:24,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {603#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:24,344 INFO L290 TraceCheckUtils]: 4: Hoare triple {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:24,344 INFO L272 TraceCheckUtils]: 5: Hoare triple {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {603#true} is VALID [2022-02-20 17:15:24,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#true} ~cond := #in~cond; {603#true} is VALID [2022-02-20 17:15:24,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#true} assume !(0 == ~cond); {603#true} is VALID [2022-02-20 17:15:24,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#true} assume true; {603#true} is VALID [2022-02-20 17:15:24,346 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {603#true} {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #54#return; {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:24,346 INFO L272 TraceCheckUtils]: 10: Hoare triple {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {603#true} is VALID [2022-02-20 17:15:24,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {603#true} ~cond := #in~cond; {603#true} is VALID [2022-02-20 17:15:24,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {603#true} assume !(0 == ~cond); {603#true} is VALID [2022-02-20 17:15:24,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {603#true} assume true; {603#true} is VALID [2022-02-20 17:15:24,347 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {603#true} {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #56#return; {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:24,348 INFO L272 TraceCheckUtils]: 15: Hoare triple {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {654#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:24,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {654#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {658#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:24,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {658#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {604#false} is VALID [2022-02-20 17:15:24,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {604#false} assume !false; {604#false} is VALID [2022-02-20 17:15:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:15:24,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:15:24,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:24,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397210934] [2022-02-20 17:15:24,350 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:24,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313553451] [2022-02-20 17:15:24,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313553451] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:24,350 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:24,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:15:24,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540304483] [2022-02-20 17:15:24,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:24,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:15:24,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:24,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:15:24,364 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:15:24,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:15:24,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:24,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:15:24,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:15:24,365 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:15:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:24,571 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-02-20 17:15:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:15:24,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:15:24,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:15:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:15:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:15:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:15:24,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-02-20 17:15:24,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:24,633 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:15:24,633 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:15:24,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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:15:24,634 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:24,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 133 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:15:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:15:24,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-02-20 17:15:24,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:24,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:24,641 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:24,642 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:24,644 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2022-02-20 17:15:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2022-02-20 17:15:24,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:24,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:24,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-02-20 17:15:24,645 INFO L87 Difference]: Start difference. First operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-02-20 17:15:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:24,647 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2022-02-20 17:15:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2022-02-20 17:15:24,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:24,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:24,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:24,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-02-20 17:15:24,650 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 19 [2022-02-20 17:15:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:24,650 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-02-20 17:15:24,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:15:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-02-20 17:15:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:15:24,651 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:24,651 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:24,691 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:15:24,867 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:15:24,867 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:24,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1926539111, now seen corresponding path program 1 times [2022-02-20 17:15:24,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:24,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917194496] [2022-02-20 17:15:24,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:24,878 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:24,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894434884] [2022-02-20 17:15:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:24,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:24,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:24,880 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:15:24,881 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:15:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:24,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:15:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:24,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:25,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {908#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(13, 2);call #Ultimate.allocInit(12, 3); {908#true} is VALID [2022-02-20 17:15:25,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {908#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {908#true} is VALID [2022-02-20 17:15:25,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {908#true} assume !(0 == assume_abort_if_not_~cond#1); {908#true} is VALID [2022-02-20 17:15:25,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {908#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,008 INFO L272 TraceCheckUtils]: 5: Hoare triple {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {908#true} is VALID [2022-02-20 17:15:25,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {908#true} ~cond := #in~cond; {908#true} is VALID [2022-02-20 17:15:25,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {908#true} assume !(0 == ~cond); {908#true} is VALID [2022-02-20 17:15:25,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {908#true} assume true; {908#true} is VALID [2022-02-20 17:15:25,009 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {908#true} {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,009 INFO L272 TraceCheckUtils]: 10: Hoare triple {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {908#true} is VALID [2022-02-20 17:15:25,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {908#true} ~cond := #in~cond; {908#true} is VALID [2022-02-20 17:15:25,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {908#true} assume !(0 == ~cond); {908#true} is VALID [2022-02-20 17:15:25,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {908#true} assume true; {908#true} is VALID [2022-02-20 17:15:25,010 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {908#true} {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,010 INFO L272 TraceCheckUtils]: 15: Hoare triple {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {908#true} is VALID [2022-02-20 17:15:25,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {908#true} ~cond := #in~cond; {908#true} is VALID [2022-02-20 17:15:25,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {908#true} assume !(0 == ~cond); {908#true} is VALID [2022-02-20 17:15:25,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {908#true} assume true; {908#true} is VALID [2022-02-20 17:15:25,011 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {908#true} {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,012 INFO L272 TraceCheckUtils]: 20: Hoare triple {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {974#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:25,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {974#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {978#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:25,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {978#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {909#false} is VALID [2022-02-20 17:15:25,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {909#false} assume !false; {909#false} is VALID [2022-02-20 17:15:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:15:25,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:15:25,014 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:25,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917194496] [2022-02-20 17:15:25,014 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:25,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894434884] [2022-02-20 17:15:25,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894434884] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:25,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:25,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:15:25,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125660496] [2022-02-20 17:15:25,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:25,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:15:25,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:25,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:15:25,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:25,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:15:25,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:25,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:15:25,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:15:25,029 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:15:25,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:25,212 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-02-20 17:15:25,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:15:25,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:15:25,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:25,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:15:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:15:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:15:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:15:25,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-02-20 17:15:25,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:25,287 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:15:25,287 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:15:25,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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:15:25,288 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:25,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 125 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:15:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:15:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 17:15:25,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:25,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:25,295 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:25,296 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:25,298 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-02-20 17:15:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-02-20 17:15:25,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:25,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:25,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 46 states. [2022-02-20 17:15:25,299 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 46 states. [2022-02-20 17:15:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:25,301 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-02-20 17:15:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-02-20 17:15:25,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:25,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:25,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:25,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2022-02-20 17:15:25,303 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 24 [2022-02-20 17:15:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:25,304 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2022-02-20 17:15:25,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:15:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-02-20 17:15:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 17:15:25,304 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:25,305 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:25,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 17:15:25,520 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:15:25,521 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:25,521 INFO L85 PathProgramCache]: Analyzing trace with hash -492592860, now seen corresponding path program 1 times [2022-02-20 17:15:25,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:25,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340970481] [2022-02-20 17:15:25,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:25,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:25,532 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:25,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693508124] [2022-02-20 17:15:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:25,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:25,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:25,533 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:15:25,534 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:15:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:25,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:15:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:25,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:25,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {1235#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(13, 2);call #Ultimate.allocInit(12, 3); {1235#true} is VALID [2022-02-20 17:15:25,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {1235#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1235#true} is VALID [2022-02-20 17:15:25,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {1235#true} assume !(0 == assume_abort_if_not_~cond#1); {1235#true} is VALID [2022-02-20 17:15:25,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {1235#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,745 INFO L272 TraceCheckUtils]: 5: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:25,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:25,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:25,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:25,746 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1235#true} {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,746 INFO L272 TraceCheckUtils]: 10: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:25,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:25,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:25,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:25,747 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1235#true} {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,747 INFO L272 TraceCheckUtils]: 15: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:25,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:25,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:25,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:25,748 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1235#true} {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,748 INFO L272 TraceCheckUtils]: 20: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:25,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:25,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:25,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:25,749 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1235#true} {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #60#return; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,749 INFO L272 TraceCheckUtils]: 25: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:25,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:25,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:25,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:25,751 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1235#true} {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #62#return; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:25,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !false; {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:25,752 INFO L272 TraceCheckUtils]: 32: Hoare triple {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:25,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:25,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:25,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:25,753 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1235#true} {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:25,754 INFO L272 TraceCheckUtils]: 37: Hoare triple {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1353#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:25,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {1353#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1357#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:25,754 INFO L290 TraceCheckUtils]: 39: Hoare triple {1357#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1236#false} is VALID [2022-02-20 17:15:25,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {1236#false} assume !false; {1236#false} is VALID [2022-02-20 17:15:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:15:25,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:25,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {1236#false} assume !false; {1236#false} is VALID [2022-02-20 17:15:25,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {1357#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1236#false} is VALID [2022-02-20 17:15:25,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {1353#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1357#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:25,919 INFO L272 TraceCheckUtils]: 37: Hoare triple {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1353#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:25,919 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1235#true} {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} #54#return; {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} is VALID [2022-02-20 17:15:25,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:25,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:25,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:25,920 INFO L272 TraceCheckUtils]: 32: Hoare triple {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:25,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} assume !false; {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} is VALID [2022-02-20 17:15:25,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} is VALID [2022-02-20 17:15:25,927 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1235#true} {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #62#return; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:25,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:25,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:25,927 INFO L272 TraceCheckUtils]: 25: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:25,928 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1235#true} {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #60#return; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:25,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:25,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:25,928 INFO L272 TraceCheckUtils]: 20: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:25,929 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1235#true} {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #58#return; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:25,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:25,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:25,929 INFO L272 TraceCheckUtils]: 15: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:25,930 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1235#true} {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #56#return; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:25,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:25,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:25,930 INFO L272 TraceCheckUtils]: 10: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:25,931 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1235#true} {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #54#return; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:25,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:25,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:25,931 INFO L272 TraceCheckUtils]: 5: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:25,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} assume !false; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {1235#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {1235#true} assume !(0 == assume_abort_if_not_~cond#1); {1235#true} is VALID [2022-02-20 17:15:25,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {1235#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1235#true} is VALID [2022-02-20 17:15:25,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {1235#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(13, 2);call #Ultimate.allocInit(12, 3); {1235#true} is VALID [2022-02-20 17:15:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:15:25,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:25,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340970481] [2022-02-20 17:15:25,933 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:25,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693508124] [2022-02-20 17:15:25,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693508124] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:15:25,933 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:15:25,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:15:25,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182134804] [2022-02-20 17:15:25,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:25,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2022-02-20 17:15:25,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:25,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:15:25,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:25,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:15:25,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:25,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:15:25,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:15:25,973 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:15:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:26,794 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2022-02-20 17:15:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:15:26,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2022-02-20 17:15:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:15:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-02-20 17:15:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:15:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-02-20 17:15:26,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-02-20 17:15:26,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:26,878 INFO L225 Difference]: With dead ends: 69 [2022-02-20 17:15:26,878 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 17:15:26,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:15:26,879 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:26,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 139 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:15:26,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 17:15:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2022-02-20 17:15:26,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:26,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 54 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:26,890 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 54 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:26,890 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 54 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:26,892 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2022-02-20 17:15:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-02-20 17:15:26,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:26,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:26,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 67 states. [2022-02-20 17:15:26,893 INFO L87 Difference]: Start difference. First operand has 54 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 67 states. [2022-02-20 17:15:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:26,896 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2022-02-20 17:15:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-02-20 17:15:26,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:26,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:26,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:26,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-02-20 17:15:26,898 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 41 [2022-02-20 17:15:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:26,899 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-02-20 17:15:26,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:15:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-02-20 17:15:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 17:15:26,899 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:26,900 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:26,916 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:15:27,112 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:15:27,112 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1495173479, now seen corresponding path program 2 times [2022-02-20 17:15:27,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:27,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599331567] [2022-02-20 17:15:27,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:27,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:27,123 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:27,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1875183959] [2022-02-20 17:15:27,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:15:27,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:27,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:27,125 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:15:27,126 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:15:27,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:15:27,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:27,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:15:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:27,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:27,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {1810#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(13, 2);call #Ultimate.allocInit(12, 3); {1810#true} is VALID [2022-02-20 17:15:27,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {1810#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1810#true} is VALID [2022-02-20 17:15:27,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {1810#true} assume !(0 == assume_abort_if_not_~cond#1); {1810#true} is VALID [2022-02-20 17:15:27,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {1810#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:27,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:27,328 INFO L272 TraceCheckUtils]: 5: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,329 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1810#true} {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #54#return; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:27,329 INFO L272 TraceCheckUtils]: 10: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,330 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1810#true} {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #56#return; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:27,330 INFO L272 TraceCheckUtils]: 15: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,331 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1810#true} {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #58#return; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:27,331 INFO L272 TraceCheckUtils]: 20: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,332 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1810#true} {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #60#return; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:27,332 INFO L272 TraceCheckUtils]: 25: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,333 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1810#true} {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #62#return; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:27,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:27,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !false; {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:27,334 INFO L272 TraceCheckUtils]: 32: Hoare triple {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,335 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1810#true} {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:27,335 INFO L272 TraceCheckUtils]: 37: Hoare triple {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,336 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1810#true} {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #56#return; {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:27,337 INFO L272 TraceCheckUtils]: 42: Hoare triple {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1943#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:27,337 INFO L290 TraceCheckUtils]: 43: Hoare triple {1943#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1947#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:27,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {1947#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1811#false} is VALID [2022-02-20 17:15:27,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {1811#false} assume !false; {1811#false} is VALID [2022-02-20 17:15:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 17:15:27,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:27,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {1811#false} assume !false; {1811#false} is VALID [2022-02-20 17:15:27,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {1947#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1811#false} is VALID [2022-02-20 17:15:27,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {1943#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1947#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:27,523 INFO L272 TraceCheckUtils]: 42: Hoare triple {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1943#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:27,523 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1810#true} {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} #56#return; {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:15:27,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,524 INFO L272 TraceCheckUtils]: 37: Hoare triple {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,524 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1810#true} {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} #54#return; {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:15:27,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,525 INFO L272 TraceCheckUtils]: 32: Hoare triple {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume !false; {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:15:27,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:15:27,528 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1810#true} {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #62#return; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:27,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,529 INFO L272 TraceCheckUtils]: 25: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,529 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1810#true} {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #60#return; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:27,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,530 INFO L272 TraceCheckUtils]: 20: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,530 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1810#true} {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #58#return; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:27,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,531 INFO L272 TraceCheckUtils]: 15: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,532 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1810#true} {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #56#return; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:27,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,532 INFO L272 TraceCheckUtils]: 10: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,533 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1810#true} {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #54#return; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:27,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:27,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:27,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:27,533 INFO L272 TraceCheckUtils]: 5: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:27,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} assume !false; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:27,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {1810#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:27,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {1810#true} assume !(0 == assume_abort_if_not_~cond#1); {1810#true} is VALID [2022-02-20 17:15:27,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1810#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1810#true} is VALID [2022-02-20 17:15:27,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {1810#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(13, 2);call #Ultimate.allocInit(12, 3); {1810#true} is VALID [2022-02-20 17:15:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 17:15:27,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:27,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599331567] [2022-02-20 17:15:27,535 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:27,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875183959] [2022-02-20 17:15:27,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875183959] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:15:27,536 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:15:27,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:15:27,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064525067] [2022-02-20 17:15:27,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:27,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2022-02-20 17:15:27,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:27,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:15:27,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:27,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:15:27,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:27,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:15:27,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:15:27,579 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:15:27,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:27,940 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-02-20 17:15:27,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:15:27,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2022-02-20 17:15:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:15:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-02-20 17:15:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:15:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-02-20 17:15:27,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-02-20 17:15:28,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:28,004 INFO L225 Difference]: With dead ends: 73 [2022-02-20 17:15:28,004 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 17:15:28,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:15:28,005 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:28,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 268 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:15:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 17:15:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2022-02-20 17:15:28,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:28,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:15:28,016 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:15:28,016 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:15:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:28,018 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-02-20 17:15:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-02-20 17:15:28,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:28,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:28,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 71 states. [2022-02-20 17:15:28,019 INFO L87 Difference]: Start difference. First operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 71 states. [2022-02-20 17:15:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:28,021 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-02-20 17:15:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-02-20 17:15:28,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:28,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:28,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:28,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:15:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-02-20 17:15:28,024 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 46 [2022-02-20 17:15:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:28,025 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-02-20 17:15:28,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:15:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-02-20 17:15:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 17:15:28,026 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:28,026 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:28,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:28,239 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:15:28,240 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:28,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:28,240 INFO L85 PathProgramCache]: Analyzing trace with hash 900098756, now seen corresponding path program 3 times [2022-02-20 17:15:28,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:28,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057384543] [2022-02-20 17:15:28,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:28,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:28,263 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:28,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1720025154] [2022-02-20 17:15:28,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:15:28,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:28,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:28,274 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:15:28,275 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:15:28,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 17:15:28,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:28,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 17:15:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:28,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:28,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {2437#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(13, 2);call #Ultimate.allocInit(12, 3); {2437#true} is VALID [2022-02-20 17:15:28,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {2437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2437#true} is VALID [2022-02-20 17:15:28,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {2437#true} assume !(0 == assume_abort_if_not_~cond#1); {2437#true} is VALID [2022-02-20 17:15:28,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {2437#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,577 INFO L272 TraceCheckUtils]: 5: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,579 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2437#true} {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,579 INFO L272 TraceCheckUtils]: 10: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,580 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2437#true} {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,580 INFO L272 TraceCheckUtils]: 15: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,581 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2437#true} {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,581 INFO L272 TraceCheckUtils]: 20: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,582 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2437#true} {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #60#return; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,582 INFO L272 TraceCheckUtils]: 25: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,583 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2437#true} {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #62#return; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:15:28,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} assume !false; {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:15:28,584 INFO L272 TraceCheckUtils]: 32: Hoare triple {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,586 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2437#true} {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} #54#return; {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:15:28,586 INFO L272 TraceCheckUtils]: 37: Hoare triple {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,587 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2437#true} {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} #56#return; {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:15:28,587 INFO L272 TraceCheckUtils]: 42: Hoare triple {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,588 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2437#true} {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} #58#return; {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:15:28,589 INFO L272 TraceCheckUtils]: 47: Hoare triple {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {2585#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:28,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {2585#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2589#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:28,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {2589#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2438#false} is VALID [2022-02-20 17:15:28,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {2438#false} assume !false; {2438#false} is VALID [2022-02-20 17:15:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:15:28,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:28,783 INFO L290 TraceCheckUtils]: 50: Hoare triple {2438#false} assume !false; {2438#false} is VALID [2022-02-20 17:15:28,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {2589#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2438#false} is VALID [2022-02-20 17:15:28,785 INFO L290 TraceCheckUtils]: 48: Hoare triple {2585#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2589#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:28,785 INFO L272 TraceCheckUtils]: 47: Hoare triple {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {2585#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:28,786 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2437#true} {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} #58#return; {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:15:28,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,786 INFO L272 TraceCheckUtils]: 42: Hoare triple {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,787 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2437#true} {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} #56#return; {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:15:28,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,788 INFO L272 TraceCheckUtils]: 37: Hoare triple {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,788 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2437#true} {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} #54#return; {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:15:28,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,788 INFO L272 TraceCheckUtils]: 32: Hoare triple {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} assume !false; {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:15:28,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:15:28,792 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2437#true} {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #62#return; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:28,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,792 INFO L272 TraceCheckUtils]: 25: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,793 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2437#true} {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #60#return; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:28,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,793 INFO L272 TraceCheckUtils]: 20: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,796 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2437#true} {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #58#return; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:28,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,796 INFO L272 TraceCheckUtils]: 15: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,797 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2437#true} {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #56#return; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:28,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,797 INFO L272 TraceCheckUtils]: 10: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,797 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2437#true} {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #54#return; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:28,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:28,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:28,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:28,798 INFO L272 TraceCheckUtils]: 5: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:28,798 INFO L290 TraceCheckUtils]: 4: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} assume !false; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:28,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {2437#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:28,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {2437#true} assume !(0 == assume_abort_if_not_~cond#1); {2437#true} is VALID [2022-02-20 17:15:28,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {2437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2437#true} is VALID [2022-02-20 17:15:28,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {2437#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(13, 2);call #Ultimate.allocInit(12, 3); {2437#true} is VALID [2022-02-20 17:15:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:15:28,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:28,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057384543] [2022-02-20 17:15:28,799 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:28,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720025154] [2022-02-20 17:15:28,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720025154] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:15:28,799 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:15:28,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:15:28,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227924894] [2022-02-20 17:15:28,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:28,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 51 [2022-02-20 17:15:28,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:28,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:28,842 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:15:28,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:15:28,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:28,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:15:28,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:15:28,842 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:29,793 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2022-02-20 17:15:29,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:15:29,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 51 [2022-02-20 17:15:29,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-02-20 17:15:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-02-20 17:15:29,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-02-20 17:15:29,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:29,884 INFO L225 Difference]: With dead ends: 85 [2022-02-20 17:15:29,884 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 17:15:29,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:15:29,885 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:29,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:15:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 17:15:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-02-20 17:15:29,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:29,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 71 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:29,910 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 71 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:29,911 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 71 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:29,914 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-02-20 17:15:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-02-20 17:15:29,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:29,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:29,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 77 states. [2022-02-20 17:15:29,916 INFO L87 Difference]: Start difference. First operand has 71 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 77 states. [2022-02-20 17:15:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:29,917 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-02-20 17:15:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-02-20 17:15:29,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:29,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:29,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:29,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-02-20 17:15:29,942 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 51 [2022-02-20 17:15:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:29,943 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-02-20 17:15:29,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:29,944 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-02-20 17:15:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 17:15:29,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:29,945 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:29,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-20 17:15:30,159 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:15:30,159 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:30,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:30,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1061977627, now seen corresponding path program 1 times [2022-02-20 17:15:30,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:30,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7266672] [2022-02-20 17:15:30,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:30,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:30,170 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:30,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1458429298] [2022-02-20 17:15:30,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:30,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:30,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:30,171 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:15:30,175 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:15:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:30,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 17:15:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:30,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:30,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {3132#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(13, 2);call #Ultimate.allocInit(12, 3); {3132#true} is VALID [2022-02-20 17:15:30,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {3132#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3132#true} is VALID [2022-02-20 17:15:30,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {3132#true} assume !(0 == assume_abort_if_not_~cond#1); {3132#true} is VALID [2022-02-20 17:15:30,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {3132#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:30,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:30,642 INFO L272 TraceCheckUtils]: 5: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:30,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:30,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:30,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:30,643 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3132#true} {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:30,643 INFO L272 TraceCheckUtils]: 10: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:30,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:30,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:30,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:30,644 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3132#true} {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:30,644 INFO L272 TraceCheckUtils]: 15: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:30,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:30,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:30,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:30,645 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3132#true} {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:30,646 INFO L272 TraceCheckUtils]: 20: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:30,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:30,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:30,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:30,650 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3132#true} {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #60#return; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:30,650 INFO L272 TraceCheckUtils]: 25: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:30,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:30,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:30,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:30,653 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3132#true} {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #62#return; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:30,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:30,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !false; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:30,656 INFO L272 TraceCheckUtils]: 32: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:30,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:30,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:30,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:30,657 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3132#true} {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:30,657 INFO L272 TraceCheckUtils]: 37: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:30,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:30,657 INFO L290 TraceCheckUtils]: 39: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:30,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:30,658 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3132#true} {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #56#return; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:30,658 INFO L272 TraceCheckUtils]: 42: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:30,658 INFO L290 TraceCheckUtils]: 43: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:30,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:30,658 INFO L290 TraceCheckUtils]: 45: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:30,659 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3132#true} {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #58#return; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:30,659 INFO L272 TraceCheckUtils]: 47: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:30,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:30,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:30,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:30,660 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3132#true} {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #60#return; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:30,660 INFO L272 TraceCheckUtils]: 52: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:30,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:30,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:30,660 INFO L290 TraceCheckUtils]: 55: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:30,661 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3132#true} {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #62#return; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:30,661 INFO L290 TraceCheckUtils]: 57: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !(main_~n~0#1 <= main_~a~0#1); {3310#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:30,661 INFO L272 TraceCheckUtils]: 58: Hoare triple {3310#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:30,662 INFO L290 TraceCheckUtils]: 59: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:30,662 INFO L290 TraceCheckUtils]: 60: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:30,662 INFO L290 TraceCheckUtils]: 61: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:30,662 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {3132#true} {3310#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #64#return; {3310#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:30,663 INFO L272 TraceCheckUtils]: 63: Hoare triple {3310#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3329#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:30,663 INFO L290 TraceCheckUtils]: 64: Hoare triple {3329#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3333#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:30,664 INFO L290 TraceCheckUtils]: 65: Hoare triple {3333#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3133#false} is VALID [2022-02-20 17:15:30,664 INFO L290 TraceCheckUtils]: 66: Hoare triple {3133#false} assume !false; {3133#false} is VALID [2022-02-20 17:15:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-02-20 17:15:30,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:31,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:31,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7266672] [2022-02-20 17:15:31,059 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:31,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458429298] [2022-02-20 17:15:31,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458429298] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:31,059 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:31,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:15:31,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440241786] [2022-02-20 17:15:31,060 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:31,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 67 [2022-02-20 17:15:31,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:31,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:15:31,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:31,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:15:31,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:31,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:15:31,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:15:31,091 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:15:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:31,407 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-02-20 17:15:31,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:15:31,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 67 [2022-02-20 17:15:31,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:15:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 17:15:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:15:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 17:15:31,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-02-20 17:15:31,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:31,464 INFO L225 Difference]: With dead ends: 87 [2022-02-20 17:15:31,464 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 17:15:31,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 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:15:31,465 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:31,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:15:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 17:15:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-02-20 17:15:31,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:31,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 84 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:31,493 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 84 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:31,493 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 84 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:31,501 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-02-20 17:15:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-02-20 17:15:31,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:31,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:31,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 85 states. [2022-02-20 17:15:31,502 INFO L87 Difference]: Start difference. First operand has 84 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 85 states. [2022-02-20 17:15:31,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:31,505 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-02-20 17:15:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-02-20 17:15:31,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:31,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:31,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:31,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-02-20 17:15:31,508 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 67 [2022-02-20 17:15:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:31,508 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-02-20 17:15:31,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:15:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-02-20 17:15:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 17:15:31,509 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:31,509 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:31,543 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:15:31,726 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:15:31,726 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:31,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1246911088, now seen corresponding path program 1 times [2022-02-20 17:15:31,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:31,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819532704] [2022-02-20 17:15:31,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:31,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:31,751 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:31,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1839211390] [2022-02-20 17:15:31,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:31,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:31,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:31,753 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:15:31,754 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:15:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:31,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:15:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:31,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:32,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {3874#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(13, 2);call #Ultimate.allocInit(12, 3); {3874#true} is VALID [2022-02-20 17:15:32,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {3874#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3874#true} is VALID [2022-02-20 17:15:32,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume !(0 == assume_abort_if_not_~cond#1); {3874#true} is VALID [2022-02-20 17:15:32,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {3874#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:32,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} assume !false; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:32,474 INFO L272 TraceCheckUtils]: 5: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:32,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:32,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:32,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:32,474 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3874#true} {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #54#return; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:32,474 INFO L272 TraceCheckUtils]: 10: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:32,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:32,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:32,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:32,475 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3874#true} {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #56#return; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:32,475 INFO L272 TraceCheckUtils]: 15: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:32,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:32,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:32,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:32,476 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3874#true} {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #58#return; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:32,476 INFO L272 TraceCheckUtils]: 20: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:32,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:32,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:32,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:32,477 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3874#true} {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #60#return; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:32,477 INFO L272 TraceCheckUtils]: 25: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:32,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:32,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:32,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:32,478 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3874#true} {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #62#return; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:32,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:32,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !false; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:32,479 INFO L272 TraceCheckUtils]: 32: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:32,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:32,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:32,479 INFO L290 TraceCheckUtils]: 35: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:32,480 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3874#true} {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:32,480 INFO L272 TraceCheckUtils]: 37: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:32,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:32,480 INFO L290 TraceCheckUtils]: 39: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:32,480 INFO L290 TraceCheckUtils]: 40: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:32,480 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3874#true} {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #56#return; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:32,480 INFO L272 TraceCheckUtils]: 42: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:32,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:32,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:32,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:32,481 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3874#true} {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #58#return; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:32,481 INFO L272 TraceCheckUtils]: 47: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:32,481 INFO L290 TraceCheckUtils]: 48: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:32,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:32,482 INFO L290 TraceCheckUtils]: 50: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:32,482 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3874#true} {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #60#return; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:32,482 INFO L272 TraceCheckUtils]: 52: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:32,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:32,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:32,482 INFO L290 TraceCheckUtils]: 55: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:32,483 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3874#true} {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #62#return; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:32,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !(main_~n~0#1 <= main_~a~0#1); {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:32,484 INFO L272 TraceCheckUtils]: 58: Hoare triple {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:32,484 INFO L290 TraceCheckUtils]: 59: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:32,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:32,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:32,484 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {3874#true} {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} #64#return; {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:32,484 INFO L272 TraceCheckUtils]: 63: Hoare triple {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:32,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:32,485 INFO L290 TraceCheckUtils]: 65: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:32,485 INFO L290 TraceCheckUtils]: 66: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:32,485 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3874#true} {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} #66#return; {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:32,486 INFO L272 TraceCheckUtils]: 68: Hoare triple {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~a~0#1 * main_~z~0#1 - 6 * main_~a~0#1 - 2 * main_~y~0#1 + 2 * main_~z~0#1 - 10 then 1 else 0)); {4086#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:32,487 INFO L290 TraceCheckUtils]: 69: Hoare triple {4086#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4090#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:32,487 INFO L290 TraceCheckUtils]: 70: Hoare triple {4090#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3875#false} is VALID [2022-02-20 17:15:32,487 INFO L290 TraceCheckUtils]: 71: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-02-20 17:15:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-02-20 17:15:32,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:44,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:44,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819532704] [2022-02-20 17:15:44,358 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:44,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839211390] [2022-02-20 17:15:44,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839211390] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:44,358 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:44,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:15:44,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018720987] [2022-02-20 17:15:44,358 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:44,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2022-02-20 17:15:44,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:44,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:15:44,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:44,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:15:44,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:44,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:15:44,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:15:44,392 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:15:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:44,684 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-02-20 17:15:44,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:15:44,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2022-02-20 17:15:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:15:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 17:15:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:15:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 17:15:44,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-02-20 17:15:44,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:44,765 INFO L225 Difference]: With dead ends: 91 [2022-02-20 17:15:44,766 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 17:15:44,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:15:44,766 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:44,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 198 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:15:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 17:15:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-20 17:15:44,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:44,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:44,794 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:44,794 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:44,795 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-02-20 17:15:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-02-20 17:15:44,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:44,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:44,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 78 states. [2022-02-20 17:15:44,796 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 78 states. [2022-02-20 17:15:44,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:44,798 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-02-20 17:15:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-02-20 17:15:44,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:44,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:44,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:44,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-02-20 17:15:44,802 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 72 [2022-02-20 17:15:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:44,802 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-02-20 17:15:44,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:15:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-02-20 17:15:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 17:15:44,803 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:44,803 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:44,819 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:15:45,016 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:15:45,016 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:45,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1961933060, now seen corresponding path program 4 times [2022-02-20 17:15:45,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:45,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118621991] [2022-02-20 17:15:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:45,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:45,026 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:45,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [234272002] [2022-02-20 17:15:45,026 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:15:45,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:45,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:45,038 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:15:45,039 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:15:45,077 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:15:45,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:45,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 17:15:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:45,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:45,450 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(13, 2);call #Ultimate.allocInit(12, 3); {4628#true} is VALID [2022-02-20 17:15:45,450 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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 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:15:45,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {4628#true} assume !(0 == assume_abort_if_not_~cond#1); {4628#true} is VALID [2022-02-20 17:15:45,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {4628#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:45,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:45,451 INFO L272 TraceCheckUtils]: 5: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:45,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:45,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:45,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:45,452 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4628#true} {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:45,452 INFO L272 TraceCheckUtils]: 10: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:45,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:45,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:45,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:45,455 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4628#true} {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:45,455 INFO L272 TraceCheckUtils]: 15: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:45,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:45,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:45,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:45,458 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4628#true} {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:45,458 INFO L272 TraceCheckUtils]: 20: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:45,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:45,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:45,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:45,458 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4628#true} {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #60#return; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:45,459 INFO L272 TraceCheckUtils]: 25: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:45,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:45,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:45,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:45,459 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4628#true} {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #62#return; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:45,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:45,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !false; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:45,460 INFO L272 TraceCheckUtils]: 32: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:45,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:45,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:45,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:45,461 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4628#true} {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:45,461 INFO L272 TraceCheckUtils]: 37: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:45,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {4628#true} ~cond := #in~cond; {4749#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:45,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {4749#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:45,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:45,462 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #56#return; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:45,463 INFO L272 TraceCheckUtils]: 42: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:45,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:45,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:45,463 INFO L290 TraceCheckUtils]: 45: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:45,463 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4628#true} {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #58#return; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:45,463 INFO L272 TraceCheckUtils]: 47: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:45,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:45,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:45,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:45,464 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4628#true} {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #60#return; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:45,464 INFO L272 TraceCheckUtils]: 52: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:45,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:45,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:45,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:45,465 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4628#true} {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #62#return; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:45,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:15:45,466 INFO L290 TraceCheckUtils]: 58: Hoare triple {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} assume !false; {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:15:45,466 INFO L272 TraceCheckUtils]: 59: Hoare triple {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:45,466 INFO L290 TraceCheckUtils]: 60: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:45,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:45,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:45,467 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {4628#true} {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} #54#return; {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:15:45,467 INFO L272 TraceCheckUtils]: 64: Hoare triple {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:45,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {4628#true} ~cond := #in~cond; {4749#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:45,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {4749#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:45,468 INFO L290 TraceCheckUtils]: 67: Hoare triple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:45,468 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} #56#return; {4842#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:15:45,469 INFO L272 TraceCheckUtils]: 69: Hoare triple {4842#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4846#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:45,469 INFO L290 TraceCheckUtils]: 70: Hoare triple {4846#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4850#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:45,469 INFO L290 TraceCheckUtils]: 71: Hoare triple {4850#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4629#false} is VALID [2022-02-20 17:15:45,469 INFO L290 TraceCheckUtils]: 72: Hoare triple {4629#false} assume !false; {4629#false} is VALID [2022-02-20 17:15:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 70 proven. 29 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-02-20 17:15:45,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:46,136 INFO L290 TraceCheckUtils]: 72: Hoare triple {4629#false} assume !false; {4629#false} is VALID [2022-02-20 17:15:46,137 INFO L290 TraceCheckUtils]: 71: Hoare triple {4850#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4629#false} is VALID [2022-02-20 17:15:46,137 INFO L290 TraceCheckUtils]: 70: Hoare triple {4846#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4850#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:46,137 INFO L272 TraceCheckUtils]: 69: Hoare triple {4866#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4846#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:46,138 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #56#return; {4866#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:15:46,138 INFO L290 TraceCheckUtils]: 67: Hoare triple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:46,139 INFO L290 TraceCheckUtils]: 66: Hoare triple {4880#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:46,139 INFO L290 TraceCheckUtils]: 65: Hoare triple {4628#true} ~cond := #in~cond; {4880#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:15:46,139 INFO L272 TraceCheckUtils]: 64: Hoare triple {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:46,140 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {4628#true} {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #54#return; {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:46,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:46,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:46,140 INFO L272 TraceCheckUtils]: 59: Hoare triple {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:46,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} assume !false; {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,148 INFO L290 TraceCheckUtils]: 57: Hoare triple {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,149 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4628#true} {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} #62#return; {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-20 17:15:46,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:46,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:46,149 INFO L290 TraceCheckUtils]: 53: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:46,149 INFO L272 TraceCheckUtils]: 52: Hoare triple {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:46,150 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4628#true} {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} #60#return; {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-20 17:15:46,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:46,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:46,150 INFO L290 TraceCheckUtils]: 48: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:46,150 INFO L272 TraceCheckUtils]: 47: Hoare triple {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:46,151 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4628#true} {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} #58#return; {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-20 17:15:46,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:46,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:46,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:46,151 INFO L272 TraceCheckUtils]: 42: Hoare triple {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:46,152 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #56#return; {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-20 17:15:46,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:46,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {4880#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:46,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {4628#true} ~cond := #in~cond; {4880#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:15:46,153 INFO L272 TraceCheckUtils]: 37: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:46,153 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4628#true} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #54#return; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:46,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:46,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:46,154 INFO L272 TraceCheckUtils]: 32: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:46,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} assume !false; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,161 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4628#true} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #62#return; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:46,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:46,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:46,161 INFO L272 TraceCheckUtils]: 25: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:46,162 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4628#true} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #60#return; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:46,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:46,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:46,162 INFO L272 TraceCheckUtils]: 20: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:46,162 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4628#true} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #58#return; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:46,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:46,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:46,163 INFO L272 TraceCheckUtils]: 15: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:46,163 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4628#true} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #56#return; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:46,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:46,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:46,163 INFO L272 TraceCheckUtils]: 10: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:46,164 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4628#true} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #54#return; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:46,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:46,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:46,164 INFO L272 TraceCheckUtils]: 5: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:46,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} assume !false; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {4628#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:46,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {4628#true} assume !(0 == assume_abort_if_not_~cond#1); {4628#true} is VALID [2022-02-20 17:15:46,166 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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 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:15:46,166 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(13, 2);call #Ultimate.allocInit(12, 3); {4628#true} is VALID [2022-02-20 17:15:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-20 17:15:46,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:46,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118621991] [2022-02-20 17:15:46,166 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:46,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234272002] [2022-02-20 17:15:46,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234272002] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:15:46,166 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:15:46,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-02-20 17:15:46,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40674969] [2022-02-20 17:15:46,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:46,167 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) Word has length 73 [2022-02-20 17:15:46,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:46,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-02-20 17:15:46,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:46,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:15:46,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:46,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:15:46,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:15:46,243 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-02-20 17:15:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:48,484 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-02-20 17:15:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:15:48,484 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) Word has length 73 [2022-02-20 17:15:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-02-20 17:15:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2022-02-20 17:15:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-02-20 17:15:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2022-02-20 17:15:48,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 79 transitions. [2022-02-20 17:15:48,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:48,564 INFO L225 Difference]: With dead ends: 109 [2022-02-20 17:15:48,564 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 17:15:48,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:15:48,565 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 27 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:48,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 161 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 17:15:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 17:15:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2022-02-20 17:15:48,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:48,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 97 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:48,591 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 97 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:48,591 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 97 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:48,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:48,608 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-02-20 17:15:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-02-20 17:15:48,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:48,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:48,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 107 states. [2022-02-20 17:15:48,620 INFO L87 Difference]: Start difference. First operand has 97 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 107 states. [2022-02-20 17:15:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:48,622 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-02-20 17:15:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-02-20 17:15:48,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:48,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:48,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:48,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2022-02-20 17:15:48,625 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 73 [2022-02-20 17:15:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:48,626 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2022-02-20 17:15:48,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-02-20 17:15:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-02-20 17:15:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 17:15:48,626 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:48,627 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:48,645 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:15:48,827 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:15:48,827 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:48,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash 671163038, now seen corresponding path program 2 times [2022-02-20 17:15:48,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:48,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905921455] [2022-02-20 17:15:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:48,838 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:48,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854611394] [2022-02-20 17:15:48,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:15:48,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:48,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:48,854 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:15:48,855 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:15:48,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:15:48,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:48,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 17:15:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:48,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:49,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {5594#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(13, 2);call #Ultimate.allocInit(12, 3); {5594#true} is VALID [2022-02-20 17:15:49,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5594#true} is VALID [2022-02-20 17:15:49,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {5594#true} assume !(0 == assume_abort_if_not_~cond#1); {5594#true} is VALID [2022-02-20 17:15:49,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {5594#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:49,487 INFO L290 TraceCheckUtils]: 4: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:49,487 INFO L272 TraceCheckUtils]: 5: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,487 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5594#true} {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:49,487 INFO L272 TraceCheckUtils]: 10: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,488 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5594#true} {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:49,488 INFO L272 TraceCheckUtils]: 15: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,489 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5594#true} {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:49,489 INFO L272 TraceCheckUtils]: 20: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,491 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5594#true} {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #60#return; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:49,491 INFO L272 TraceCheckUtils]: 25: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,492 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5594#true} {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #62#return; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:49,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:49,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !false; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:49,493 INFO L272 TraceCheckUtils]: 32: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,494 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5594#true} {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #54#return; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:49,494 INFO L272 TraceCheckUtils]: 37: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,495 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5594#true} {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #56#return; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:49,495 INFO L272 TraceCheckUtils]: 42: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,503 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5594#true} {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #58#return; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:49,503 INFO L272 TraceCheckUtils]: 47: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,504 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5594#true} {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #60#return; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:49,504 INFO L272 TraceCheckUtils]: 52: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,504 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5594#true} {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #62#return; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:49,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:49,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} assume !false; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:49,505 INFO L272 TraceCheckUtils]: 59: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,506 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {5594#true} {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #54#return; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:49,506 INFO L272 TraceCheckUtils]: 64: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,506 INFO L290 TraceCheckUtils]: 66: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,506 INFO L290 TraceCheckUtils]: 67: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,507 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5594#true} {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #56#return; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:49,507 INFO L272 TraceCheckUtils]: 69: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,507 INFO L290 TraceCheckUtils]: 70: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,507 INFO L290 TraceCheckUtils]: 71: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,507 INFO L290 TraceCheckUtils]: 72: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,508 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5594#true} {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #58#return; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:49,520 INFO L272 TraceCheckUtils]: 74: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,520 INFO L290 TraceCheckUtils]: 75: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,520 INFO L290 TraceCheckUtils]: 76: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,520 INFO L290 TraceCheckUtils]: 77: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,521 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5594#true} {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #60#return; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:49,521 INFO L272 TraceCheckUtils]: 79: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,521 INFO L290 TraceCheckUtils]: 80: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,521 INFO L290 TraceCheckUtils]: 81: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,521 INFO L290 TraceCheckUtils]: 82: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,522 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {5594#true} {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #62#return; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:49,522 INFO L290 TraceCheckUtils]: 84: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} assume !(main_~n~0#1 <= main_~a~0#1); {5854#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:49,522 INFO L272 TraceCheckUtils]: 85: Hoare triple {5854#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:49,523 INFO L290 TraceCheckUtils]: 86: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:49,523 INFO L290 TraceCheckUtils]: 87: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:49,523 INFO L290 TraceCheckUtils]: 88: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:49,523 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {5594#true} {5854#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #64#return; {5854#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:49,524 INFO L272 TraceCheckUtils]: 90: Hoare triple {5854#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:49,524 INFO L290 TraceCheckUtils]: 91: Hoare triple {5873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:49,525 INFO L290 TraceCheckUtils]: 92: Hoare triple {5877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5595#false} is VALID [2022-02-20 17:15:49,525 INFO L290 TraceCheckUtils]: 93: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-02-20 17:15:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-02-20 17:15:49,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:49,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:49,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905921455] [2022-02-20 17:15:49,895 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:49,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854611394] [2022-02-20 17:15:49,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854611394] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:49,895 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:49,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:15:49,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981035049] [2022-02-20 17:15:49,896 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:49,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 94 [2022-02-20 17:15:49,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:49,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:49,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:49,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:15:49,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:49,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:15:49,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:15:49,938 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:50,475 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2022-02-20 17:15:50,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:15:50,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 94 [2022-02-20 17:15:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-02-20 17:15:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-02-20 17:15:50,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-02-20 17:15:50,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:50,547 INFO L225 Difference]: With dead ends: 122 [2022-02-20 17:15:50,547 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 17:15:50,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:15:50,547 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:50,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:15:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 17:15:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-02-20 17:15:50,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:50,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 119 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 25 states have call successors, (25), 20 states have call predecessors, (25), 20 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:50,587 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 119 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 25 states have call successors, (25), 20 states have call predecessors, (25), 20 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:50,587 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 119 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 25 states have call successors, (25), 20 states have call predecessors, (25), 20 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:50,589 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-02-20 17:15:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-02-20 17:15:50,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:50,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:50,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 25 states have call successors, (25), 20 states have call predecessors, (25), 20 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 120 states. [2022-02-20 17:15:50,590 INFO L87 Difference]: Start difference. First operand has 119 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 25 states have call successors, (25), 20 states have call predecessors, (25), 20 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 120 states. [2022-02-20 17:15:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:50,592 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-02-20 17:15:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-02-20 17:15:50,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:50,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:50,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:50,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 25 states have call successors, (25), 20 states have call predecessors, (25), 20 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2022-02-20 17:15:50,594 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 94 [2022-02-20 17:15:50,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:50,595 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2022-02-20 17:15:50,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-02-20 17:15:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 17:15:50,596 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:50,596 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:50,629 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:15:50,812 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:15:50,813 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:50,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash -674604307, now seen corresponding path program 2 times [2022-02-20 17:15:50,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:50,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268311298] [2022-02-20 17:15:50,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:50,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:50,822 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:50,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21538430] [2022-02-20 17:15:50,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:15:50,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:50,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:50,824 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:15:50,825 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:15:50,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:15:50,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:50,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 17:15:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:50,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:51,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {6584#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(13, 2);call #Ultimate.allocInit(12, 3); {6584#true} is VALID [2022-02-20 17:15:51,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {6584#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6584#true} is VALID [2022-02-20 17:15:51,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {6584#true} assume !(0 == assume_abort_if_not_~cond#1); {6584#true} is VALID [2022-02-20 17:15:51,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {6584#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:51,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:51,421 INFO L272 TraceCheckUtils]: 5: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,422 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6584#true} {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:51,422 INFO L272 TraceCheckUtils]: 10: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,423 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6584#true} {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:51,423 INFO L272 TraceCheckUtils]: 15: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,424 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6584#true} {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:51,424 INFO L272 TraceCheckUtils]: 20: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,424 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6584#true} {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #60#return; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:51,424 INFO L272 TraceCheckUtils]: 25: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,425 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6584#true} {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #62#return; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:51,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:51,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !false; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:51,426 INFO L272 TraceCheckUtils]: 32: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,427 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6584#true} {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:51,427 INFO L272 TraceCheckUtils]: 37: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,427 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6584#true} {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} #56#return; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:51,427 INFO L272 TraceCheckUtils]: 42: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,427 INFO L290 TraceCheckUtils]: 43: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,428 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6584#true} {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} #58#return; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:51,428 INFO L272 TraceCheckUtils]: 47: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,428 INFO L290 TraceCheckUtils]: 49: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,428 INFO L290 TraceCheckUtils]: 50: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,429 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6584#true} {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} #60#return; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:51,429 INFO L272 TraceCheckUtils]: 52: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,429 INFO L290 TraceCheckUtils]: 53: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,429 INFO L290 TraceCheckUtils]: 55: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,429 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6584#true} {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} #62#return; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:51,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:51,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} assume !false; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:51,430 INFO L272 TraceCheckUtils]: 59: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,430 INFO L290 TraceCheckUtils]: 60: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,431 INFO L290 TraceCheckUtils]: 61: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,431 INFO L290 TraceCheckUtils]: 62: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,431 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6584#true} {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #54#return; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:51,431 INFO L272 TraceCheckUtils]: 64: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,431 INFO L290 TraceCheckUtils]: 65: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,431 INFO L290 TraceCheckUtils]: 66: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,431 INFO L290 TraceCheckUtils]: 67: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,432 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6584#true} {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #56#return; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:51,432 INFO L272 TraceCheckUtils]: 69: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,432 INFO L290 TraceCheckUtils]: 70: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,432 INFO L290 TraceCheckUtils]: 71: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,432 INFO L290 TraceCheckUtils]: 72: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,432 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6584#true} {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #58#return; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:51,433 INFO L272 TraceCheckUtils]: 74: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,433 INFO L290 TraceCheckUtils]: 75: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,433 INFO L290 TraceCheckUtils]: 76: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,433 INFO L290 TraceCheckUtils]: 77: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,433 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6584#true} {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #60#return; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:51,433 INFO L272 TraceCheckUtils]: 79: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,433 INFO L290 TraceCheckUtils]: 80: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,433 INFO L290 TraceCheckUtils]: 81: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,434 INFO L290 TraceCheckUtils]: 82: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,434 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {6584#true} {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #62#return; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:51,434 INFO L290 TraceCheckUtils]: 84: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} assume !(main_~n~0#1 <= main_~a~0#1); {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:51,434 INFO L272 TraceCheckUtils]: 85: Hoare triple {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,435 INFO L290 TraceCheckUtils]: 86: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,435 INFO L290 TraceCheckUtils]: 87: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,435 INFO L290 TraceCheckUtils]: 88: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,435 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {6584#true} {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #64#return; {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:51,435 INFO L272 TraceCheckUtils]: 90: Hoare triple {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:51,435 INFO L290 TraceCheckUtils]: 91: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:51,435 INFO L290 TraceCheckUtils]: 92: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:51,435 INFO L290 TraceCheckUtils]: 93: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:51,450 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6584#true} {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #66#return; {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:51,452 INFO L272 TraceCheckUtils]: 95: Hoare triple {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == main_~a~0#1 * main_~z~0#1 - 6 * main_~a~0#1 - 2 * main_~y~0#1 + 2 * main_~z~0#1 - 10 then 1 else 0)); {6878#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:51,452 INFO L290 TraceCheckUtils]: 96: Hoare triple {6878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:51,452 INFO L290 TraceCheckUtils]: 97: Hoare triple {6882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6585#false} is VALID [2022-02-20 17:15:51,453 INFO L290 TraceCheckUtils]: 98: Hoare triple {6585#false} assume !false; {6585#false} is VALID [2022-02-20 17:15:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-02-20 17:15:51,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:16:01,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:01,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268311298] [2022-02-20 17:16:01,686 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:01,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21538430] [2022-02-20 17:16:01,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21538430] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:16:01,686 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:16:01,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:16:01,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984067976] [2022-02-20 17:16:01,686 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:16:01,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 99 [2022-02-20 17:16:01,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:01,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:16:01,734 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:16:01,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:16:01,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:01,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:16:01,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:16:01,736 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:16:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:02,279 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-02-20 17:16:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:16:02,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 99 [2022-02-20 17:16:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:16:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-02-20 17:16:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:16:02,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-02-20 17:16:02,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-02-20 17:16:02,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:02,358 INFO L225 Difference]: With dead ends: 130 [2022-02-20 17:16:02,358 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 17:16:02,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:16:02,361 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:02,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:16:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 17:16:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-02-20 17:16:02,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:02,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 74 states have internal predecessors, (75), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:02,424 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 74 states have internal predecessors, (75), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:02,425 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 74 states have internal predecessors, (75), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:02,426 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-02-20 17:16:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-02-20 17:16:02,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:02,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:02,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 74 states have internal predecessors, (75), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 117 states. [2022-02-20 17:16:02,428 INFO L87 Difference]: Start difference. First operand has 117 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 74 states have internal predecessors, (75), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 117 states. [2022-02-20 17:16:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:02,430 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-02-20 17:16:02,430 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-02-20 17:16:02,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:02,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:02,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:02,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 74 states have internal predecessors, (75), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2022-02-20 17:16:02,436 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 99 [2022-02-20 17:16:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:02,436 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2022-02-20 17:16:02,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:16:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-02-20 17:16:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-20 17:16:02,438 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:02,438 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:02,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 17:16:02,655 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:16:02,655 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:02,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1837317061, now seen corresponding path program 3 times [2022-02-20 17:16:02,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:02,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776581436] [2022-02-20 17:16:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:02,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:02,680 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:02,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270244292] [2022-02-20 17:16:02,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:16:02,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:02,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:02,689 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:16:02,691 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:16:03,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 17:16:03,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:16:03,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 17:16:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:03,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:06,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {7604#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(13, 2);call #Ultimate.allocInit(12, 3); {7604#true} is VALID [2022-02-20 17:16:06,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {7604#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {7612#(and (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (or (not (<= |ULTIMATE.start_main_~a~0#1| 50)) (not (<= 0 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767) (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)))))} is VALID [2022-02-20 17:16:06,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {7612#(and (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (or (not (<= |ULTIMATE.start_main_~a~0#1| 50)) (not (<= 0 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767) (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)))))} assume !(0 == assume_abort_if_not_~cond#1); {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,187 INFO L272 TraceCheckUtils]: 5: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,188 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,189 INFO L272 TraceCheckUtils]: 10: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,203 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,203 INFO L272 TraceCheckUtils]: 15: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,216 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,216 INFO L272 TraceCheckUtils]: 20: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,217 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,217 INFO L272 TraceCheckUtils]: 25: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,218 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,219 INFO L272 TraceCheckUtils]: 32: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,219 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,220 INFO L272 TraceCheckUtils]: 37: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,220 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,220 INFO L272 TraceCheckUtils]: 42: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,221 INFO L290 TraceCheckUtils]: 45: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,221 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,221 INFO L272 TraceCheckUtils]: 47: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,222 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,222 INFO L272 TraceCheckUtils]: 52: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,222 INFO L290 TraceCheckUtils]: 54: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,222 INFO L290 TraceCheckUtils]: 55: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,223 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,224 INFO L290 TraceCheckUtils]: 58: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,224 INFO L272 TraceCheckUtils]: 59: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,224 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,225 INFO L272 TraceCheckUtils]: 64: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,225 INFO L290 TraceCheckUtils]: 66: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,225 INFO L290 TraceCheckUtils]: 67: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,225 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,226 INFO L272 TraceCheckUtils]: 69: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,226 INFO L290 TraceCheckUtils]: 70: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,226 INFO L290 TraceCheckUtils]: 71: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,226 INFO L290 TraceCheckUtils]: 72: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,227 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,227 INFO L272 TraceCheckUtils]: 74: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,227 INFO L290 TraceCheckUtils]: 75: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,227 INFO L290 TraceCheckUtils]: 76: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,227 INFO L290 TraceCheckUtils]: 77: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,228 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,228 INFO L272 TraceCheckUtils]: 79: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,228 INFO L290 TraceCheckUtils]: 80: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,228 INFO L290 TraceCheckUtils]: 81: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,228 INFO L290 TraceCheckUtils]: 82: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,229 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,229 INFO L290 TraceCheckUtils]: 84: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {7863#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,230 INFO L290 TraceCheckUtils]: 85: Hoare triple {7863#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {7863#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,230 INFO L272 TraceCheckUtils]: 86: Hoare triple {7863#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,230 INFO L290 TraceCheckUtils]: 87: Hoare triple {7604#true} ~cond := #in~cond; {7873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:06,230 INFO L290 TraceCheckUtils]: 88: Hoare triple {7873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:06,231 INFO L290 TraceCheckUtils]: 89: Hoare triple {7877#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:06,231 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {7877#(not (= |__VERIFIER_assert_#in~cond| 0))} {7863#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,231 INFO L272 TraceCheckUtils]: 91: Hoare triple {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,231 INFO L290 TraceCheckUtils]: 92: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,231 INFO L290 TraceCheckUtils]: 93: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,232 INFO L290 TraceCheckUtils]: 94: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,232 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7604#true} {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,232 INFO L272 TraceCheckUtils]: 96: Hoare triple {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,232 INFO L290 TraceCheckUtils]: 97: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,232 INFO L290 TraceCheckUtils]: 98: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,232 INFO L290 TraceCheckUtils]: 99: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,233 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {7604#true} {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,233 INFO L272 TraceCheckUtils]: 101: Hoare triple {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,233 INFO L290 TraceCheckUtils]: 102: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,233 INFO L290 TraceCheckUtils]: 103: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,233 INFO L290 TraceCheckUtils]: 104: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,234 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {7604#true} {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,234 INFO L272 TraceCheckUtils]: 106: Hoare triple {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,234 INFO L290 TraceCheckUtils]: 107: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,234 INFO L290 TraceCheckUtils]: 108: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,234 INFO L290 TraceCheckUtils]: 109: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,235 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {7604#true} {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,235 INFO L290 TraceCheckUtils]: 111: Hoare triple {7884#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~n~0#1 <= main_~a~0#1); {7948#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,236 INFO L272 TraceCheckUtils]: 112: Hoare triple {7948#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:16:06,236 INFO L290 TraceCheckUtils]: 113: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:16:06,236 INFO L290 TraceCheckUtils]: 114: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:16:06,236 INFO L290 TraceCheckUtils]: 115: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:16:06,236 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {7604#true} {7948#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #64#return; {7948#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:06,556 INFO L272 TraceCheckUtils]: 117: Hoare triple {7948#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7967#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:06,557 INFO L290 TraceCheckUtils]: 118: Hoare triple {7967#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7971#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:06,557 INFO L290 TraceCheckUtils]: 119: Hoare triple {7971#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7605#false} is VALID [2022-02-20 17:16:06,557 INFO L290 TraceCheckUtils]: 120: Hoare triple {7605#false} assume !false; {7605#false} is VALID [2022-02-20 17:16:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-02-20 17:16:06,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:16:06,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:06,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776581436] [2022-02-20 17:16:06,833 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:06,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270244292] [2022-02-20 17:16:06,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270244292] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:16:06,833 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:16:06,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 17:16:06,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352825692] [2022-02-20 17:16:06,834 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:16:06,834 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 121 [2022-02-20 17:16:06,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:06,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:16:08,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:08,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:16:08,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:08,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:16:08,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:16:08,866 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:16:13,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:13,155 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2022-02-20 17:16:13,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:16:13,155 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 121 [2022-02-20 17:16:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:16:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-02-20 17:16:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:16:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-02-20 17:16:13,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-02-20 17:16:15,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:15,189 INFO L225 Difference]: With dead ends: 123 [2022-02-20 17:16:15,189 INFO L226 Difference]: Without dead ends: 119 [2022-02-20 17:16:15,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:16:15,190 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:15,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 88 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 17:16:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-20 17:16:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-02-20 17:16:15,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:15,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 119 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:15,253 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 119 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:15,253 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 119 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:15,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:15,259 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2022-02-20 17:16:15,259 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2022-02-20 17:16:15,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:15,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:15,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 119 states. [2022-02-20 17:16:15,262 INFO L87 Difference]: Start difference. First operand has 119 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 119 states. [2022-02-20 17:16:15,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:15,263 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2022-02-20 17:16:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2022-02-20 17:16:15,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:15,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:15,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:15,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2022-02-20 17:16:15,266 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 121 [2022-02-20 17:16:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:15,266 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2022-02-20 17:16:15,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:16:15,266 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2022-02-20 17:16:15,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-20 17:16:15,269 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:15,269 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:15,285 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:16:15,474 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:16:15,475 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1974193296, now seen corresponding path program 3 times [2022-02-20 17:16:15,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:15,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955126256] [2022-02-20 17:16:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:15,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:15,496 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:15,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970701478] [2022-02-20 17:16:15,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:16:15,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:15,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:15,499 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:16:15,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-20 17:16:16,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 17:16:16,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:16:16,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-20 17:16:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:16,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:27,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {8579#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(13, 2);call #Ultimate.allocInit(12, 3); {8579#true} is VALID [2022-02-20 17:16:27,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {8579#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8587#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (or (not (<= |ULTIMATE.start_main_~a~0#1| 50)) (not (<= 0 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 17:16:27,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {8587#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (or (not (<= |ULTIMATE.start_main_~a~0#1| 50)) (not (<= 0 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} assume !(0 == assume_abort_if_not_~cond#1); {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,903 INFO L272 TraceCheckUtils]: 5: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,903 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,903 INFO L272 TraceCheckUtils]: 10: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,904 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,904 INFO L272 TraceCheckUtils]: 15: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,905 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,905 INFO L272 TraceCheckUtils]: 20: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,906 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,906 INFO L272 TraceCheckUtils]: 25: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,907 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,908 INFO L272 TraceCheckUtils]: 32: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,908 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,908 INFO L272 TraceCheckUtils]: 37: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,909 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,909 INFO L272 TraceCheckUtils]: 42: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,910 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,910 INFO L272 TraceCheckUtils]: 47: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,910 INFO L290 TraceCheckUtils]: 49: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,910 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,911 INFO L272 TraceCheckUtils]: 52: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {8579#true} ~cond := #in~cond; {8745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:27,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {8745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:27,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:27,912 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,914 INFO L290 TraceCheckUtils]: 57: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,915 INFO L290 TraceCheckUtils]: 58: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,915 INFO L272 TraceCheckUtils]: 59: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,915 INFO L290 TraceCheckUtils]: 60: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,915 INFO L290 TraceCheckUtils]: 61: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,915 INFO L290 TraceCheckUtils]: 62: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,916 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8579#true} {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,916 INFO L272 TraceCheckUtils]: 64: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,916 INFO L290 TraceCheckUtils]: 65: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,916 INFO L290 TraceCheckUtils]: 66: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,916 INFO L290 TraceCheckUtils]: 67: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,920 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8579#true} {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,920 INFO L272 TraceCheckUtils]: 69: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,920 INFO L290 TraceCheckUtils]: 70: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,920 INFO L290 TraceCheckUtils]: 71: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,920 INFO L290 TraceCheckUtils]: 72: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,925 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8579#true} {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,925 INFO L272 TraceCheckUtils]: 74: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,925 INFO L290 TraceCheckUtils]: 75: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,925 INFO L290 TraceCheckUtils]: 76: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,925 INFO L290 TraceCheckUtils]: 77: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,925 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {8579#true} {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,926 INFO L272 TraceCheckUtils]: 79: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,926 INFO L290 TraceCheckUtils]: 80: Hoare triple {8579#true} ~cond := #in~cond; {8745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:27,926 INFO L290 TraceCheckUtils]: 81: Hoare triple {8745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:27,926 INFO L290 TraceCheckUtils]: 82: Hoare triple {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:27,927 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {8841#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,929 INFO L290 TraceCheckUtils]: 85: Hoare triple {8841#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {8841#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,929 INFO L272 TraceCheckUtils]: 86: Hoare triple {8841#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,930 INFO L290 TraceCheckUtils]: 87: Hoare triple {8579#true} ~cond := #in~cond; {8745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:27,930 INFO L290 TraceCheckUtils]: 88: Hoare triple {8745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:27,930 INFO L290 TraceCheckUtils]: 89: Hoare triple {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:27,931 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} {8841#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,931 INFO L272 TraceCheckUtils]: 91: Hoare triple {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,931 INFO L290 TraceCheckUtils]: 92: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,931 INFO L290 TraceCheckUtils]: 93: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,931 INFO L290 TraceCheckUtils]: 94: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,931 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8579#true} {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,932 INFO L272 TraceCheckUtils]: 96: Hoare triple {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,932 INFO L290 TraceCheckUtils]: 97: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,932 INFO L290 TraceCheckUtils]: 98: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,932 INFO L290 TraceCheckUtils]: 99: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,932 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {8579#true} {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,932 INFO L272 TraceCheckUtils]: 101: Hoare triple {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,933 INFO L290 TraceCheckUtils]: 102: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,933 INFO L290 TraceCheckUtils]: 103: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,933 INFO L290 TraceCheckUtils]: 104: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,933 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {8579#true} {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,933 INFO L272 TraceCheckUtils]: 106: Hoare triple {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,933 INFO L290 TraceCheckUtils]: 107: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,934 INFO L290 TraceCheckUtils]: 108: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,934 INFO L290 TraceCheckUtils]: 109: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,934 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {8579#true} {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,935 INFO L290 TraceCheckUtils]: 111: Hoare triple {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~n~0#1 <= main_~a~0#1); {8924#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,935 INFO L272 TraceCheckUtils]: 112: Hoare triple {8924#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,935 INFO L290 TraceCheckUtils]: 113: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,936 INFO L290 TraceCheckUtils]: 114: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,936 INFO L290 TraceCheckUtils]: 115: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,936 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {8579#true} {8924#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #64#return; {8924#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:27,936 INFO L272 TraceCheckUtils]: 117: Hoare triple {8924#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:16:27,936 INFO L290 TraceCheckUtils]: 118: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:16:27,936 INFO L290 TraceCheckUtils]: 119: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:16:27,937 INFO L290 TraceCheckUtils]: 120: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:16:27,937 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {8579#true} {8924#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #66#return; {8924#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:16:29,939 WARN L272 TraceCheckUtils]: 122: Hoare triple {8924#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~a~0#1 * main_~z~0#1 - 6 * main_~a~0#1 - 2 * main_~y~0#1 + 2 * main_~z~0#1 - 10 then 1 else 0)); {8958#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-02-20 17:16:29,940 INFO L290 TraceCheckUtils]: 123: Hoare triple {8958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:29,940 INFO L290 TraceCheckUtils]: 124: Hoare triple {8962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8580#false} is VALID [2022-02-20 17:16:29,940 INFO L290 TraceCheckUtils]: 125: Hoare triple {8580#false} assume !false; {8580#false} is VALID [2022-02-20 17:16:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 181 proven. 69 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-02-20 17:16:29,941 INFO L328 TraceCheckSpWp]: Computing backward predicates...