/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:12:04,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:12:04,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:12:04,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:12:04,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:12:04,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:12:04,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:12:04,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:12:04,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:12:04,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:12:04,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:12:04,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:12:04,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:12:04,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:12:04,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:12:04,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:12:04,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:12:04,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:12:04,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:12:04,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:12:04,211 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:12:04,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:12:04,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:12:04,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:12:04,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:12:04,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:12:04,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:12:04,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:12:04,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:12:04,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:12:04,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:12:04,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:12:04,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:12:04,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:12:04,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:12:04,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:12:04,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:12:04,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:12:04,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:12:04,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:12:04,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:12:04,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:12:04,234 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:12:04,252 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:12:04,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:12:04,253 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:12:04,253 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:12:04,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:12:04,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:12:04,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:12:04,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:12:04,254 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:12:04,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:12:04,254 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:12:04,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:12:04,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:12:04,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:12:04,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:12:04,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:12:04,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:12:04,255 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:12:04,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:12:04,255 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:12:04,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:12:04,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:12:04,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:12:04,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:12:04,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:12:04,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:12:04,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:12:04,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:12:04,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:12:04,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:12:04,257 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:12:04,257 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:12:04,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:12:04,257 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:12:04,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:12:04,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:12:04,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:12:04,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:12:04,462 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:12:04,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2022-04-27 12:12:04,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2af7ca56/eac7daba892749b897231fb0f209b2bc/FLAG44e01c2ef [2022-04-27 12:12:04,827 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:12:04,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2022-04-27 12:12:04,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2af7ca56/eac7daba892749b897231fb0f209b2bc/FLAG44e01c2ef [2022-04-27 12:12:05,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2af7ca56/eac7daba892749b897231fb0f209b2bc [2022-04-27 12:12:05,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:12:05,276 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:12:05,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:12:05,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:12:05,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:12:05,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:12:05" (1/1) ... [2022-04-27 12:12:05,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e79f717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:05, skipping insertion in model container [2022-04-27 12:12:05,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:12:05" (1/1) ... [2022-04-27 12:12:05,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:12:05,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:12:05,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c[588,601] [2022-04-27 12:12:05,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:12:05,525 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:12:05,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c[588,601] [2022-04-27 12:12:05,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:12:05,555 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:12:05,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:05 WrapperNode [2022-04-27 12:12:05,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:12:05,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:12:05,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:12:05,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:12:05,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:05" (1/1) ... [2022-04-27 12:12:05,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:05" (1/1) ... [2022-04-27 12:12:05,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:05" (1/1) ... [2022-04-27 12:12:05,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:05" (1/1) ... [2022-04-27 12:12:05,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:05" (1/1) ... [2022-04-27 12:12:05,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:05" (1/1) ... [2022-04-27 12:12:05,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:05" (1/1) ... [2022-04-27 12:12:05,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:12:05,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:12:05,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:12:05,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:12:05,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:05" (1/1) ... [2022-04-27 12:12:05,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:12:05,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:05,610 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-04-27 12:12:05,636 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-04-27 12:12:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:12:05,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:12:05,657 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:12:05,657 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:12:05,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:12:05,659 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:12:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:12:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:12:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:12:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:12:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-27 12:12:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:12:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:12:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:12:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:12:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:12:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:12:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:12:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:12:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:12:05,723 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:12:05,724 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:12:05,872 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:12:05,878 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:12:05,878 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 12:12:05,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:12:05 BoogieIcfgContainer [2022-04-27 12:12:05,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:12:05,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:12:05,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:12:05,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:12:05,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:12:05" (1/3) ... [2022-04-27 12:12:05,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11efc337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:12:05, skipping insertion in model container [2022-04-27 12:12:05,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:05" (2/3) ... [2022-04-27 12:12:05,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11efc337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:12:05, skipping insertion in model container [2022-04-27 12:12:05,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:12:05" (3/3) ... [2022-04-27 12:12:05,893 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound5.c [2022-04-27 12:12:05,922 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:12:05,922 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:12:06,007 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:12:06,013 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3088a524, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ec3817a [2022-04-27 12:12:06,013 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:12:06,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:12:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 12:12:06,059 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:06,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:06,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:06,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:06,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-27 12:12:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:06,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228266226] [2022-04-27 12:12:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:06,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:06,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:12:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:06,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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);~counter~0 := 0; {34#true} is VALID [2022-04-27 12:12:06,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 12:12:06,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-27 12:12:06,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:12:06,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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);~counter~0 := 0; {34#true} is VALID [2022-04-27 12:12:06,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 12:12:06,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-27 12:12:06,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-27 12:12:06,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-27 12:12:06,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-27 12:12:06,375 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-27 12:12:06,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 12:12:06,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 12:12:06,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 12:12:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:12:06,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:06,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228266226] [2022-04-27 12:12:06,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228266226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:12:06,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:12:06,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:12:06,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143514527] [2022-04-27 12:12:06,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:12:06,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 12:12:06,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:06,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:06,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:06,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:12:06,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:06,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:12:06,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:12:06,458 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:06,755 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-27 12:12:06,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:12:06,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 12:12:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 12:12:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 12:12:06,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-27 12:12:07,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:07,063 INFO L225 Difference]: With dead ends: 57 [2022-04-27 12:12:07,063 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 12:12:07,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:12:07,073 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:07,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 12:12:07,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 12:12:07,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:07,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:07,116 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:07,116 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:07,120 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-27 12:12:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-27 12:12:07,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:07,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:07,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-27 12:12:07,122 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-27 12:12:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:07,137 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-27 12:12:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-27 12:12:07,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:07,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:07,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:07,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-27 12:12:07,142 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-27 12:12:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:07,142 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-27 12:12:07,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-27 12:12:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 12:12:07,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:07,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:07,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:12:07,144 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:07,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-27 12:12:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:07,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883233939] [2022-04-27 12:12:07,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:12:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:07,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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);~counter~0 := 0; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:07,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:07,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:07,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:12:07,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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);~counter~0 := 0; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:07,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:07,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:07,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#(= ~counter~0 0)} call #t~ret6 := main(); {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:07,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:07,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {233#(= |main_#t~post5| 0)} is VALID [2022-04-27 12:12:07,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {228#false} is VALID [2022-04-27 12:12:07,259 INFO L272 TraceCheckUtils]: 8: Hoare triple {228#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {228#false} is VALID [2022-04-27 12:12:07,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-27 12:12:07,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-27 12:12:07,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-27 12:12:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:12:07,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:07,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883233939] [2022-04-27 12:12:07,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883233939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:12:07,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:12:07,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:12:07,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086109417] [2022-04-27 12:12:07,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:12:07,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:12:07,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:07,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:07,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:07,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:12:07,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:07,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:12:07,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:12:07,286 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:07,615 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-27 12:12:07,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:12:07,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:12:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-27 12:12:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-27 12:12:07,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-27 12:12:07,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:07,678 INFO L225 Difference]: With dead ends: 40 [2022-04-27 12:12:07,679 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 12:12:07,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-04-27 12:12:07,680 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:07,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 12:12:07,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 12:12:07,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:07,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:07,691 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:07,691 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:07,702 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-27 12:12:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 12:12:07,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:07,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:07,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-27 12:12:07,704 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-27 12:12:07,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:07,707 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-27 12:12:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 12:12:07,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:07,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:07,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:07,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-27 12:12:07,710 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-27 12:12:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:07,710 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-27 12:12:07,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 12:12:07,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 12:12:07,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:07,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:07,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:12:07,715 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:07,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-27 12:12:07,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:07,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480525163] [2022-04-27 12:12:07,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:07,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:12:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:07,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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);~counter~0 := 0; {406#true} is VALID [2022-04-27 12:12:07,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-27 12:12:07,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-27 12:12:07,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:12:07,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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);~counter~0 := 0; {406#true} is VALID [2022-04-27 12:12:07,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-27 12:12:07,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-27 12:12:07,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret6 := main(); {406#true} is VALID [2022-04-27 12:12:07,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 12:12:07,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 12:12:07,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 5);havoc #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 12:12:07,881 INFO L272 TraceCheckUtils]: 8: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:07,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {413#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:12:07,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {407#false} is VALID [2022-04-27 12:12:07,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} assume !false; {407#false} is VALID [2022-04-27 12:12:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:12:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:07,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480525163] [2022-04-27 12:12:07,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480525163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:12:07,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:12:07,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:12:07,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108845918] [2022-04-27 12:12:07,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:12:07,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:12:07,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:07,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:07,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:07,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:12:07,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:07,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:12:07,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:12:07,923 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:08,698 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-27 12:12:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:12:08,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:12:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 12:12:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 12:12:08,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-27 12:12:08,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:08,770 INFO L225 Difference]: With dead ends: 34 [2022-04-27 12:12:08,770 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:12:08,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:12:08,773 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:08,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:12:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:12:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:12:08,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:08,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:08,785 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:08,786 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:08,806 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-27 12:12:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 12:12:08,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:08,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:08,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-27 12:12:08,809 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-27 12:12:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:08,815 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-27 12:12:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 12:12:08,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:08,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:08,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:08,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 12:12:08,818 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-27 12:12:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:08,819 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 12:12:08,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 12:12:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:12:08,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:08,823 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:08,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 12:12:08,824 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:08,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:08,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-27 12:12:08,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:08,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448311954] [2022-04-27 12:12:08,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:08,876 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:08,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887759838] [2022-04-27 12:12:08,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:08,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:08,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:08,895 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-04-27 12:12:08,914 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-04-27 12:12:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:08,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:12:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:08,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:09,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-27 12:12:09,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#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);~counter~0 := 0; {593#true} is VALID [2022-04-27 12:12:09,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-27 12:12:09,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #81#return; {593#true} is VALID [2022-04-27 12:12:09,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret6 := main(); {593#true} is VALID [2022-04-27 12:12:09,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:09,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:09,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:09,182 INFO L272 TraceCheckUtils]: 8: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {593#true} is VALID [2022-04-27 12:12:09,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#true} ~cond := #in~cond; {593#true} is VALID [2022-04-27 12:12:09,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#true} assume !(0 == ~cond); {593#true} is VALID [2022-04-27 12:12:09,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-27 12:12:09,184 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {593#true} {613#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:09,185 INFO L272 TraceCheckUtils]: 13: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:09,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:09,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {594#false} is VALID [2022-04-27 12:12:09,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-27 12:12:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:12:09,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:12:09,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:09,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448311954] [2022-04-27 12:12:09,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:09,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887759838] [2022-04-27 12:12:09,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887759838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:12:09,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:12:09,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:12:09,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211139412] [2022-04-27 12:12:09,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:12:09,189 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 12:12:09,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:09,189 INFO L86 InductivityCheck]: Starting inductivity 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:12:09,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:09,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:12:09,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:09,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:12:09,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:12:09,232 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:12:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:09,800 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-27 12:12:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:12:09,800 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 12:12:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:09,801 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:12:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:12:09,803 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:12:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:12:09,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:12:09,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:09,901 INFO L225 Difference]: With dead ends: 50 [2022-04-27 12:12:09,901 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 12:12:09,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-04-27 12:12:09,907 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:09,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 139 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:09,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 12:12:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-27 12:12:09,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:09,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:12:09,960 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:12:09,960 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:12:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:09,970 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-27 12:12:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-27 12:12:09,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:09,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:09,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-27 12:12:09,972 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-27 12:12:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:09,992 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-27 12:12:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-27 12:12:09,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:09,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:09,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:09,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:12:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-27 12:12:09,995 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-27 12:12:09,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:09,996 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-27 12:12:09,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:12:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-27 12:12:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 12:12:09,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:09,996 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:10,028 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-04-27 12:12:10,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:10,213 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:10,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:10,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-27 12:12:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:10,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805031440] [2022-04-27 12:12:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:10,228 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:10,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478326809] [2022-04-27 12:12:10,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:10,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:10,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:10,240 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-04-27 12:12:10,242 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-04-27 12:12:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:10,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:12:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:10,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:10,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2022-04-27 12:12:10,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {887#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);~counter~0 := 0; {887#true} is VALID [2022-04-27 12:12:10,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-27 12:12:10,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #81#return; {887#true} is VALID [2022-04-27 12:12:10,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret6 := main(); {887#true} is VALID [2022-04-27 12:12:10,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {887#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:12:10,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:12:10,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:12:10,554 INFO L272 TraceCheckUtils]: 8: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {887#true} is VALID [2022-04-27 12:12:10,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-27 12:12:10,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-27 12:12:10,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-27 12:12:10,558 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:12:10,558 INFO L272 TraceCheckUtils]: 13: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {887#true} is VALID [2022-04-27 12:12:10,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-27 12:12:10,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-27 12:12:10,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-27 12:12:10,559 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:12:10,560 INFO L272 TraceCheckUtils]: 18: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {947#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:10,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {947#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:10,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {888#false} is VALID [2022-04-27 12:12:10,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {888#false} assume !false; {888#false} is VALID [2022-04-27 12:12:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:12:10,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:12:10,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:10,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805031440] [2022-04-27 12:12:10,563 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:10,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478326809] [2022-04-27 12:12:10,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478326809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:12:10,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:12:10,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:12:10,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770822395] [2022-04-27 12:12:10,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:12:10,564 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 12:12:10,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:10,565 INFO L86 InductivityCheck]: Starting inductivity 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:12:10,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:10,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:12:10,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:10,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:12:10,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:12:10,582 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:12:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:10,840 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-27 12:12:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:12:10,840 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 12:12:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:10,841 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:12:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:12:10,844 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:12:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:12:10,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:12:10,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:10,918 INFO L225 Difference]: With dead ends: 54 [2022-04-27 12:12:10,918 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 12:12:10,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-04-27 12:12:10,919 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:10,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:10,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 12:12:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-27 12:12:10,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:10,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:12:10,938 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:12:10,940 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:12:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:10,943 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 12:12:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 12:12:10,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:10,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:10,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-27 12:12:10,944 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-27 12:12:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:10,947 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 12:12:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 12:12:10,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:10,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:10,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:10,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:12:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-27 12:12:10,953 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-27 12:12:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:10,954 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-27 12:12:10,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:12:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-27 12:12:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 12:12:10,955 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:10,955 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:10,980 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-04-27 12:12:11,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:11,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:11,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-27 12:12:11,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:11,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024463560] [2022-04-27 12:12:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:11,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:11,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:11,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1012773251] [2022-04-27 12:12:11,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:11,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:11,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:11,192 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-04-27 12:12:11,201 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-04-27 12:12:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:11,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:12:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:11,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:11,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1225#true} is VALID [2022-04-27 12:12:11,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#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);~counter~0 := 0; {1225#true} is VALID [2022-04-27 12:12:11,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-27 12:12:11,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #81#return; {1225#true} is VALID [2022-04-27 12:12:11,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret6 := main(); {1225#true} is VALID [2022-04-27 12:12:11,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:11,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:11,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:11,433 INFO L272 TraceCheckUtils]: 8: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-27 12:12:11,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-27 12:12:11,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-27 12:12:11,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-27 12:12:11,434 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:11,434 INFO L272 TraceCheckUtils]: 13: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1225#true} is VALID [2022-04-27 12:12:11,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-27 12:12:11,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-27 12:12:11,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-27 12:12:11,435 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:11,435 INFO L272 TraceCheckUtils]: 18: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-27 12:12:11,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-27 12:12:11,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-27 12:12:11,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-27 12:12:11,436 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:11,437 INFO L272 TraceCheckUtils]: 23: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:11,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:11,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {1304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1226#false} is VALID [2022-04-27 12:12:11,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-27 12:12:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 12:12:11,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:12:11,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:11,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024463560] [2022-04-27 12:12:11,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:11,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012773251] [2022-04-27 12:12:11,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012773251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:12:11,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:12:11,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:12:11,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173093871] [2022-04-27 12:12:11,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:12:11,440 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 12:12:11,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:11,440 INFO L86 InductivityCheck]: Starting inductivity 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:12:11,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:11,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:12:11,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:11,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:12:11,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:12:11,459 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:12:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:12,024 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-27 12:12:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:12:12,024 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 12:12:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:12,024 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:12:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:12:12,027 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:12:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:12:12,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:12:12,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:12,131 INFO L225 Difference]: With dead ends: 62 [2022-04-27 12:12:12,131 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 12:12:12,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-04-27 12:12:12,132 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:12,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 12:12:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-27 12:12:12,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:12,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:12:12,146 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:12:12,148 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:12:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:12,151 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-27 12:12:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 12:12:12,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:12,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:12,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-27 12:12:12,152 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-27 12:12:12,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:12,154 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-27 12:12:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 12:12:12,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:12,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:12,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:12,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:12:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-27 12:12:12,174 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-27 12:12:12,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:12,175 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-27 12:12:12,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:12:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 12:12:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 12:12:12,176 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:12,176 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:12,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:12:12,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:12,390 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:12,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-27 12:12:12,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:12,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188843374] [2022-04-27 12:12:12,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:12,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:12,403 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:12,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328054259] [2022-04-27 12:12:12,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:12,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:12,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:12,424 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-04-27 12:12:12,498 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-04-27 12:12:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:12,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:12:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:12,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:12,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-27 12:12:12,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#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);~counter~0 := 0; {1593#(<= ~counter~0 0)} is VALID [2022-04-27 12:12:12,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#(<= ~counter~0 0)} assume true; {1593#(<= ~counter~0 0)} is VALID [2022-04-27 12:12:12,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1593#(<= ~counter~0 0)} {1585#true} #81#return; {1593#(<= ~counter~0 0)} is VALID [2022-04-27 12:12:12,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {1593#(<= ~counter~0 0)} call #t~ret6 := main(); {1593#(<= ~counter~0 0)} is VALID [2022-04-27 12:12:12,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {1593#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1593#(<= ~counter~0 0)} is VALID [2022-04-27 12:12:12,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {1593#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {1609#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,763 INFO L272 TraceCheckUtils]: 8: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,765 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #59#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,766 INFO L272 TraceCheckUtils]: 13: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,767 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #61#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,768 INFO L272 TraceCheckUtils]: 18: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,770 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #63#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,770 INFO L272 TraceCheckUtils]: 23: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,772 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #65#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,773 INFO L272 TraceCheckUtils]: 28: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,774 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #67#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {1609#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:12,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {1609#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1694#(<= |main_#t~post5| 1)} is VALID [2022-04-27 12:12:12,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {1586#false} is VALID [2022-04-27 12:12:12,776 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1586#false} is VALID [2022-04-27 12:12:12,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-27 12:12:12,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {1586#false} assume !(0 == ~cond); {1586#false} is VALID [2022-04-27 12:12:12,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {1586#false} assume true; {1586#false} is VALID [2022-04-27 12:12:12,776 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1586#false} {1586#false} #69#return; {1586#false} is VALID [2022-04-27 12:12:12,777 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-27 12:12:12,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-27 12:12:12,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-27 12:12:12,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-27 12:12:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-27 12:12:12,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:13,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-27 12:12:13,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-27 12:12:13,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-27 12:12:13,042 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-27 12:12:13,042 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1585#true} {1586#false} #69#return; {1586#false} is VALID [2022-04-27 12:12:13,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-27 12:12:13,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-27 12:12:13,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-27 12:12:13,045 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-27 12:12:13,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {1752#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {1586#false} is VALID [2022-04-27 12:12:13,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {1756#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1752#(< |main_#t~post5| 5)} is VALID [2022-04-27 12:12:13,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {1756#(< ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1756#(< ~counter~0 5)} is VALID [2022-04-27 12:12:13,047 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #67#return; {1756#(< ~counter~0 5)} is VALID [2022-04-27 12:12:13,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-27 12:12:13,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-27 12:12:13,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-27 12:12:13,060 INFO L272 TraceCheckUtils]: 28: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1585#true} is VALID [2022-04-27 12:12:13,061 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #65#return; {1756#(< ~counter~0 5)} is VALID [2022-04-27 12:12:13,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-27 12:12:13,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-27 12:12:13,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-27 12:12:13,061 INFO L272 TraceCheckUtils]: 23: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1585#true} is VALID [2022-04-27 12:12:13,062 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #63#return; {1756#(< ~counter~0 5)} is VALID [2022-04-27 12:12:13,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-27 12:12:13,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-27 12:12:13,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-27 12:12:13,063 INFO L272 TraceCheckUtils]: 18: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-27 12:12:13,065 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #61#return; {1756#(< ~counter~0 5)} is VALID [2022-04-27 12:12:13,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-27 12:12:13,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-27 12:12:13,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-27 12:12:13,066 INFO L272 TraceCheckUtils]: 13: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1585#true} is VALID [2022-04-27 12:12:13,069 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #59#return; {1756#(< ~counter~0 5)} is VALID [2022-04-27 12:12:13,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-27 12:12:13,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-27 12:12:13,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-27 12:12:13,069 INFO L272 TraceCheckUtils]: 8: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-27 12:12:13,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {1756#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {1756#(< ~counter~0 5)} is VALID [2022-04-27 12:12:13,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1756#(< ~counter~0 5)} is VALID [2022-04-27 12:12:13,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#(< ~counter~0 4)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1841#(< ~counter~0 4)} is VALID [2022-04-27 12:12:13,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#(< ~counter~0 4)} call #t~ret6 := main(); {1841#(< ~counter~0 4)} is VALID [2022-04-27 12:12:13,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#(< ~counter~0 4)} {1585#true} #81#return; {1841#(< ~counter~0 4)} is VALID [2022-04-27 12:12:13,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#(< ~counter~0 4)} assume true; {1841#(< ~counter~0 4)} is VALID [2022-04-27 12:12:13,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#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);~counter~0 := 0; {1841#(< ~counter~0 4)} is VALID [2022-04-27 12:12:13,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-27 12:12:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 12:12:13,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:13,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188843374] [2022-04-27 12:12:13,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:13,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328054259] [2022-04-27 12:12:13,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328054259] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:12:13,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:12:13,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:12:13,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695139128] [2022-04-27 12:12:13,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:13,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-27 12:12:13,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:13,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 12:12:13,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:13,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:12:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:12:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:12:13,153 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 12:12:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:13,836 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-04-27 12:12:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:12:13,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-27 12:12:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 12:12:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-27 12:12:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 12:12:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-27 12:12:13,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 134 transitions. [2022-04-27 12:12:13,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:13,984 INFO L225 Difference]: With dead ends: 120 [2022-04-27 12:12:13,984 INFO L226 Difference]: Without dead ends: 104 [2022-04-27 12:12:13,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:12:13,985 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 65 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:13,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 194 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-27 12:12:14,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-27 12:12:14,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:14,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:14,035 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:14,035 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:14,042 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-27 12:12:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-27 12:12:14,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:14,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:14,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 104 states. [2022-04-27 12:12:14,043 INFO L87 Difference]: Start difference. First operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 104 states. [2022-04-27 12:12:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:14,063 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-27 12:12:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-27 12:12:14,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:14,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:14,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:14,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-04-27 12:12:14,070 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-04-27 12:12:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:14,072 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-04-27 12:12:14,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 12:12:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-04-27 12:12:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 12:12:14,075 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:14,075 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:14,101 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-04-27 12:12:14,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:14,297 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:14,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:14,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-27 12:12:14,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:14,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515978267] [2022-04-27 12:12:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:14,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:14,310 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:14,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [474541650] [2022-04-27 12:12:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:14,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:14,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:14,332 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-04-27 12:12:14,393 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-04-27 12:12:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:14,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:12:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:14,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:14,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-27 12:12:14,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#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);~counter~0 := 0; {2418#true} is VALID [2022-04-27 12:12:14,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:14,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-27 12:12:14,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-27 12:12:14,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:14,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:14,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:14,796 INFO L272 TraceCheckUtils]: 8: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:14,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:14,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:14,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:14,797 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:14,797 INFO L272 TraceCheckUtils]: 13: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:14,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:14,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:14,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:14,798 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:14,798 INFO L272 TraceCheckUtils]: 18: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:14,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:14,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:14,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:14,815 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:14,815 INFO L272 TraceCheckUtils]: 23: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:14,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:14,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:14,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:14,817 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:14,817 INFO L272 TraceCheckUtils]: 28: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:14,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:14,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:14,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:14,818 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:14,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:14,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:14,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 5);havoc #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:14,820 INFO L272 TraceCheckUtils]: 36: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:14,820 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:14,820 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:14,820 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:14,821 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2418#true} {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #59#return; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:14,821 INFO L272 TraceCheckUtils]: 41: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:14,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:14,822 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-27 12:12:14,822 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-27 12:12:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 12:12:14,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:15,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-27 12:12:15,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-27 12:12:15,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:15,207 INFO L272 TraceCheckUtils]: 41: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:15,208 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2418#true} {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:12:15,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:15,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:15,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:15,209 INFO L272 TraceCheckUtils]: 36: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:15,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 5);havoc #t~post5; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:12:15,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:12:15,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:12:15,235 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #67#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:15,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:15,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:15,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:15,236 INFO L272 TraceCheckUtils]: 28: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:15,237 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #65#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:15,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:15,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:15,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:15,237 INFO L272 TraceCheckUtils]: 23: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:15,238 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #63#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:15,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:15,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:15,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:15,239 INFO L272 TraceCheckUtils]: 18: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:15,239 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #61#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:15,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:15,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:15,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:15,240 INFO L272 TraceCheckUtils]: 13: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:15,240 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #59#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:15,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:15,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:15,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:15,241 INFO L272 TraceCheckUtils]: 8: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:15,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 5);havoc #t~post5; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:15,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:15,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:15,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-27 12:12:15,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-27 12:12:15,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:15,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#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);~counter~0 := 0; {2418#true} is VALID [2022-04-27 12:12:15,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-27 12:12:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 12:12:15,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:15,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515978267] [2022-04-27 12:12:15,246 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:15,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474541650] [2022-04-27 12:12:15,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474541650] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:12:15,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:12:15,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:12:15,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358989279] [2022-04-27 12:12:15,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:15,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-27 12:12:15,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:15,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:12:15,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:15,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:12:15,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:15,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:12:15,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:12:15,310 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:12:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:16,332 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-27 12:12:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:12:16,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-27 12:12:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:12:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 12:12:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:12:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 12:12:16,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-27 12:12:16,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:16,521 INFO L225 Difference]: With dead ends: 118 [2022-04-27 12:12:16,522 INFO L226 Difference]: Without dead ends: 116 [2022-04-27 12:12:16,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:12:16,522 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:16,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 12:12:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-27 12:12:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-27 12:12:16,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:16,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:16,633 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:16,634 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:16,639 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-27 12:12:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-27 12:12:16,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:16,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:16,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 116 states. [2022-04-27 12:12:16,643 INFO L87 Difference]: Start difference. First operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 116 states. [2022-04-27 12:12:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:16,647 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-27 12:12:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-27 12:12:16,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:16,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:16,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:16,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-04-27 12:12:16,653 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-04-27 12:12:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:16,653 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-04-27 12:12:16,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:12:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-27 12:12:16,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 12:12:16,655 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:16,655 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:16,682 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-04-27 12:12:16,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:16,879 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:16,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 2 times [2022-04-27 12:12:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:16,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190114776] [2022-04-27 12:12:16,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:16,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:16,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1792069900] [2022-04-27 12:12:16,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:12:16,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:16,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:16,908 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-04-27 12:12:16,910 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-04-27 12:12:16,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:12:16,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:12:16,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:12:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:17,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:17,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-27 12:12:17,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#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);~counter~0 := 0; {3289#true} is VALID [2022-04-27 12:12:17,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-27 12:12:17,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-27 12:12:17,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:17,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:17,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:17,364 INFO L272 TraceCheckUtils]: 8: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,365 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #59#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:17,365 INFO L272 TraceCheckUtils]: 13: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,366 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #61#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:17,366 INFO L272 TraceCheckUtils]: 18: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,367 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #63#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:17,367 INFO L272 TraceCheckUtils]: 23: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,369 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #65#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:17,369 INFO L272 TraceCheckUtils]: 28: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,370 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #67#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:17,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-27 12:12:17,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-27 12:12:17,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-27 12:12:17,372 INFO L272 TraceCheckUtils]: 36: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,373 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3289#true} {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #59#return; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-27 12:12:17,373 INFO L272 TraceCheckUtils]: 41: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,374 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3289#true} {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #61#return; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-27 12:12:17,375 INFO L272 TraceCheckUtils]: 46: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:17,375 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:17,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-27 12:12:17,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-27 12:12:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 12:12:17,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:17,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-27 12:12:17,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-27 12:12:17,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:17,642 INFO L272 TraceCheckUtils]: 46: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:17,642 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3289#true} {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #61#return; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:17,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,643 INFO L272 TraceCheckUtils]: 41: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,643 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3289#true} {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #59#return; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:17,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,644 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,644 INFO L272 TraceCheckUtils]: 36: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !!(#t~post5 < 5);havoc #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:17,644 INFO L290 TraceCheckUtils]: 34: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:17,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:17,663 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #67#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:17,664 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,664 INFO L272 TraceCheckUtils]: 28: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,665 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #65#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:17,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,665 INFO L272 TraceCheckUtils]: 23: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,665 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #63#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:17,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,666 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,667 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #61#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:17,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,667 INFO L272 TraceCheckUtils]: 13: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,668 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #59#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:17,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:17,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:17,668 INFO L272 TraceCheckUtils]: 8: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:17,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:17,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:17,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:17,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-27 12:12:17,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-27 12:12:17,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:17,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#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);~counter~0 := 0; {3289#true} is VALID [2022-04-27 12:12:17,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-27 12:12:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 12:12:17,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:17,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190114776] [2022-04-27 12:12:17,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:17,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792069900] [2022-04-27 12:12:17,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792069900] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:12:17,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:12:17,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:12:17,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113425119] [2022-04-27 12:12:17,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:17,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-27 12:12:17,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:17,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 12:12:17,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:17,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:12:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:17,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:12:17,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:12:17,751 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 12:12:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:18,526 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-04-27 12:12:18,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:12:18,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-27 12:12:18,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 12:12:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-27 12:12:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 12:12:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-27 12:12:18,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-27 12:12:18,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:18,637 INFO L225 Difference]: With dead ends: 122 [2022-04-27 12:12:18,637 INFO L226 Difference]: Without dead ends: 120 [2022-04-27 12:12:18,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 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-04-27 12:12:18,638 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:18,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 232 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:12:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-27 12:12:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-27 12:12:18,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:18,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:18,712 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:18,712 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:18,716 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-27 12:12:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-27 12:12:18,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:18,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:18,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 120 states. [2022-04-27 12:12:18,748 INFO L87 Difference]: Start difference. First operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 120 states. [2022-04-27 12:12:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:18,752 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-27 12:12:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-27 12:12:18,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:18,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:18,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:18,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-27 12:12:18,769 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-04-27 12:12:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:18,769 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-27 12:12:18,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 12:12:18,769 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-27 12:12:18,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 12:12:18,770 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:18,770 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:18,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:12:18,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:18,984 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:18,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:18,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1909341660, now seen corresponding path program 3 times [2022-04-27 12:12:18,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:18,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629819339] [2022-04-27 12:12:18,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:18,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:18,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:18,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571542929] [2022-04-27 12:12:18,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:12:18,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:18,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:19,016 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-04-27 12:12:19,035 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-04-27 12:12:19,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 12:12:19,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:12:19,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 12:12:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:19,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:19,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-27 12:12:19,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {4204#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);~counter~0 := 0; {4204#true} is VALID [2022-04-27 12:12:19,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:19,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-27 12:12:19,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-27 12:12:19,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {4204#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:19,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:19,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:19,549 INFO L272 TraceCheckUtils]: 8: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:19,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:19,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:19,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:19,549 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:19,550 INFO L272 TraceCheckUtils]: 13: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:19,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:19,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:19,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:19,550 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:19,550 INFO L272 TraceCheckUtils]: 18: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:19,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:19,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:19,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:19,551 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:19,555 INFO L272 TraceCheckUtils]: 23: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:19,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:19,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:19,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:19,556 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:19,556 INFO L272 TraceCheckUtils]: 28: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:19,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:19,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:19,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:19,557 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:19,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-27 12:12:19,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-27 12:12:19,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} assume !!(#t~post5 < 5);havoc #t~post5; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-27 12:12:19,559 INFO L272 TraceCheckUtils]: 36: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:19,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:19,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:19,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:19,559 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #59#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-27 12:12:19,560 INFO L272 TraceCheckUtils]: 41: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:19,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:19,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:19,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:19,560 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #61#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-27 12:12:19,560 INFO L272 TraceCheckUtils]: 46: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:19,560 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:19,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:19,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:19,563 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #63#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-27 12:12:19,563 INFO L272 TraceCheckUtils]: 51: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:19,564 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:19,564 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-27 12:12:19,564 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-27 12:12:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 12:12:19,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:20,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-27 12:12:20,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-27 12:12:20,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:20,194 INFO L272 TraceCheckUtils]: 51: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:20,194 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #63#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:12:20,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:20,195 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:20,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:20,195 INFO L272 TraceCheckUtils]: 46: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:20,195 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #61#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:12:20,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:20,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:20,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:20,196 INFO L272 TraceCheckUtils]: 41: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:20,196 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #59#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:12:20,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:20,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:20,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:20,197 INFO L272 TraceCheckUtils]: 36: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:20,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:12:20,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:12:20,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:12:20,202 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #67#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:20,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:20,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:20,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:20,203 INFO L272 TraceCheckUtils]: 28: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:20,203 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #65#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:20,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:20,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:20,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:20,204 INFO L272 TraceCheckUtils]: 23: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:20,204 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #63#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:20,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:20,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:20,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:20,204 INFO L272 TraceCheckUtils]: 18: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:20,205 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #61#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:20,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:20,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:20,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:20,205 INFO L272 TraceCheckUtils]: 13: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:20,206 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #59#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:20,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:20,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:20,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:20,206 INFO L272 TraceCheckUtils]: 8: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:20,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(#t~post5 < 5);havoc #t~post5; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:20,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:20,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {4204#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:20,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-27 12:12:20,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-27 12:12:20,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:20,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {4204#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);~counter~0 := 0; {4204#true} is VALID [2022-04-27 12:12:20,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-27 12:12:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 12:12:20,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:20,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629819339] [2022-04-27 12:12:20,209 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:20,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571542929] [2022-04-27 12:12:20,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571542929] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:12:20,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:12:20,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:12:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750053123] [2022-04-27 12:12:20,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:20,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-27 12:12:20,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:20,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 12:12:20,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:20,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:12:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:20,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:12:20,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:12:20,273 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 12:12:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:21,623 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-04-27 12:12:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:12:21,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-27 12:12:21,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 12:12:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 12:12:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 12:12:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 12:12:21,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-27 12:12:23,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 79 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:23,780 INFO L225 Difference]: With dead ends: 146 [2022-04-27 12:12:23,780 INFO L226 Difference]: Without dead ends: 135 [2022-04-27 12:12:23,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:12:23,781 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:23,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 12:12:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-27 12:12:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-27 12:12:23,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:23,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:23,954 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:23,954 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:23,957 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-27 12:12:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-27 12:12:23,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:23,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:23,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 135 states. [2022-04-27 12:12:23,958 INFO L87 Difference]: Start difference. First operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 135 states. [2022-04-27 12:12:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:23,961 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-27 12:12:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-27 12:12:23,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:23,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:23,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:23,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-04-27 12:12:23,965 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-04-27 12:12:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:23,965 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-04-27 12:12:23,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 12:12:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-27 12:12:23,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-27 12:12:23,966 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:23,966 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 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-04-27 12:12:24,006 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-04-27 12:12:24,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:24,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:24,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:24,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-27 12:12:24,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:24,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107842909] [2022-04-27 12:12:24,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:24,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:24,181 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:24,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1701290462] [2022-04-27 12:12:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:24,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:24,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:24,198 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-04-27 12:12:24,237 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-04-27 12:12:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:24,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 12:12:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:24,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:30,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-27 12:12:30,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {5223#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);~counter~0 := 0; {5223#true} is VALID [2022-04-27 12:12:30,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:30,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-27 12:12:30,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-27 12:12:30,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:30,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:30,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:30,647 INFO L272 TraceCheckUtils]: 8: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:30,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:30,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:30,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:30,647 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #59#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:30,648 INFO L272 TraceCheckUtils]: 13: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:30,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:30,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:30,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:30,648 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #61#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:30,649 INFO L272 TraceCheckUtils]: 18: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:30,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:30,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:30,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:30,649 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #63#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:30,649 INFO L272 TraceCheckUtils]: 23: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:30,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:30,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:30,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:30,650 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #65#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:30,650 INFO L272 TraceCheckUtils]: 28: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:30,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:30,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:30,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:30,651 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #67#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:30,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:30,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:30,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:30,653 INFO L272 TraceCheckUtils]: 36: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:30,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:30,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:30,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:30,654 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #59#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:30,654 INFO L272 TraceCheckUtils]: 41: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:30,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:30,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:30,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:30,655 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #61#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:30,655 INFO L272 TraceCheckUtils]: 46: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:30,655 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:30,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:30,655 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:30,656 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #63#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:30,656 INFO L272 TraceCheckUtils]: 51: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:30,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:30,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:30,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:30,657 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #65#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:30,657 INFO L272 TraceCheckUtils]: 56: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:30,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:30,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:30,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:30,658 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #67#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:30,659 INFO L290 TraceCheckUtils]: 61: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-27 12:12:30,659 INFO L272 TraceCheckUtils]: 62: Hoare triple {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:30,659 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:30,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:30,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:30,660 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5223#true} {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-27 12:12:30,660 INFO L272 TraceCheckUtils]: 67: Hoare triple {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:30,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:30,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-27 12:12:30,661 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-27 12:12:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 12:12:30,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:32,040 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-27 12:12:32,055 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-27 12:12:32,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:32,057 INFO L272 TraceCheckUtils]: 67: Hoare triple {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:32,058 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5223#true} {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} #69#return; {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-27 12:12:32,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:32,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:32,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:32,058 INFO L272 TraceCheckUtils]: 62: Hoare triple {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:32,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !(~n~0 <= ~a~0); {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-27 12:12:32,059 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #67#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:32,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:32,060 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:32,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:32,060 INFO L272 TraceCheckUtils]: 56: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:32,060 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #65#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:32,061 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:32,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:32,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:32,061 INFO L272 TraceCheckUtils]: 51: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:32,062 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #63#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:32,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:32,062 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:32,062 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:32,062 INFO L272 TraceCheckUtils]: 46: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:32,063 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #61#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:32,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:32,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:32,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:32,064 INFO L272 TraceCheckUtils]: 41: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:32,065 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #59#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:32,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:32,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:32,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:32,065 INFO L272 TraceCheckUtils]: 36: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:32,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !!(#t~post5 < 5);havoc #t~post5; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:32,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:32,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:32,070 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #67#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:32,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:32,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:32,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:32,070 INFO L272 TraceCheckUtils]: 28: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:32,071 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #65#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:32,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:32,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:32,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:32,071 INFO L272 TraceCheckUtils]: 23: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:32,072 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #63#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:32,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:32,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:32,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:32,073 INFO L272 TraceCheckUtils]: 18: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:32,074 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #61#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:32,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:32,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:32,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:32,074 INFO L272 TraceCheckUtils]: 13: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:32,074 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #59#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:32,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:32,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:32,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:32,075 INFO L272 TraceCheckUtils]: 8: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:32,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(#t~post5 < 5);havoc #t~post5; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:32,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:32,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:32,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-27 12:12:32,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-27 12:12:32,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:32,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {5223#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);~counter~0 := 0; {5223#true} is VALID [2022-04-27 12:12:32,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-27 12:12:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 12:12:32,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:32,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107842909] [2022-04-27 12:12:32,078 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:32,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701290462] [2022-04-27 12:12:32,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701290462] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:12:32,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:12:32,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 12:12:32,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472432023] [2022-04-27 12:12:32,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:32,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-27 12:12:32,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:32,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 12:12:32,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:32,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:12:32,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:32,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:12:32,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:12:32,181 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 12:12:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:33,569 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-04-27 12:12:33,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:12:33,569 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-27 12:12:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 12:12:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-27 12:12:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 12:12:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-27 12:12:33,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-27 12:12:33,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:33,709 INFO L225 Difference]: With dead ends: 148 [2022-04-27 12:12:33,709 INFO L226 Difference]: Without dead ends: 144 [2022-04-27 12:12:33,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:12:33,710 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:33,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 189 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 12:12:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-27 12:12:33,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-27 12:12:33,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:33,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:33,830 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:33,831 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:33,850 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-27 12:12:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-27 12:12:33,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:33,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:33,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 144 states. [2022-04-27 12:12:33,864 INFO L87 Difference]: Start difference. First operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 144 states. [2022-04-27 12:12:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:33,866 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-27 12:12:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-27 12:12:33,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:33,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:33,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:33,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-04-27 12:12:33,870 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-04-27 12:12:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:33,870 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-04-27 12:12:33,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 12:12:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-04-27 12:12:33,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-27 12:12:33,871 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:33,871 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:33,901 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-04-27 12:12:34,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 12:12:34,092 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-27 12:12:34,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:34,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313815814] [2022-04-27 12:12:34,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:34,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:34,103 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:34,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2128134056] [2022-04-27 12:12:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:34,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:34,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:34,108 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-04-27 12:12:34,175 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-04-27 12:12:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:34,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:12:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:34,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:35,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {6368#true} call ULTIMATE.init(); {6368#true} is VALID [2022-04-27 12:12:35,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {6368#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);~counter~0 := 0; {6368#true} is VALID [2022-04-27 12:12:35,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6368#true} {6368#true} #81#return; {6368#true} is VALID [2022-04-27 12:12:35,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {6368#true} call #t~ret6 := main(); {6368#true} is VALID [2022-04-27 12:12:35,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {6368#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:35,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:35,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 5);havoc #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:35,119 INFO L272 TraceCheckUtils]: 8: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:35,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:35,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:35,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,120 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:35,120 INFO L272 TraceCheckUtils]: 13: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:35,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:35,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:35,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,121 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:35,121 INFO L272 TraceCheckUtils]: 18: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:35,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:35,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:35,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,122 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:35,122 INFO L272 TraceCheckUtils]: 23: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:35,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:35,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:35,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,123 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:35,123 INFO L272 TraceCheckUtils]: 28: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:35,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:35,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:35,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,124 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:35,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,126 INFO L272 TraceCheckUtils]: 36: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:35,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:35,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:35,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,127 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,128 INFO L272 TraceCheckUtils]: 41: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:35,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:35,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:35,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,129 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,129 INFO L272 TraceCheckUtils]: 46: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:35,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:35,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:35,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,131 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,131 INFO L272 TraceCheckUtils]: 51: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:35,131 INFO L290 TraceCheckUtils]: 52: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:35,131 INFO L290 TraceCheckUtils]: 53: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:35,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,132 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,132 INFO L272 TraceCheckUtils]: 56: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:35,132 INFO L290 TraceCheckUtils]: 57: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:35,132 INFO L290 TraceCheckUtils]: 58: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:35,132 INFO L290 TraceCheckUtils]: 59: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,133 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,133 INFO L290 TraceCheckUtils]: 61: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-27 12:12:35,134 INFO L272 TraceCheckUtils]: 62: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:35,134 INFO L290 TraceCheckUtils]: 63: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:35,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:35,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,134 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6368#true} {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-27 12:12:35,134 INFO L272 TraceCheckUtils]: 67: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:35,135 INFO L290 TraceCheckUtils]: 68: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:35,135 INFO L290 TraceCheckUtils]: 69: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:35,135 INFO L290 TraceCheckUtils]: 70: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:35,135 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6368#true} {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-27 12:12:35,137 INFO L272 TraceCheckUtils]: 72: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:35,137 INFO L290 TraceCheckUtils]: 73: Hoare triple {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:35,137 INFO L290 TraceCheckUtils]: 74: Hoare triple {6596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6369#false} is VALID [2022-04-27 12:12:35,138 INFO L290 TraceCheckUtils]: 75: Hoare triple {6369#false} assume !false; {6369#false} is VALID [2022-04-27 12:12:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 12:12:35,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:42,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:42,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313815814] [2022-04-27 12:12:42,411 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:42,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128134056] [2022-04-27 12:12:42,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128134056] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:12:42,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:12:42,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 12:12:42,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772867244] [2022-04-27 12:12:42,411 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:42,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-27 12:12:42,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:42,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:12:42,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:42,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:12:42,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:42,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:12:42,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:12:42,449 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:12:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:42,856 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-04-27 12:12:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:12:42,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-27 12:12:42,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:12:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-27 12:12:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:12:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-27 12:12:42,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-27 12:12:42,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:42,933 INFO L225 Difference]: With dead ends: 143 [2022-04-27 12:12:42,933 INFO L226 Difference]: Without dead ends: 132 [2022-04-27 12:12:42,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 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-04-27 12:12:42,936 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:42,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-27 12:12:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-27 12:12:43,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:43,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:43,018 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:43,018 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:43,024 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-27 12:12:43,024 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-27 12:12:43,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:43,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:43,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-27 12:12:43,027 INFO L87 Difference]: Start difference. First operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-27 12:12:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:43,032 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-27 12:12:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-27 12:12:43,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:43,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:43,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:43,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-27 12:12:43,036 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-04-27 12:12:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:43,036 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-27 12:12:43,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:12:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-27 12:12:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-27 12:12:43,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:43,037 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:43,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:12:43,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:43,260 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:43,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:43,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1454229731, now seen corresponding path program 4 times [2022-04-27 12:12:43,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:43,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317739978] [2022-04-27 12:12:43,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:43,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:43,272 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:43,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878206959] [2022-04-27 12:12:43,272 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 12:12:43,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:43,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:43,274 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-04-27 12:12:43,283 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-04-27 12:12:44,477 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 12:12:44,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:12:44,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-27 12:12:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:44,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:46,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-27 12:12:46,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#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);~counter~0 := 0; {7397#true} is VALID [2022-04-27 12:12:46,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:46,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-27 12:12:46,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-27 12:12:46,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7397#true} is VALID [2022-04-27 12:12:46,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-27 12:12:46,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 5);havoc #t~post5; {7397#true} is VALID [2022-04-27 12:12:46,002 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:46,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:46,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:46,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:46,003 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-27 12:12:46,003 INFO L272 TraceCheckUtils]: 13: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:46,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:46,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:46,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:46,005 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #61#return; {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:12:46,005 INFO L272 TraceCheckUtils]: 18: Hoare triple {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:46,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:46,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:46,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:46,006 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:46,007 INFO L272 TraceCheckUtils]: 23: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:46,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:46,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:46,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:46,008 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:46,009 INFO L272 TraceCheckUtils]: 28: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:46,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:46,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:46,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:46,009 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:46,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:46,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:46,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:46,988 INFO L272 TraceCheckUtils]: 36: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:46,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:46,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:46,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:46,989 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:46,989 INFO L272 TraceCheckUtils]: 41: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:46,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:46,990 INFO L290 TraceCheckUtils]: 43: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:46,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:46,990 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:46,991 INFO L272 TraceCheckUtils]: 46: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:46,991 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:46,991 INFO L290 TraceCheckUtils]: 48: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:46,992 INFO L290 TraceCheckUtils]: 49: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:46,992 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #63#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:46,992 INFO L272 TraceCheckUtils]: 51: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:46,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:46,993 INFO L290 TraceCheckUtils]: 53: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:46,993 INFO L290 TraceCheckUtils]: 54: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:46,994 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:46,994 INFO L272 TraceCheckUtils]: 56: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:46,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:46,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:46,994 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:46,995 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:48,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:48,709 INFO L290 TraceCheckUtils]: 62: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:48,709 INFO L290 TraceCheckUtils]: 63: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:48,709 INFO L272 TraceCheckUtils]: 64: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:48,709 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:48,710 INFO L290 TraceCheckUtils]: 66: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:48,710 INFO L290 TraceCheckUtils]: 67: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:48,711 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:48,711 INFO L272 TraceCheckUtils]: 69: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:48,711 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:48,711 INFO L290 TraceCheckUtils]: 71: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:48,712 INFO L290 TraceCheckUtils]: 72: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:48,712 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:48,713 INFO L272 TraceCheckUtils]: 74: Hoare triple {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:48,713 INFO L290 TraceCheckUtils]: 75: Hoare triple {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:48,713 INFO L290 TraceCheckUtils]: 76: Hoare triple {7634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-27 12:12:48,713 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-27 12:12:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 86 proven. 47 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-04-27 12:12:48,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:50,074 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-27 12:12:50,074 INFO L290 TraceCheckUtils]: 76: Hoare triple {7634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-27 12:12:50,074 INFO L290 TraceCheckUtils]: 75: Hoare triple {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:50,075 INFO L272 TraceCheckUtils]: 74: Hoare triple {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:50,076 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7653#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:50,076 INFO L290 TraceCheckUtils]: 72: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:50,076 INFO L290 TraceCheckUtils]: 71: Hoare triple {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:50,077 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:12:50,077 INFO L272 TraceCheckUtils]: 69: Hoare triple {7653#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,077 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7653#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:50,078 INFO L290 TraceCheckUtils]: 67: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:50,078 INFO L290 TraceCheckUtils]: 66: Hoare triple {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:50,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:12:50,078 INFO L272 TraceCheckUtils]: 64: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,079 INFO L290 TraceCheckUtils]: 63: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:50,079 INFO L290 TraceCheckUtils]: 62: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:50,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:50,086 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:50,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,087 INFO L272 TraceCheckUtils]: 56: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,100 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #65#return; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:50,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:50,101 INFO L290 TraceCheckUtils]: 53: Hoare triple {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:50,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:12:50,102 INFO L272 TraceCheckUtils]: 51: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,102 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-27 12:12:50,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,102 INFO L272 TraceCheckUtils]: 46: Hoare triple {7397#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,102 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-27 12:12:50,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,103 INFO L290 TraceCheckUtils]: 43: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,103 INFO L272 TraceCheckUtils]: 41: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,103 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-27 12:12:50,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,103 INFO L272 TraceCheckUtils]: 36: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {7397#true} assume !!(#t~post5 < 5);havoc #t~post5; {7397#true} is VALID [2022-04-27 12:12:50,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-27 12:12:50,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {7397#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7397#true} is VALID [2022-04-27 12:12:50,103 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7397#true} #67#return; {7397#true} is VALID [2022-04-27 12:12:50,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,104 INFO L272 TraceCheckUtils]: 28: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,104 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7397#true} {7397#true} #65#return; {7397#true} is VALID [2022-04-27 12:12:50,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,104 INFO L272 TraceCheckUtils]: 23: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,104 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-27 12:12:50,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,105 INFO L272 TraceCheckUtils]: 18: Hoare triple {7397#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,105 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-27 12:12:50,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,105 INFO L272 TraceCheckUtils]: 13: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,105 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-27 12:12:50,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,106 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 5);havoc #t~post5; {7397#true} is VALID [2022-04-27 12:12:50,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-27 12:12:50,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7397#true} is VALID [2022-04-27 12:12:50,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-27 12:12:50,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-27 12:12:50,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#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);~counter~0 := 0; {7397#true} is VALID [2022-04-27 12:12:50,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-27 12:12:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-27 12:12:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:50,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317739978] [2022-04-27 12:12:50,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:50,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878206959] [2022-04-27 12:12:50,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878206959] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:12:50,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:12:50,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-27 12:12:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827611865] [2022-04-27 12:12:50,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:50,108 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 78 [2022-04-27 12:12:50,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:50,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-27 12:12:52,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:52,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 12:12:52,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:52,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 12:12:52,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-27 12:12:52,184 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-27 12:12:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:55,224 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-04-27 12:12:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:12:55,224 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 78 [2022-04-27 12:12:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-27 12:12:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 12:12:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-27 12:12:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 12:12:55,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-27 12:12:57,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:57,326 INFO L225 Difference]: With dead ends: 142 [2022-04-27 12:12:57,326 INFO L226 Difference]: Without dead ends: 138 [2022-04-27 12:12:57,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:12:57,327 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:57,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 12:12:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-27 12:12:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-27 12:12:57,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:57,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:57,413 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:57,413 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:57,416 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-27 12:12:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-27 12:12:57,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:57,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:57,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 138 states. [2022-04-27 12:12:57,417 INFO L87 Difference]: Start difference. First operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 138 states. [2022-04-27 12:12:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:57,420 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-27 12:12:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-27 12:12:57,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:57,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:57,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:57,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-27 12:12:57,424 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-04-27 12:12:57,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:57,424 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-27 12:12:57,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-27 12:12:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-27 12:12:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-27 12:12:57,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:57,425 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:57,432 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-04-27 12:12:57,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 12:12:57,632 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:57,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 2 times [2022-04-27 12:12:57,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:57,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685501609] [2022-04-27 12:12:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:57,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:57,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:57,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [668541468] [2022-04-27 12:12:57,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:12:57,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:57,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:57,644 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-04-27 12:12:57,651 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-04-27 12:12:57,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:12:57,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:12:57,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 12:12:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:57,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:58,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {8553#true} call ULTIMATE.init(); {8553#true} is VALID [2022-04-27 12:12:58,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {8553#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);~counter~0 := 0; {8553#true} is VALID [2022-04-27 12:12:58,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8553#true} {8553#true} #81#return; {8553#true} is VALID [2022-04-27 12:12:58,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {8553#true} call #t~ret6 := main(); {8553#true} is VALID [2022-04-27 12:12:58,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {8553#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:58,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:58,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:58,330 INFO L272 TraceCheckUtils]: 8: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,331 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:58,331 INFO L272 TraceCheckUtils]: 13: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,332 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:58,332 INFO L272 TraceCheckUtils]: 18: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,334 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:58,334 INFO L272 TraceCheckUtils]: 23: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,338 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:58,338 INFO L272 TraceCheckUtils]: 28: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,339 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:58,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:58,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:58,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 5);havoc #t~post5; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:58,341 INFO L272 TraceCheckUtils]: 36: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,341 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #59#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:58,342 INFO L272 TraceCheckUtils]: 41: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,342 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #61#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:58,342 INFO L272 TraceCheckUtils]: 46: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,343 INFO L290 TraceCheckUtils]: 47: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,343 INFO L290 TraceCheckUtils]: 48: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,343 INFO L290 TraceCheckUtils]: 49: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,343 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #63#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:58,343 INFO L272 TraceCheckUtils]: 51: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,344 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #65#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:58,344 INFO L272 TraceCheckUtils]: 56: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,344 INFO L290 TraceCheckUtils]: 57: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,345 INFO L290 TraceCheckUtils]: 59: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,345 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #67#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:58,346 INFO L290 TraceCheckUtils]: 61: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:58,346 INFO L290 TraceCheckUtils]: 62: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:58,347 INFO L290 TraceCheckUtils]: 63: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:58,347 INFO L272 TraceCheckUtils]: 64: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,347 INFO L290 TraceCheckUtils]: 65: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,347 INFO L290 TraceCheckUtils]: 66: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,347 INFO L290 TraceCheckUtils]: 67: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,348 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #59#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:58,348 INFO L272 TraceCheckUtils]: 69: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,348 INFO L290 TraceCheckUtils]: 70: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,348 INFO L290 TraceCheckUtils]: 71: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,348 INFO L290 TraceCheckUtils]: 72: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,349 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #61#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:58,349 INFO L272 TraceCheckUtils]: 74: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,349 INFO L290 TraceCheckUtils]: 75: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,349 INFO L290 TraceCheckUtils]: 76: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,349 INFO L290 TraceCheckUtils]: 77: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,350 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #63#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:58,350 INFO L272 TraceCheckUtils]: 79: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,350 INFO L290 TraceCheckUtils]: 80: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,350 INFO L290 TraceCheckUtils]: 81: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,350 INFO L290 TraceCheckUtils]: 82: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,351 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #65#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:58,351 INFO L272 TraceCheckUtils]: 84: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,351 INFO L290 TraceCheckUtils]: 85: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,351 INFO L290 TraceCheckUtils]: 86: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,351 INFO L290 TraceCheckUtils]: 87: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,352 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #67#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:58,353 INFO L290 TraceCheckUtils]: 89: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} assume !(~n~0 <= ~a~0); {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:12:58,353 INFO L272 TraceCheckUtils]: 90: Hoare triple {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,353 INFO L290 TraceCheckUtils]: 91: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,353 INFO L290 TraceCheckUtils]: 92: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,353 INFO L290 TraceCheckUtils]: 93: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,353 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8553#true} {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #69#return; {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:12:58,354 INFO L272 TraceCheckUtils]: 95: Hoare triple {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8553#true} is VALID [2022-04-27 12:12:58,354 INFO L290 TraceCheckUtils]: 96: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-27 12:12:58,354 INFO L290 TraceCheckUtils]: 97: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-27 12:12:58,354 INFO L290 TraceCheckUtils]: 98: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-27 12:12:58,354 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {8553#true} {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #71#return; {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:12:58,355 INFO L272 TraceCheckUtils]: 100: Hoare triple {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {8862#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:58,356 INFO L290 TraceCheckUtils]: 101: Hoare triple {8862#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8866#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:58,356 INFO L290 TraceCheckUtils]: 102: Hoare triple {8866#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8554#false} is VALID [2022-04-27 12:12:58,356 INFO L290 TraceCheckUtils]: 103: Hoare triple {8554#false} assume !false; {8554#false} is VALID [2022-04-27 12:12:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-27 12:12:58,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:13:13,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:13,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685501609] [2022-04-27 12:13:13,182 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:13,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668541468] [2022-04-27 12:13:13,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668541468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:13:13,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:13:13,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 12:13:13,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70027324] [2022-04-27 12:13:13,183 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:13:13,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-27 12:13:13,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:13,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:13,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:13,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:13:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:13,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:13:13,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:13:13,233 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:13,966 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-27 12:13:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:13:13,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-27 12:13:13,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-27 12:13:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-27 12:13:13,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-27 12:13:14,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:14,049 INFO L225 Difference]: With dead ends: 140 [2022-04-27 12:13:14,049 INFO L226 Difference]: Without dead ends: 129 [2022-04-27 12:13:14,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 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-04-27 12:13:14,050 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:14,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:13:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-27 12:13:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-27 12:13:14,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:14,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:13:14,133 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:13:14,133 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:13:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:14,135 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-27 12:13:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-27 12:13:14,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:14,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:14,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-27 12:13:14,136 INFO L87 Difference]: Start difference. First operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-27 12:13:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:14,138 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-27 12:13:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-27 12:13:14,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:14,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:14,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:14,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:13:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-27 12:13:14,142 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-04-27 12:13:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:14,142 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-27 12:13:14,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-27 12:13:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-27 12:13:14,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:14,143 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 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-04-27 12:13:14,166 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-04-27 12:13:14,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 12:13:14,357 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:14,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:14,357 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 2 times [2022-04-27 12:13:14,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:14,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667892403] [2022-04-27 12:13:14,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:14,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:14,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:14,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303768595] [2022-04-27 12:13:14,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:13:14,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:14,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:14,370 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-04-27 12:13:14,377 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-04-27 12:13:14,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:13:14,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:13:14,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 12:13:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:14,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:15,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {9649#true} call ULTIMATE.init(); {9649#true} is VALID [2022-04-27 12:13:15,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {9649#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);~counter~0 := 0; {9649#true} is VALID [2022-04-27 12:13:15,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9649#true} {9649#true} #81#return; {9649#true} is VALID [2022-04-27 12:13:15,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {9649#true} call #t~ret6 := main(); {9649#true} is VALID [2022-04-27 12:13:15,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {9649#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:15,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:15,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:15,266 INFO L272 TraceCheckUtils]: 8: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,267 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:15,267 INFO L272 TraceCheckUtils]: 13: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,268 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:15,268 INFO L272 TraceCheckUtils]: 18: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,268 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:15,269 INFO L272 TraceCheckUtils]: 23: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,269 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:15,270 INFO L272 TraceCheckUtils]: 28: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,270 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:15,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:13:15,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:13:15,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:13:15,272 INFO L272 TraceCheckUtils]: 36: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,278 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #59#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:13:15,278 INFO L272 TraceCheckUtils]: 41: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,278 INFO L290 TraceCheckUtils]: 43: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,279 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #61#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:13:15,279 INFO L272 TraceCheckUtils]: 46: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,279 INFO L290 TraceCheckUtils]: 48: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,280 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #63#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:13:15,280 INFO L272 TraceCheckUtils]: 51: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,280 INFO L290 TraceCheckUtils]: 52: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,281 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #65#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:13:15,281 INFO L272 TraceCheckUtils]: 56: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,281 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #67#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:13:15,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-27 12:13:15,283 INFO L290 TraceCheckUtils]: 62: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-27 12:13:15,283 INFO L290 TraceCheckUtils]: 63: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} assume !!(#t~post5 < 5);havoc #t~post5; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-27 12:13:15,283 INFO L272 TraceCheckUtils]: 64: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,283 INFO L290 TraceCheckUtils]: 65: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,284 INFO L290 TraceCheckUtils]: 66: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,284 INFO L290 TraceCheckUtils]: 67: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,284 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #59#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-27 12:13:15,284 INFO L272 TraceCheckUtils]: 69: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,284 INFO L290 TraceCheckUtils]: 70: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,284 INFO L290 TraceCheckUtils]: 71: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,285 INFO L290 TraceCheckUtils]: 72: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,285 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #61#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-27 12:13:15,285 INFO L272 TraceCheckUtils]: 74: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,285 INFO L290 TraceCheckUtils]: 75: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,285 INFO L290 TraceCheckUtils]: 76: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,285 INFO L290 TraceCheckUtils]: 77: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,286 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #63#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-27 12:13:15,286 INFO L272 TraceCheckUtils]: 79: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,286 INFO L290 TraceCheckUtils]: 80: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,286 INFO L290 TraceCheckUtils]: 81: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,286 INFO L290 TraceCheckUtils]: 82: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,287 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #65#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-27 12:13:15,287 INFO L272 TraceCheckUtils]: 84: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,287 INFO L290 TraceCheckUtils]: 85: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,287 INFO L290 TraceCheckUtils]: 86: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,287 INFO L290 TraceCheckUtils]: 87: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,288 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #67#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-27 12:13:15,289 INFO L290 TraceCheckUtils]: 89: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:15,289 INFO L290 TraceCheckUtils]: 90: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:15,290 INFO L290 TraceCheckUtils]: 91: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} assume !!(#t~post5 < 5);havoc #t~post5; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:15,290 INFO L272 TraceCheckUtils]: 92: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,290 INFO L290 TraceCheckUtils]: 93: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,290 INFO L290 TraceCheckUtils]: 94: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,290 INFO L290 TraceCheckUtils]: 95: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,291 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #59#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:15,291 INFO L272 TraceCheckUtils]: 97: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,291 INFO L290 TraceCheckUtils]: 98: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,291 INFO L290 TraceCheckUtils]: 99: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,291 INFO L290 TraceCheckUtils]: 100: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,292 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #61#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:15,292 INFO L272 TraceCheckUtils]: 102: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,292 INFO L290 TraceCheckUtils]: 103: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,292 INFO L290 TraceCheckUtils]: 104: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,292 INFO L290 TraceCheckUtils]: 105: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,293 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #63#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:15,293 INFO L272 TraceCheckUtils]: 107: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,293 INFO L290 TraceCheckUtils]: 108: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,293 INFO L290 TraceCheckUtils]: 109: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,293 INFO L290 TraceCheckUtils]: 110: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,294 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #65#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:15,294 INFO L272 TraceCheckUtils]: 112: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,294 INFO L290 TraceCheckUtils]: 113: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,294 INFO L290 TraceCheckUtils]: 114: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,294 INFO L290 TraceCheckUtils]: 115: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,295 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #67#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:15,296 INFO L290 TraceCheckUtils]: 117: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} assume !(~n~0 <= ~a~0); {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:15,296 INFO L272 TraceCheckUtils]: 118: Hoare triple {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-27 12:13:15,296 INFO L290 TraceCheckUtils]: 119: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-27 12:13:15,296 INFO L290 TraceCheckUtils]: 120: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-27 12:13:15,296 INFO L290 TraceCheckUtils]: 121: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-27 12:13:15,297 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9649#true} {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} #69#return; {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:15,298 INFO L272 TraceCheckUtils]: 123: Hoare triple {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10028#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:15,298 INFO L290 TraceCheckUtils]: 124: Hoare triple {10028#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10032#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:15,298 INFO L290 TraceCheckUtils]: 125: Hoare triple {10032#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9650#false} is VALID [2022-04-27 12:13:15,298 INFO L290 TraceCheckUtils]: 126: Hoare triple {9650#false} assume !false; {9650#false} is VALID [2022-04-27 12:13:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-27 12:13:15,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:13:15,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:15,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667892403] [2022-04-27 12:13:15,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:15,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303768595] [2022-04-27 12:13:15,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303768595] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:13:15,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:13:15,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 12:13:15,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725580693] [2022-04-27 12:13:15,708 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:13:15,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-27 12:13:15,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:15,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-27 12:13:15,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:15,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:13:15,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:15,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:13:15,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:13:15,768 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-27 12:13:16,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:16,756 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-04-27 12:13:16,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:13:16,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-27 12:13:16,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-27 12:13:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-27 12:13:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-27 12:13:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-27 12:13:16,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-27 12:13:16,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:16,864 INFO L225 Difference]: With dead ends: 152 [2022-04-27 12:13:16,864 INFO L226 Difference]: Without dead ends: 150 [2022-04-27 12:13:16,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:13:16,865 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:16,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 12:13:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-27 12:13:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-27 12:13:16,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:16,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:13:16,957 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:13:16,957 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:13:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:16,960 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-27 12:13:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-27 12:13:16,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:16,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:16,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 150 states. [2022-04-27 12:13:16,961 INFO L87 Difference]: Start difference. First operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 150 states. [2022-04-27 12:13:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:16,964 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-27 12:13:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-27 12:13:16,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:16,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:16,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:16,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:13:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-04-27 12:13:16,968 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-04-27 12:13:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:16,968 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-04-27 12:13:16,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-27 12:13:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-04-27 12:13:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-27 12:13:16,970 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:16,970 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:16,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-27 12:13:17,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 12:13:17,183 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:17,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 2 times [2022-04-27 12:13:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:17,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358330558] [2022-04-27 12:13:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:17,194 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:17,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662248408] [2022-04-27 12:13:17,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:13:17,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:17,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:17,196 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-04-27 12:13:17,201 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-04-27 12:13:17,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:13:17,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:13:17,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:13:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:17,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:17,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {10890#true} call ULTIMATE.init(); {10890#true} is VALID [2022-04-27 12:13:17,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {10890#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);~counter~0 := 0; {10898#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:17,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {10898#(<= ~counter~0 0)} assume true; {10898#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:17,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10898#(<= ~counter~0 0)} {10890#true} #81#return; {10898#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:17,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {10898#(<= ~counter~0 0)} call #t~ret6 := main(); {10898#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:17,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {10898#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10898#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:17,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {10898#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {10914#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,712 INFO L272 TraceCheckUtils]: 8: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,713 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #59#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,714 INFO L272 TraceCheckUtils]: 13: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,715 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #61#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,716 INFO L272 TraceCheckUtils]: 18: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,717 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #63#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,718 INFO L272 TraceCheckUtils]: 23: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,719 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #65#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,719 INFO L272 TraceCheckUtils]: 28: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,721 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #67#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {10914#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:17,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {10914#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,722 INFO L272 TraceCheckUtils]: 36: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,723 INFO L290 TraceCheckUtils]: 38: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,723 INFO L290 TraceCheckUtils]: 39: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,723 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #59#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,724 INFO L272 TraceCheckUtils]: 41: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,725 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #61#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,725 INFO L272 TraceCheckUtils]: 46: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,726 INFO L290 TraceCheckUtils]: 48: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,726 INFO L290 TraceCheckUtils]: 49: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,727 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #63#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,727 INFO L272 TraceCheckUtils]: 51: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,727 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,728 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #65#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,729 INFO L272 TraceCheckUtils]: 56: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,730 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,730 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #67#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,730 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:17,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {10999#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {11084#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,732 INFO L272 TraceCheckUtils]: 64: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,732 INFO L290 TraceCheckUtils]: 65: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,732 INFO L290 TraceCheckUtils]: 66: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,732 INFO L290 TraceCheckUtils]: 67: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,733 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #59#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,734 INFO L272 TraceCheckUtils]: 69: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,735 INFO L290 TraceCheckUtils]: 72: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,735 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #61#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,736 INFO L272 TraceCheckUtils]: 74: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,736 INFO L290 TraceCheckUtils]: 75: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,736 INFO L290 TraceCheckUtils]: 76: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,736 INFO L290 TraceCheckUtils]: 77: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,737 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #63#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,737 INFO L272 TraceCheckUtils]: 79: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,738 INFO L290 TraceCheckUtils]: 80: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,738 INFO L290 TraceCheckUtils]: 81: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,738 INFO L290 TraceCheckUtils]: 82: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,739 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #65#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,739 INFO L272 TraceCheckUtils]: 84: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,740 INFO L290 TraceCheckUtils]: 85: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,740 INFO L290 TraceCheckUtils]: 86: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,740 INFO L290 TraceCheckUtils]: 87: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,741 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #67#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,741 INFO L290 TraceCheckUtils]: 89: Hoare triple {11084#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:17,742 INFO L290 TraceCheckUtils]: 90: Hoare triple {11084#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,742 INFO L290 TraceCheckUtils]: 91: Hoare triple {11169#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,743 INFO L272 TraceCheckUtils]: 92: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,743 INFO L290 TraceCheckUtils]: 93: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,743 INFO L290 TraceCheckUtils]: 94: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,744 INFO L290 TraceCheckUtils]: 95: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,744 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #59#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,745 INFO L272 TraceCheckUtils]: 97: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,745 INFO L290 TraceCheckUtils]: 98: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,746 INFO L290 TraceCheckUtils]: 99: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,746 INFO L290 TraceCheckUtils]: 100: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,747 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #61#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,747 INFO L272 TraceCheckUtils]: 102: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,747 INFO L290 TraceCheckUtils]: 103: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,748 INFO L290 TraceCheckUtils]: 104: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,748 INFO L290 TraceCheckUtils]: 105: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,749 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #63#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,749 INFO L272 TraceCheckUtils]: 107: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,750 INFO L290 TraceCheckUtils]: 108: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,750 INFO L290 TraceCheckUtils]: 109: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,750 INFO L290 TraceCheckUtils]: 110: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,751 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #65#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,752 INFO L272 TraceCheckUtils]: 112: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,752 INFO L290 TraceCheckUtils]: 113: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,752 INFO L290 TraceCheckUtils]: 114: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,753 INFO L290 TraceCheckUtils]: 115: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,753 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #67#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,753 INFO L290 TraceCheckUtils]: 117: Hoare triple {11169#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:17,754 INFO L290 TraceCheckUtils]: 118: Hoare triple {11169#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11254#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:13:17,754 INFO L290 TraceCheckUtils]: 119: Hoare triple {11254#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {10891#false} is VALID [2022-04-27 12:13:17,754 INFO L272 TraceCheckUtils]: 120: Hoare triple {10891#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#false} is VALID [2022-04-27 12:13:17,754 INFO L290 TraceCheckUtils]: 121: Hoare triple {10891#false} ~cond := #in~cond; {10891#false} is VALID [2022-04-27 12:13:17,755 INFO L290 TraceCheckUtils]: 122: Hoare triple {10891#false} assume !(0 == ~cond); {10891#false} is VALID [2022-04-27 12:13:17,755 INFO L290 TraceCheckUtils]: 123: Hoare triple {10891#false} assume true; {10891#false} is VALID [2022-04-27 12:13:17,755 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10891#false} {10891#false} #69#return; {10891#false} is VALID [2022-04-27 12:13:17,755 INFO L272 TraceCheckUtils]: 125: Hoare triple {10891#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10891#false} is VALID [2022-04-27 12:13:17,755 INFO L290 TraceCheckUtils]: 126: Hoare triple {10891#false} ~cond := #in~cond; {10891#false} is VALID [2022-04-27 12:13:17,755 INFO L290 TraceCheckUtils]: 127: Hoare triple {10891#false} assume 0 == ~cond; {10891#false} is VALID [2022-04-27 12:13:17,755 INFO L290 TraceCheckUtils]: 128: Hoare triple {10891#false} assume !false; {10891#false} is VALID [2022-04-27 12:13:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-27 12:13:17,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:13:18,196 INFO L290 TraceCheckUtils]: 128: Hoare triple {10891#false} assume !false; {10891#false} is VALID [2022-04-27 12:13:18,196 INFO L290 TraceCheckUtils]: 127: Hoare triple {10891#false} assume 0 == ~cond; {10891#false} is VALID [2022-04-27 12:13:18,196 INFO L290 TraceCheckUtils]: 126: Hoare triple {10891#false} ~cond := #in~cond; {10891#false} is VALID [2022-04-27 12:13:18,196 INFO L272 TraceCheckUtils]: 125: Hoare triple {10891#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10891#false} is VALID [2022-04-27 12:13:18,196 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10890#true} {10891#false} #69#return; {10891#false} is VALID [2022-04-27 12:13:18,196 INFO L290 TraceCheckUtils]: 123: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,196 INFO L290 TraceCheckUtils]: 122: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,196 INFO L290 TraceCheckUtils]: 121: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,196 INFO L272 TraceCheckUtils]: 120: Hoare triple {10891#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,197 INFO L290 TraceCheckUtils]: 119: Hoare triple {11254#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {10891#false} is VALID [2022-04-27 12:13:18,197 INFO L290 TraceCheckUtils]: 118: Hoare triple {11169#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11254#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:13:18,197 INFO L290 TraceCheckUtils]: 117: Hoare triple {11169#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:18,198 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #67#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:18,198 INFO L290 TraceCheckUtils]: 115: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,198 INFO L290 TraceCheckUtils]: 114: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,198 INFO L290 TraceCheckUtils]: 113: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,198 INFO L272 TraceCheckUtils]: 112: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,199 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #65#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:18,199 INFO L290 TraceCheckUtils]: 110: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,199 INFO L290 TraceCheckUtils]: 109: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,199 INFO L290 TraceCheckUtils]: 108: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,199 INFO L272 TraceCheckUtils]: 107: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,199 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #63#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:18,199 INFO L290 TraceCheckUtils]: 105: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,199 INFO L290 TraceCheckUtils]: 104: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,199 INFO L290 TraceCheckUtils]: 103: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,200 INFO L272 TraceCheckUtils]: 102: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,201 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #61#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:18,201 INFO L290 TraceCheckUtils]: 100: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,201 INFO L290 TraceCheckUtils]: 99: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,201 INFO L290 TraceCheckUtils]: 98: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,202 INFO L272 TraceCheckUtils]: 97: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,202 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #59#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:18,202 INFO L290 TraceCheckUtils]: 95: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,202 INFO L290 TraceCheckUtils]: 94: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,202 INFO L290 TraceCheckUtils]: 93: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,202 INFO L272 TraceCheckUtils]: 92: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,202 INFO L290 TraceCheckUtils]: 91: Hoare triple {11169#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:18,203 INFO L290 TraceCheckUtils]: 90: Hoare triple {11084#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:18,203 INFO L290 TraceCheckUtils]: 89: Hoare triple {11084#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:18,204 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #67#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:18,204 INFO L290 TraceCheckUtils]: 87: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,204 INFO L290 TraceCheckUtils]: 86: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,204 INFO L290 TraceCheckUtils]: 85: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,204 INFO L272 TraceCheckUtils]: 84: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,204 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #65#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:18,205 INFO L290 TraceCheckUtils]: 82: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,205 INFO L290 TraceCheckUtils]: 81: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,205 INFO L290 TraceCheckUtils]: 80: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,205 INFO L272 TraceCheckUtils]: 79: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,205 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #63#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:18,205 INFO L290 TraceCheckUtils]: 77: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,205 INFO L290 TraceCheckUtils]: 76: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,205 INFO L290 TraceCheckUtils]: 75: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,205 INFO L272 TraceCheckUtils]: 74: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,206 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #61#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:18,206 INFO L290 TraceCheckUtils]: 72: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,206 INFO L290 TraceCheckUtils]: 71: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,206 INFO L290 TraceCheckUtils]: 70: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,206 INFO L272 TraceCheckUtils]: 69: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,207 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #59#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:18,207 INFO L290 TraceCheckUtils]: 67: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,207 INFO L290 TraceCheckUtils]: 66: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,207 INFO L290 TraceCheckUtils]: 65: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,207 INFO L272 TraceCheckUtils]: 64: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,207 INFO L290 TraceCheckUtils]: 63: Hoare triple {11084#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:18,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {10999#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:18,208 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:18,209 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #67#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:18,209 INFO L290 TraceCheckUtils]: 59: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,209 INFO L290 TraceCheckUtils]: 58: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,209 INFO L290 TraceCheckUtils]: 57: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,209 INFO L272 TraceCheckUtils]: 56: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,210 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #65#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:18,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,210 INFO L290 TraceCheckUtils]: 52: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,210 INFO L272 TraceCheckUtils]: 51: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,210 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #63#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:18,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,211 INFO L272 TraceCheckUtils]: 46: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,211 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #61#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:18,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,211 INFO L272 TraceCheckUtils]: 41: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,212 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #59#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:18,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,212 INFO L272 TraceCheckUtils]: 36: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:18,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {10914#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:18,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {10914#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:18,213 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #67#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:18,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,214 INFO L272 TraceCheckUtils]: 28: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,214 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #65#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:18,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,214 INFO L272 TraceCheckUtils]: 23: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,215 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #63#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:18,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,215 INFO L272 TraceCheckUtils]: 18: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,215 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #61#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:18,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,216 INFO L272 TraceCheckUtils]: 13: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,216 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #59#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:18,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-27 12:13:18,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-27 12:13:18,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-27 12:13:18,216 INFO L272 TraceCheckUtils]: 8: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-27 12:13:18,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {10914#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:18,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {10898#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:18,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {10898#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10898#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:18,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {10898#(<= ~counter~0 0)} call #t~ret6 := main(); {10898#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:18,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10898#(<= ~counter~0 0)} {10890#true} #81#return; {10898#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:18,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {10898#(<= ~counter~0 0)} assume true; {10898#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:18,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {10890#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);~counter~0 := 0; {10898#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:18,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {10890#true} call ULTIMATE.init(); {10890#true} is VALID [2022-04-27 12:13:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-27 12:13:18,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:18,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358330558] [2022-04-27 12:13:18,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:18,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662248408] [2022-04-27 12:13:18,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662248408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:13:18,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:13:18,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-27 12:13:18,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538719093] [2022-04-27 12:13:18,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:13:18,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) Word has length 129 [2022-04-27 12:14:01,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:01,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-27 12:14:01,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:01,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:14:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:01,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:14:01,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:14:01,503 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-27 12:14:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:02,227 INFO L93 Difference]: Finished difference Result 183 states and 188 transitions. [2022-04-27 12:14:02,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 12:14:02,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) Word has length 129 [2022-04-27 12:14:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-27 12:14:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2022-04-27 12:14:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-27 12:14:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2022-04-27 12:14:02,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 116 transitions. [2022-04-27 12:14:02,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:02,787 INFO L225 Difference]: With dead ends: 183 [2022-04-27 12:14:02,787 INFO L226 Difference]: Without dead ends: 168 [2022-04-27 12:14:02,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:14:02,788 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:02,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 165 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:14:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-27 12:14:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2022-04-27 12:14:02,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:02,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:14:02,926 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:14:02,943 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:14:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:02,951 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-27 12:14:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2022-04-27 12:14:02,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:02,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:02,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 168 states. [2022-04-27 12:14:02,952 INFO L87 Difference]: Start difference. First operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 168 states. [2022-04-27 12:14:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:02,973 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-27 12:14:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2022-04-27 12:14:02,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:02,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:02,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:02,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:14:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 171 transitions. [2022-04-27 12:14:02,982 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 171 transitions. Word has length 129 [2022-04-27 12:14:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:02,983 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 171 transitions. [2022-04-27 12:14:02,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-27 12:14:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 171 transitions. [2022-04-27 12:14:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-27 12:14:02,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:02,984 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:03,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 12:14:03,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 12:14:03,199 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-04-27 12:14:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:03,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632098357] [2022-04-27 12:14:03,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:03,211 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:03,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295152309] [2022-04-27 12:14:03,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:14:03,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:03,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:03,217 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:14:03,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 12:14:03,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 12:14:03,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:14:03,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 12:14:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:03,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:04,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {12507#true} call ULTIMATE.init(); {12507#true} is VALID [2022-04-27 12:14:04,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {12507#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);~counter~0 := 0; {12507#true} is VALID [2022-04-27 12:14:04,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12507#true} {12507#true} #81#return; {12507#true} is VALID [2022-04-27 12:14:04,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {12507#true} call #t~ret6 := main(); {12507#true} is VALID [2022-04-27 12:14:04,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {12507#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:04,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:04,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:04,759 INFO L272 TraceCheckUtils]: 8: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,760 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:04,760 INFO L272 TraceCheckUtils]: 13: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,760 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:04,760 INFO L272 TraceCheckUtils]: 18: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,761 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:04,761 INFO L272 TraceCheckUtils]: 23: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,762 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:04,762 INFO L272 TraceCheckUtils]: 28: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,763 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:04,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-27 12:14:04,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-27 12:14:04,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-27 12:14:04,764 INFO L272 TraceCheckUtils]: 36: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,764 INFO L290 TraceCheckUtils]: 38: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,765 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #59#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-27 12:14:04,765 INFO L272 TraceCheckUtils]: 41: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,766 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #61#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-27 12:14:04,766 INFO L272 TraceCheckUtils]: 46: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,767 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #63#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-27 12:14:04,767 INFO L272 TraceCheckUtils]: 51: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,767 INFO L290 TraceCheckUtils]: 52: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,767 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #65#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-27 12:14:04,768 INFO L272 TraceCheckUtils]: 56: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,768 INFO L290 TraceCheckUtils]: 59: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,768 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #67#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-27 12:14:04,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:14:04,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:14:04,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(#t~post5 < 5);havoc #t~post5; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:14:04,770 INFO L272 TraceCheckUtils]: 64: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,770 INFO L290 TraceCheckUtils]: 65: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,770 INFO L290 TraceCheckUtils]: 66: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,770 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #59#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:14:04,770 INFO L272 TraceCheckUtils]: 69: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,771 INFO L290 TraceCheckUtils]: 70: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,771 INFO L290 TraceCheckUtils]: 71: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,771 INFO L290 TraceCheckUtils]: 72: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,771 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #61#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:14:04,771 INFO L272 TraceCheckUtils]: 74: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,771 INFO L290 TraceCheckUtils]: 75: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,771 INFO L290 TraceCheckUtils]: 76: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,772 INFO L290 TraceCheckUtils]: 77: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,772 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #63#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:14:04,772 INFO L272 TraceCheckUtils]: 79: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,772 INFO L290 TraceCheckUtils]: 80: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,772 INFO L290 TraceCheckUtils]: 81: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,772 INFO L290 TraceCheckUtils]: 82: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,773 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #65#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:14:04,773 INFO L272 TraceCheckUtils]: 84: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,773 INFO L290 TraceCheckUtils]: 85: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,773 INFO L290 TraceCheckUtils]: 86: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,773 INFO L290 TraceCheckUtils]: 87: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,774 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #67#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:14:04,774 INFO L290 TraceCheckUtils]: 89: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-27 12:14:04,775 INFO L290 TraceCheckUtils]: 90: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-27 12:14:04,775 INFO L290 TraceCheckUtils]: 91: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} assume !!(#t~post5 < 5);havoc #t~post5; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-27 12:14:04,775 INFO L272 TraceCheckUtils]: 92: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,775 INFO L290 TraceCheckUtils]: 93: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,775 INFO L290 TraceCheckUtils]: 94: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,776 INFO L290 TraceCheckUtils]: 95: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,776 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #59#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-27 12:14:04,776 INFO L272 TraceCheckUtils]: 97: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,776 INFO L290 TraceCheckUtils]: 98: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,776 INFO L290 TraceCheckUtils]: 99: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,776 INFO L290 TraceCheckUtils]: 100: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,777 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #61#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-27 12:14:04,777 INFO L272 TraceCheckUtils]: 102: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,777 INFO L290 TraceCheckUtils]: 103: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,777 INFO L290 TraceCheckUtils]: 104: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,777 INFO L290 TraceCheckUtils]: 105: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,778 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #63#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-27 12:14:04,778 INFO L272 TraceCheckUtils]: 107: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,778 INFO L290 TraceCheckUtils]: 108: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,778 INFO L290 TraceCheckUtils]: 109: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,778 INFO L290 TraceCheckUtils]: 110: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,779 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #65#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-27 12:14:04,779 INFO L272 TraceCheckUtils]: 112: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,779 INFO L290 TraceCheckUtils]: 113: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,779 INFO L290 TraceCheckUtils]: 114: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,779 INFO L290 TraceCheckUtils]: 115: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,780 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #67#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-27 12:14:04,780 INFO L290 TraceCheckUtils]: 117: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} assume !(~n~0 <= ~a~0); {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-27 12:14:04,780 INFO L272 TraceCheckUtils]: 118: Hoare triple {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,780 INFO L290 TraceCheckUtils]: 119: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,780 INFO L290 TraceCheckUtils]: 120: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,780 INFO L290 TraceCheckUtils]: 121: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,781 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12507#true} {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} #69#return; {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-27 12:14:04,781 INFO L272 TraceCheckUtils]: 123: Hoare triple {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {12507#true} is VALID [2022-04-27 12:14:04,781 INFO L290 TraceCheckUtils]: 124: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-27 12:14:04,781 INFO L290 TraceCheckUtils]: 125: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-27 12:14:04,781 INFO L290 TraceCheckUtils]: 126: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-27 12:14:04,782 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {12507#true} {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} #71#return; {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-27 12:14:04,783 INFO L272 TraceCheckUtils]: 128: Hoare triple {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {12901#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:04,783 INFO L290 TraceCheckUtils]: 129: Hoare triple {12901#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12905#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:04,783 INFO L290 TraceCheckUtils]: 130: Hoare triple {12905#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12508#false} is VALID [2022-04-27 12:14:04,783 INFO L290 TraceCheckUtils]: 131: Hoare triple {12508#false} assume !false; {12508#false} is VALID [2022-04-27 12:14:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-27 12:14:04,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:12,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:12,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632098357] [2022-04-27 12:14:12,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:12,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295152309] [2022-04-27 12:14:12,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295152309] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:14:12,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:14:12,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 12:14:12,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034703010] [2022-04-27 12:14:12,712 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:12,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-27 12:14:12,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:12,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-27 12:14:12,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:12,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:14:12,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:12,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:14:12,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:14:12,789 INFO L87 Difference]: Start difference. First operand 166 states and 171 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-27 12:14:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:14,004 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-27 12:14:14,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:14:14,004 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-27 12:14:14,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-27 12:14:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-27 12:14:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-27 12:14:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-27 12:14:14,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-27 12:14:14,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:14,145 INFO L225 Difference]: With dead ends: 168 [2022-04-27 12:14:14,145 INFO L226 Difference]: Without dead ends: 157 [2022-04-27 12:14:14,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:14:14,146 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:14,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 12:14:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-27 12:14:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-04-27 12:14:14,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:14,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:14:14,284 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:14:14,285 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:14:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:14,292 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2022-04-27 12:14:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2022-04-27 12:14:14,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:14,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:14,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 157 states. [2022-04-27 12:14:14,293 INFO L87 Difference]: Start difference. First operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 157 states. [2022-04-27 12:14:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:14,310 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2022-04-27 12:14:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2022-04-27 12:14:14,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:14,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:14,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:14,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:14:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2022-04-27 12:14:14,314 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 132 [2022-04-27 12:14:14,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:14,314 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2022-04-27 12:14:14,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-27 12:14:14,314 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2022-04-27 12:14:14,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-27 12:14:14,316 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:14,316 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:14,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 12:14:14,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:14,542 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:14,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1020857049, now seen corresponding path program 3 times [2022-04-27 12:14:14,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:14,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151579693] [2022-04-27 12:14:14,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:14,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:14,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [720063989] [2022-04-27 12:14:14,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:14:14,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:14,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:14,586 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:14:14,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 12:14:15,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 12:14:15,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:14:15,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:14:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:15,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:18,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {13822#true} call ULTIMATE.init(); {13822#true} is VALID [2022-04-27 12:14:18,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {13822#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);~counter~0 := 0; {13822#true} is VALID [2022-04-27 12:14:18,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13822#true} {13822#true} #81#return; {13822#true} is VALID [2022-04-27 12:14:18,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {13822#true} call #t~ret6 := main(); {13822#true} is VALID [2022-04-27 12:14:18,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {13822#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13822#true} is VALID [2022-04-27 12:14:18,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-27 12:14:18,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-27 12:14:18,671 INFO L272 TraceCheckUtils]: 8: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,672 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-27 12:14:18,672 INFO L272 TraceCheckUtils]: 13: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,672 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-27 12:14:18,672 INFO L272 TraceCheckUtils]: 18: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,673 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-27 12:14:18,673 INFO L272 TraceCheckUtils]: 23: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,673 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-27 12:14:18,673 INFO L272 TraceCheckUtils]: 28: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,674 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-27 12:14:18,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13822#true} is VALID [2022-04-27 12:14:18,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-27 12:14:18,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-27 12:14:18,674 INFO L272 TraceCheckUtils]: 36: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,674 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-27 12:14:18,675 INFO L272 TraceCheckUtils]: 41: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,675 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-27 12:14:18,675 INFO L272 TraceCheckUtils]: 46: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,676 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-27 12:14:18,676 INFO L272 TraceCheckUtils]: 51: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,677 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-27 12:14:18,677 INFO L272 TraceCheckUtils]: 56: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,677 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-27 12:14:18,678 INFO L290 TraceCheckUtils]: 61: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13822#true} is VALID [2022-04-27 12:14:18,678 INFO L290 TraceCheckUtils]: 62: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-27 12:14:18,678 INFO L290 TraceCheckUtils]: 63: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-27 12:14:18,678 INFO L272 TraceCheckUtils]: 64: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,678 INFO L290 TraceCheckUtils]: 65: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,678 INFO L290 TraceCheckUtils]: 66: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,678 INFO L290 TraceCheckUtils]: 67: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,678 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-27 12:14:18,678 INFO L272 TraceCheckUtils]: 69: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,678 INFO L290 TraceCheckUtils]: 70: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,679 INFO L290 TraceCheckUtils]: 71: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,679 INFO L290 TraceCheckUtils]: 72: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,679 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-27 12:14:18,679 INFO L272 TraceCheckUtils]: 74: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,679 INFO L290 TraceCheckUtils]: 75: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,679 INFO L290 TraceCheckUtils]: 76: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,679 INFO L290 TraceCheckUtils]: 77: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,679 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-27 12:14:18,679 INFO L272 TraceCheckUtils]: 79: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,680 INFO L290 TraceCheckUtils]: 80: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,680 INFO L290 TraceCheckUtils]: 81: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,680 INFO L290 TraceCheckUtils]: 82: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,680 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-27 12:14:18,680 INFO L272 TraceCheckUtils]: 84: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,680 INFO L290 TraceCheckUtils]: 85: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,680 INFO L290 TraceCheckUtils]: 86: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,680 INFO L290 TraceCheckUtils]: 87: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,680 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-27 12:14:18,680 INFO L290 TraceCheckUtils]: 89: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13822#true} is VALID [2022-04-27 12:14:18,681 INFO L290 TraceCheckUtils]: 90: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-27 12:14:18,681 INFO L290 TraceCheckUtils]: 91: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-27 12:14:18,681 INFO L272 TraceCheckUtils]: 92: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,681 INFO L290 TraceCheckUtils]: 93: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,681 INFO L290 TraceCheckUtils]: 94: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,681 INFO L290 TraceCheckUtils]: 95: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,681 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-27 12:14:18,681 INFO L272 TraceCheckUtils]: 97: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,681 INFO L290 TraceCheckUtils]: 98: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,681 INFO L290 TraceCheckUtils]: 99: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,682 INFO L290 TraceCheckUtils]: 100: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,682 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-27 12:14:18,682 INFO L272 TraceCheckUtils]: 102: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,682 INFO L290 TraceCheckUtils]: 103: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,682 INFO L290 TraceCheckUtils]: 104: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,682 INFO L290 TraceCheckUtils]: 105: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,682 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-27 12:14:18,682 INFO L272 TraceCheckUtils]: 107: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,682 INFO L290 TraceCheckUtils]: 108: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,682 INFO L290 TraceCheckUtils]: 109: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,683 INFO L290 TraceCheckUtils]: 110: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,683 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-27 12:14:18,683 INFO L272 TraceCheckUtils]: 112: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,683 INFO L290 TraceCheckUtils]: 113: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,683 INFO L290 TraceCheckUtils]: 114: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,683 INFO L290 TraceCheckUtils]: 115: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,683 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-27 12:14:18,685 INFO L290 TraceCheckUtils]: 117: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {14178#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-27 12:14:18,690 INFO L290 TraceCheckUtils]: 118: Hoare triple {14178#(<= main_~n~0 (+ main_~a~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14178#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-27 12:14:18,691 INFO L290 TraceCheckUtils]: 119: Hoare triple {14178#(<= main_~n~0 (+ main_~a~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {14178#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-27 12:14:18,691 INFO L272 TraceCheckUtils]: 120: Hoare triple {14178#(<= main_~n~0 (+ main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,691 INFO L290 TraceCheckUtils]: 121: Hoare triple {13822#true} ~cond := #in~cond; {14191#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:18,692 INFO L290 TraceCheckUtils]: 122: Hoare triple {14191#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:18,692 INFO L290 TraceCheckUtils]: 123: Hoare triple {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:18,693 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} {14178#(<= main_~n~0 (+ main_~a~0 1))} #59#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-27 12:14:18,693 INFO L272 TraceCheckUtils]: 125: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,693 INFO L290 TraceCheckUtils]: 126: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,693 INFO L290 TraceCheckUtils]: 127: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,693 INFO L290 TraceCheckUtils]: 128: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,694 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13822#true} {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #61#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-27 12:14:18,694 INFO L272 TraceCheckUtils]: 130: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,694 INFO L290 TraceCheckUtils]: 131: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,694 INFO L290 TraceCheckUtils]: 132: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,694 INFO L290 TraceCheckUtils]: 133: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,695 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {13822#true} {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #63#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-27 12:14:18,695 INFO L272 TraceCheckUtils]: 135: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,695 INFO L290 TraceCheckUtils]: 136: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,695 INFO L290 TraceCheckUtils]: 137: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,695 INFO L290 TraceCheckUtils]: 138: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,712 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {13822#true} {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #65#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-27 12:14:18,712 INFO L272 TraceCheckUtils]: 140: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,712 INFO L290 TraceCheckUtils]: 141: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,712 INFO L290 TraceCheckUtils]: 142: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,712 INFO L290 TraceCheckUtils]: 143: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,713 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {13822#true} {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #67#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-27 12:14:18,714 INFO L290 TraceCheckUtils]: 145: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} assume !(~n~0 <= ~a~0); {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-27 12:14:18,714 INFO L272 TraceCheckUtils]: 146: Hoare triple {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-27 12:14:18,714 INFO L290 TraceCheckUtils]: 147: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-27 12:14:18,714 INFO L290 TraceCheckUtils]: 148: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-27 12:14:18,714 INFO L290 TraceCheckUtils]: 149: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-27 12:14:18,715 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13822#true} {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #69#return; {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-27 12:14:20,728 WARN L272 TraceCheckUtils]: 151: Hoare triple {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {14285#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-27 12:14:20,729 INFO L290 TraceCheckUtils]: 152: Hoare triple {14285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:20,730 INFO L290 TraceCheckUtils]: 153: Hoare triple {14289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13823#false} is VALID [2022-04-27 12:14:20,730 INFO L290 TraceCheckUtils]: 154: Hoare triple {13823#false} assume !false; {13823#false} is VALID [2022-04-27 12:14:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-27 12:14:20,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:22,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151579693] [2022-04-27 12:14:22,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:22,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720063989] [2022-04-27 12:14:22,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720063989] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:14:22,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:14:22,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 12:14:22,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776862724] [2022-04-27 12:14:22,854 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:22,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 155 [2022-04-27 12:14:22,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:22,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:14:24,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:24,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:14:24,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:24,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:14:24,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2022-04-27 12:14:24,903 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:14:35,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:14:37,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:14:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:37,925 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2022-04-27 12:14:37,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:14:37,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 155 [2022-04-27 12:14:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:14:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-27 12:14:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:14:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-27 12:14:37,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-27 12:14:38,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:38,606 INFO L225 Difference]: With dead ends: 166 [2022-04-27 12:14:38,606 INFO L226 Difference]: Without dead ends: 164 [2022-04-27 12:14:38,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2022-04-27 12:14:38,607 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:38,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 118 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 177 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-04-27 12:14:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-27 12:14:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2022-04-27 12:14:38,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:38,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:14:38,826 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:14:38,826 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:14:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:38,829 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2022-04-27 12:14:38,829 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-27 12:14:38,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:38,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:38,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-27 12:14:38,830 INFO L87 Difference]: Start difference. First operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-27 12:14:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:38,836 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2022-04-27 12:14:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-27 12:14:38,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:38,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:38,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:38,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:14:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2022-04-27 12:14:38,856 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 155 [2022-04-27 12:14:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:38,856 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2022-04-27 12:14:38,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:14:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2022-04-27 12:14:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-27 12:14:38,858 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:38,858 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:38,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 12:14:39,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 12:14:39,065 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:39,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:39,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2040587668, now seen corresponding path program 3 times [2022-04-27 12:14:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:39,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261475659] [2022-04-27 12:14:39,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:39,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:39,078 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:39,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1677696653] [2022-04-27 12:14:39,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:14:39,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:39,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:39,085 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:14:39,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 12:14:39,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-04-27 12:14:39,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 12:14:39,657 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 12:14:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 12:14:39,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 12:14:39,836 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 12:14:39,837 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:14:39,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 12:14:40,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:40,048 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:40,051 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:14:40,186 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:14:40,187 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:14:40,188 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:14:40,189 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:14:40,190 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:14:40,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:14:40 BoogieIcfgContainer [2022-04-27 12:14:40,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:14:40,191 INFO L158 Benchmark]: Toolchain (without parser) took 154915.45ms. Allocated memory was 189.8MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 133.8MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-04-27 12:14:40,191 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:14:40,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.90ms. Allocated memory was 189.8MB in the beginning and 252.7MB in the end (delta: 62.9MB). Free memory was 133.7MB in the beginning and 223.4MB in the end (delta: -89.7MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-04-27 12:14:40,192 INFO L158 Benchmark]: Boogie Preprocessor took 26.04ms. Allocated memory is still 252.7MB. Free memory was 223.4MB in the beginning and 221.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 12:14:40,192 INFO L158 Benchmark]: RCFGBuilder took 296.49ms. Allocated memory is still 252.7MB. Free memory was 221.9MB in the beginning and 209.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 12:14:40,192 INFO L158 Benchmark]: TraceAbstraction took 154309.34ms. Allocated memory was 252.7MB in the beginning and 7.7GB in the end (delta: 7.4GB). Free memory was 209.3MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-04-27 12:14:40,193 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 276.90ms. Allocated memory was 189.8MB in the beginning and 252.7MB in the end (delta: 62.9MB). Free memory was 133.7MB in the beginning and 223.4MB in the end (delta: -89.7MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.04ms. Allocated memory is still 252.7MB. Free memory was 223.4MB in the beginning and 221.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 296.49ms. Allocated memory is still 252.7MB. Free memory was 221.9MB in the beginning and 209.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 154309.34ms. Allocated memory was 252.7MB in the beginning and 7.7GB in the end (delta: 7.4GB). Free memory was 209.3MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=10, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=5, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND FALSE !(counter++<5) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=5, counter=6, n=5, x=125, y=91, z=36] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 154.1s, OverallIterations: 19, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 35.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239 mSDsluCounter, 2596 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1793 mSDsCounter, 332 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2464 IncrementalHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 332 mSolverCounterUnsat, 803 mSDtfsCounter, 2464 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1822 GetRequests, 1658 SyntacticMatches, 15 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=16, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 26 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 60.0s InterpolantComputationTime, 1325 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1616 ConstructedInterpolants, 0 QuantifiedInterpolants, 6825 SizeOfPredicates, 39 NumberOfNonLiveVariables, 2551 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 7107/8066 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 12:14:40,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...