/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_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:13:57,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:13:57,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:13:57,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:13:57,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:13:57,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:13:57,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:13:57,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:13:57,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:13:57,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:13:57,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:13:57,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:13:57,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:13:57,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:13:57,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:13:57,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:13:57,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:13:57,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:13:57,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:13:57,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:13:57,682 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:13:57,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:13:57,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:13:57,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:13:57,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:13:57,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:13:57,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:13:57,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:13:57,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:13:57,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:13:57,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:13:57,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:13:57,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:13:57,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:13:57,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:13:57,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:13:57,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:13:57,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:13:57,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:13:57,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:13:57,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:13:57,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:13:57,694 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:13:57,709 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:13:57,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:13:57,709 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:13:57,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:13:57,710 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:13:57,710 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:13:57,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:13:57,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:13:57,711 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:13:57,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:13:57,711 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:13:57,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:13:57,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:13:57,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:13:57,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:13:57,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:13:57,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:13:57,712 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:13:57,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:13:57,712 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:13:57,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:13:57,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:13:57,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:13:57,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:13:57,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:13:57,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:13:57,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:13:57,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:13:57,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:13:57,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:13:57,713 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:13:57,713 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:13:57,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:13:57,713 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:13:57,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:13:57,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:13:57,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:13:57,933 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:13:57,934 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:13:57,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound2.c [2022-04-27 12:13:57,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cd53709a/f83b4c411afd4724a2e7bfd10fe9d42e/FLAGb341a9941 [2022-04-27 12:13:58,358 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:13:58,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound2.c [2022-04-27 12:13:58,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cd53709a/f83b4c411afd4724a2e7bfd10fe9d42e/FLAGb341a9941 [2022-04-27 12:13:58,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cd53709a/f83b4c411afd4724a2e7bfd10fe9d42e [2022-04-27 12:13:58,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:13:58,775 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:13:58,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:13:58,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:13:58,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:13:58,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:13:58" (1/1) ... [2022-04-27 12:13:58,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633ece13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:58, skipping insertion in model container [2022-04-27 12:13:58,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:13:58" (1/1) ... [2022-04-27 12:13:58,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:13:58,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:13:58,929 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_valuebound2.c[588,601] [2022-04-27 12:13:58,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:13:58,974 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:13:58,985 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_valuebound2.c[588,601] [2022-04-27 12:13:58,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:13:59,000 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:13:59,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:59 WrapperNode [2022-04-27 12:13:59,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:13:59,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:13:59,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:13:59,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:13:59,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:59" (1/1) ... [2022-04-27 12:13:59,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:59" (1/1) ... [2022-04-27 12:13:59,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:59" (1/1) ... [2022-04-27 12:13:59,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:59" (1/1) ... [2022-04-27 12:13:59,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:59" (1/1) ... [2022-04-27 12:13:59,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:59" (1/1) ... [2022-04-27 12:13:59,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:59" (1/1) ... [2022-04-27 12:13:59,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:13:59,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:13:59,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:13:59,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:13:59,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:59" (1/1) ... [2022-04-27 12:13:59,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:13:59,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:59,041 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:13:59,046 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:13:59,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:13:59,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:13:59,079 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:13:59,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:13:59,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:13:59,079 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:13:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:13:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:13:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:13:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:13:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-27 12:13:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:13:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:13:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:13:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:13:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:13:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:13:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:13:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:13:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:13:59,120 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:13:59,121 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:13:59,286 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:13:59,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:13:59,291 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 12:13:59,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:13:59 BoogieIcfgContainer [2022-04-27 12:13:59,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:13:59,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:13:59,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:13:59,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:13:59,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:13:58" (1/3) ... [2022-04-27 12:13:59,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445dab3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:13:59, skipping insertion in model container [2022-04-27 12:13:59,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:59" (2/3) ... [2022-04-27 12:13:59,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445dab3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:13:59, skipping insertion in model container [2022-04-27 12:13:59,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:13:59" (3/3) ... [2022-04-27 12:13:59,298 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound2.c [2022-04-27 12:13:59,308 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:13:59,308 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:13:59,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:13:59,342 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@153f464c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69d6a955 [2022-04-27 12:13:59,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:13:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:13:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:13:59,364 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:59,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:59,364 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:59,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:59,368 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-27 12:13:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:59,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577009612] [2022-04-27 12:13:59,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:59,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:13:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:59,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#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); {39#true} is VALID [2022-04-27 12:13:59,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-27 12:13:59,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-27 12:13:59,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:13:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:59,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-27 12:13:59,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-27 12:13:59,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-27 12:13:59,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-27 12:13:59,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:13:59,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#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); {39#true} is VALID [2022-04-27 12:13:59,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-27 12:13:59,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-27 12:13:59,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-27 12:13:59,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#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; {39#true} is VALID [2022-04-27 12:13:59,575 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {39#true} is VALID [2022-04-27 12:13:59,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-27 12:13:59,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-27 12:13:59,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-27 12:13:59,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-27 12:13:59,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {40#false} is VALID [2022-04-27 12:13:59,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-27 12:13:59,576 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {40#false} is VALID [2022-04-27 12:13:59,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-27 12:13:59,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-27 12:13:59,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-27 12:13:59,578 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:13:59,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:59,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577009612] [2022-04-27 12:13:59,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577009612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:13:59,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:13:59,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:13:59,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424060270] [2022-04-27 12:13:59,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:13:59,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:13:59,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:59,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:59,614 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:13:59,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:13:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:59,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:13:59,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:13:59,651 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:59,858 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-27 12:13:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:13:59,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:13:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 12:13:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 12:13:59,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-27 12:14:00,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:00,010 INFO L225 Difference]: With dead ends: 63 [2022-04-27 12:14:00,011 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 12:14:00,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:14:00,015 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:00,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:14:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 12:14:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 12:14:00,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:00,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:14:00,039 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:14:00,040 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:14:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:00,044 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-27 12:14:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-27 12:14:00,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:00,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:00,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-27 12:14:00,046 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-27 12:14:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:00,049 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-27 12:14:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-27 12:14:00,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:00,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:00,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:00,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:14:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-27 12:14:00,060 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-27 12:14:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:00,060 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-27 12:14:00,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:14:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-27 12:14:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:14:00,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:00,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:00,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:14:00,062 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:00,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-27 12:14:00,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:00,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011467076] [2022-04-27 12:14:00,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:00,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:00,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:14:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:00,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {270#(and (= |#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); {258#true} is VALID [2022-04-27 12:14:00,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-27 12:14:00,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {258#true} {258#true} #84#return; {258#true} is VALID [2022-04-27 12:14:00,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:14:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:00,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#true} ~cond := #in~cond; {258#true} is VALID [2022-04-27 12:14:00,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} assume !(0 == ~cond); {258#true} is VALID [2022-04-27 12:14:00,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-27 12:14:00,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #60#return; {258#true} is VALID [2022-04-27 12:14:00,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:14:00,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(and (= |#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); {258#true} is VALID [2022-04-27 12:14:00,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-27 12:14:00,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #84#return; {258#true} is VALID [2022-04-27 12:14:00,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret5 := main(); {258#true} is VALID [2022-04-27 12:14:00,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#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; {258#true} is VALID [2022-04-27 12:14:00,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {258#true} is VALID [2022-04-27 12:14:00,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {258#true} ~cond := #in~cond; {258#true} is VALID [2022-04-27 12:14:00,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#true} assume !(0 == ~cond); {258#true} is VALID [2022-04-27 12:14:00,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-27 12:14:00,191 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {258#true} {258#true} #60#return; {258#true} is VALID [2022-04-27 12:14:00,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {267#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 12:14:00,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {267#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 12:14:00,192 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:00,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {269#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:14:00,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {259#false} is VALID [2022-04-27 12:14:00,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#false} assume !false; {259#false} is VALID [2022-04-27 12:14:00,193 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:14:00,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:00,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011467076] [2022-04-27 12:14:00,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011467076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:14:00,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:14:00,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:14:00,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323751272] [2022-04-27 12:14:00,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:14:00,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:14:00,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:00,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:14:00,213 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:14:00,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:14:00,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:00,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:14:00,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:14:00,215 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:14:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:00,620 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-27 12:14:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:14:00,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:14:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:14:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-27 12:14:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:14:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-27 12:14:00,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-27 12:14:00,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:00,686 INFO L225 Difference]: With dead ends: 37 [2022-04-27 12:14:00,686 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:14:00,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:14:00,690 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:00,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:14:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:14:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 12:14:00,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:00,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:14:00,698 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:14:00,698 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:14:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:00,701 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 12:14:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 12:14:00,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:00,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:00,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-27 12:14:00,702 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-27 12:14:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:00,729 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 12:14:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 12:14:00,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:00,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:00,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:00,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:14:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-27 12:14:00,750 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-27 12:14:00,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:00,750 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-27 12:14:00,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:14:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 12:14:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 12:14:00,751 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:00,751 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:00,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:14:00,752 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:00,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-27 12:14:00,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:00,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719036586] [2022-04-27 12:14:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:00,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:00,770 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:00,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944328563] [2022-04-27 12:14:00,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:00,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:00,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:00,778 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:14:00,802 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:14:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:00,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:14:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:00,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:01,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2022-04-27 12:14:01,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#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); {463#true} is VALID [2022-04-27 12:14:01,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-27 12:14:01,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {463#true} {463#true} #84#return; {463#true} is VALID [2022-04-27 12:14:01,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {463#true} call #t~ret5 := main(); {463#true} is VALID [2022-04-27 12:14:01,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {463#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; {463#true} is VALID [2022-04-27 12:14:01,011 INFO L272 TraceCheckUtils]: 6: Hoare triple {463#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {463#true} is VALID [2022-04-27 12:14:01,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#true} ~cond := #in~cond; {463#true} is VALID [2022-04-27 12:14:01,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#true} assume !(0 == ~cond); {463#true} is VALID [2022-04-27 12:14:01,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-27 12:14:01,011 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {463#true} {463#true} #60#return; {463#true} is VALID [2022-04-27 12:14:01,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {463#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {501#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:14:01,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {501#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {501#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:14:01,012 INFO L272 TraceCheckUtils]: 13: Hoare triple {501#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {463#true} is VALID [2022-04-27 12:14:01,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {463#true} ~cond := #in~cond; {463#true} is VALID [2022-04-27 12:14:01,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {463#true} assume !(0 == ~cond); {463#true} is VALID [2022-04-27 12:14:01,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-27 12:14:01,013 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {463#true} {501#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {501#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:14:01,014 INFO L272 TraceCheckUtils]: 18: Hoare triple {501#(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)); {523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:01,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:01,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {464#false} is VALID [2022-04-27 12:14:01,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#false} assume !false; {464#false} is VALID [2022-04-27 12:14:01,015 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:14:01,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:14:01,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:01,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719036586] [2022-04-27 12:14:01,015 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:01,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944328563] [2022-04-27 12:14:01,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944328563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:14:01,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:14:01,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:14:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274010260] [2022-04-27 12:14:01,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:14:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:01,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:01,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:01,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:01,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:14:01,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:01,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:14:01,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:14:01,032 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:01,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:01,226 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-27 12:14:01,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:14:01,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:01,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 12:14:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 12:14:01,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 12:14:01,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:01,304 INFO L225 Difference]: With dead ends: 54 [2022-04-27 12:14:01,304 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 12:14:01,304 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:14:01,307 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:01,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:14:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 12:14:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-27 12:14:01,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:01,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:14:01,324 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:14:01,326 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:14:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:01,334 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 12:14:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 12:14:01,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:01,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:01,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-27 12:14:01,343 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-27 12:14:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:01,346 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 12:14:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 12:14:01,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:01,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:01,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:01,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:14:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-27 12:14:01,348 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-27 12:14:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:01,348 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-27 12:14:01,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-27 12:14:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 12:14:01,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:01,349 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:01,378 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:14:01,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:01,560 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:01,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:01,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-27 12:14:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:01,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386698137] [2022-04-27 12:14:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:01,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:01,574 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:01,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584792109] [2022-04-27 12:14:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:01,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:01,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:01,575 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:14:01,576 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:14:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:01,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:14:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:01,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:01,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {792#true} call ULTIMATE.init(); {792#true} is VALID [2022-04-27 12:14:01,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {792#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); {792#true} is VALID [2022-04-27 12:14:01,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-27 12:14:01,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {792#true} {792#true} #84#return; {792#true} is VALID [2022-04-27 12:14:01,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {792#true} call #t~ret5 := main(); {792#true} is VALID [2022-04-27 12:14:01,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {792#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; {792#true} is VALID [2022-04-27 12:14:01,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {792#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {792#true} is VALID [2022-04-27 12:14:01,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {792#true} ~cond := #in~cond; {792#true} is VALID [2022-04-27 12:14:01,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {792#true} assume !(0 == ~cond); {792#true} is VALID [2022-04-27 12:14:01,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-27 12:14:01,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {792#true} {792#true} #60#return; {792#true} is VALID [2022-04-27 12:14:01,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {792#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {830#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:14:01,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {830#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:14:01,726 INFO L272 TraceCheckUtils]: 13: Hoare triple {830#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {792#true} is VALID [2022-04-27 12:14:01,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {792#true} ~cond := #in~cond; {792#true} is VALID [2022-04-27 12:14:01,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {792#true} assume !(0 == ~cond); {792#true} is VALID [2022-04-27 12:14:01,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-27 12:14:01,733 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {792#true} {830#(and (= main_~x~0 0) (= main_~n~0 0))} #62#return; {830#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:14:01,733 INFO L272 TraceCheckUtils]: 18: Hoare triple {830#(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)); {792#true} is VALID [2022-04-27 12:14:01,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {792#true} ~cond := #in~cond; {792#true} is VALID [2022-04-27 12:14:01,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {792#true} assume !(0 == ~cond); {792#true} is VALID [2022-04-27 12:14:01,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-27 12:14:01,735 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {792#true} {830#(and (= main_~x~0 0) (= main_~n~0 0))} #64#return; {830#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:14:01,735 INFO L272 TraceCheckUtils]: 23: Hoare triple {830#(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)); {867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:01,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:01,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {793#false} is VALID [2022-04-27 12:14:01,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {793#false} assume !false; {793#false} is VALID [2022-04-27 12:14:01,736 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:14:01,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:14:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:01,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386698137] [2022-04-27 12:14:01,737 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:01,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584792109] [2022-04-27 12:14:01,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584792109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:14:01,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:14:01,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:14:01,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685437162] [2022-04-27 12:14:01,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:14:01,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:01,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:01,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:01,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:01,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:14:01,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:01,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:14:01,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:14:01,770 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:02,001 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-27 12:14:02,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:14:02,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:02,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 12:14:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 12:14:02,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 12:14:02,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:02,074 INFO L225 Difference]: With dead ends: 58 [2022-04-27 12:14:02,074 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 12:14:02,075 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:14:02,076 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:02,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:14:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 12:14:02,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-27 12:14:02,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:02,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:02,097 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:02,098 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:02,101 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-27 12:14:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-27 12:14:02,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:02,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:02,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-27 12:14:02,104 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-27 12:14:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:02,108 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-27 12:14:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-27 12:14:02,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:02,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:02,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:02,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-27 12:14:02,112 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-27 12:14:02,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:02,112 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-27 12:14:02,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:14:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-27 12:14:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:14:02,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:02,113 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, 1, 1, 1, 1, 1] [2022-04-27 12:14:02,135 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:14:02,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 12:14:02,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:02,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-27 12:14:02,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:02,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471148497] [2022-04-27 12:14:02,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:02,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:02,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:02,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897469993] [2022-04-27 12:14:02,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:02,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:02,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:02,328 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:14:02,329 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:14:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:02,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:14:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:02,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:02,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {1165#true} call ULTIMATE.init(); {1165#true} is VALID [2022-04-27 12:14:02,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#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); {1165#true} is VALID [2022-04-27 12:14:02,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 12:14:02,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} #84#return; {1165#true} is VALID [2022-04-27 12:14:02,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {1165#true} call #t~ret5 := main(); {1165#true} is VALID [2022-04-27 12:14:02,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#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; {1165#true} is VALID [2022-04-27 12:14:02,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {1165#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {1165#true} is VALID [2022-04-27 12:14:02,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-27 12:14:02,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-27 12:14:02,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 12:14:02,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1165#true} {1165#true} #60#return; {1165#true} is VALID [2022-04-27 12:14:02,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {1165#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:02,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:02,503 INFO L272 TraceCheckUtils]: 13: Hoare triple {1203#(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)); {1165#true} is VALID [2022-04-27 12:14:02,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-27 12:14:02,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-27 12:14:02,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 12:14:02,505 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1165#true} {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:02,506 INFO L272 TraceCheckUtils]: 18: Hoare triple {1203#(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)); {1165#true} is VALID [2022-04-27 12:14:02,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-27 12:14:02,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-27 12:14:02,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 12:14:02,518 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1165#true} {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:02,519 INFO L272 TraceCheckUtils]: 23: Hoare triple {1203#(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)); {1165#true} is VALID [2022-04-27 12:14:02,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-27 12:14:02,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-27 12:14:02,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 12:14:02,522 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1165#true} {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:02,523 INFO L272 TraceCheckUtils]: 28: Hoare triple {1203#(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)); {1255#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:02,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {1255#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1259#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:02,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {1259#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1166#false} is VALID [2022-04-27 12:14:02,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2022-04-27 12:14:02,524 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:14:02,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:14:02,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:02,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471148497] [2022-04-27 12:14:02,525 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:02,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897469993] [2022-04-27 12:14:02,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897469993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:14:02,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:14:02,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:14:02,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134545610] [2022-04-27 12:14:02,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:14:02,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 12:14:02,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:02,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:14:02,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:02,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:14:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:02,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:14:02,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:14:02,557 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:14:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:02,775 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-27 12:14:02,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:14:02,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 12:14:02,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:14:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 12:14:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:14:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 12:14:02,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 12:14:02,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:02,842 INFO L225 Difference]: With dead ends: 66 [2022-04-27 12:14:02,842 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 12:14:02,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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:14:02,843 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:02,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 135 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:14:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 12:14:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 12:14:02,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:02,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:14:02,869 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:14:02,870 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:14:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:02,874 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-27 12:14:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-27 12:14:02,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:02,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:02,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-27 12:14:02,879 INFO L87 Difference]: Start difference. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-27 12:14:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:02,883 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-27 12:14:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-27 12:14:02,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:02,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:02,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:02,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:14:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-27 12:14:02,888 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-27 12:14:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:02,888 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-27 12:14:02,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:14:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-27 12:14:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 12:14:02,891 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:02,892 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 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:14:02,918 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:14:03,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:03,100 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:03,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:03,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-27 12:14:03,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:03,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302603417] [2022-04-27 12:14:03,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:03,111 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:03,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236909736] [2022-04-27 12:14:03,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:03,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:03,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:03,120 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:14:03,121 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:14:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:03,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:14:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:03,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:03,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-27 12:14:03,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#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); {1560#true} is VALID [2022-04-27 12:14:03,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #84#return; {1560#true} is VALID [2022-04-27 12:14:03,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret5 := main(); {1560#true} is VALID [2022-04-27 12:14:03,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#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; {1560#true} is VALID [2022-04-27 12:14:03,356 INFO L272 TraceCheckUtils]: 6: Hoare triple {1560#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {1560#true} is VALID [2022-04-27 12:14:03,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,357 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1560#true} {1560#true} #60#return; {1560#true} is VALID [2022-04-27 12:14:03,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {1560#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:03,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:03,358 INFO L272 TraceCheckUtils]: 13: Hoare triple {1598#(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)); {1560#true} is VALID [2022-04-27 12:14:03,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,358 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:03,358 INFO L272 TraceCheckUtils]: 18: Hoare triple {1598#(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)); {1560#true} is VALID [2022-04-27 12:14:03,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,359 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:03,359 INFO L272 TraceCheckUtils]: 23: Hoare triple {1598#(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)); {1560#true} is VALID [2022-04-27 12:14:03,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,360 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:03,360 INFO L272 TraceCheckUtils]: 28: Hoare triple {1598#(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)); {1560#true} is VALID [2022-04-27 12:14:03,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,360 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:03,361 INFO L272 TraceCheckUtils]: 33: Hoare triple {1598#(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)); {1560#true} is VALID [2022-04-27 12:14:03,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,361 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:03,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {1598#(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; {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:03,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !false; {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:03,362 INFO L272 TraceCheckUtils]: 40: Hoare triple {1680#(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)); {1560#true} is VALID [2022-04-27 12:14:03,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,363 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1560#true} {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #62#return; {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:03,363 INFO L272 TraceCheckUtils]: 45: Hoare triple {1680#(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)); {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:03,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1706#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:03,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {1706#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1561#false} is VALID [2022-04-27 12:14:03,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-27 12:14:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 12:14:03,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:03,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-27 12:14:03,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {1706#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1561#false} is VALID [2022-04-27 12:14:03,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1706#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:03,540 INFO L272 TraceCheckUtils]: 45: Hoare triple {1722#(= (+ (* 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)); {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:03,540 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1560#true} {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:14:03,540 INFO L290 TraceCheckUtils]: 43: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,540 INFO L290 TraceCheckUtils]: 42: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,541 INFO L272 TraceCheckUtils]: 40: Hoare triple {1722#(= (+ (* 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)); {1560#true} is VALID [2022-04-27 12:14:03,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:14:03,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {1744#(= (+ (* 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; {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:14:03,548 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #70#return; {1744#(= (+ (* 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:14:03,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,549 INFO L272 TraceCheckUtils]: 33: Hoare triple {1744#(= (+ (* 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)); {1560#true} is VALID [2022-04-27 12:14:03,549 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #68#return; {1744#(= (+ (* 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:14:03,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,552 INFO L272 TraceCheckUtils]: 28: Hoare triple {1744#(= (+ (* 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)); {1560#true} is VALID [2022-04-27 12:14:03,553 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #66#return; {1744#(= (+ (* 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:14:03,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,555 INFO L272 TraceCheckUtils]: 23: Hoare triple {1744#(= (+ (* 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)); {1560#true} is VALID [2022-04-27 12:14:03,555 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #64#return; {1744#(= (+ (* 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:14:03,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,555 INFO L272 TraceCheckUtils]: 18: Hoare triple {1744#(= (+ (* 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)); {1560#true} is VALID [2022-04-27 12:14:03,556 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #62#return; {1744#(= (+ (* 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:14:03,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,556 INFO L272 TraceCheckUtils]: 13: Hoare triple {1744#(= (+ (* 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)); {1560#true} is VALID [2022-04-27 12:14:03,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !false; {1744#(= (+ (* 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:14:03,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {1560#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1744#(= (+ (* 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:14:03,557 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1560#true} {1560#true} #60#return; {1560#true} is VALID [2022-04-27 12:14:03,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:14:03,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:14:03,557 INFO L272 TraceCheckUtils]: 6: Hoare triple {1560#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {1560#true} is VALID [2022-04-27 12:14:03,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#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; {1560#true} is VALID [2022-04-27 12:14:03,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret5 := main(); {1560#true} is VALID [2022-04-27 12:14:03,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #84#return; {1560#true} is VALID [2022-04-27 12:14:03,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:14:03,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#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); {1560#true} is VALID [2022-04-27 12:14:03,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-27 12:14:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 12:14:03,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:03,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302603417] [2022-04-27 12:14:03,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:03,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236909736] [2022-04-27 12:14:03,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236909736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:14:03,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:14:03,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:14:03,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951545094] [2022-04-27 12:14:03,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:03,559 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 49 [2022-04-27 12:14:03,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:03,560 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:03,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:03,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:14:03,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:03,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:14:03,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:14:03,600 INFO L87 Difference]: Start difference. First operand 54 states and 65 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:04,959 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-04-27 12:14:04,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:14:04,959 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 49 [2022-04-27 12:14:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:04,960 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-27 12:14:04,962 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-27 12:14:04,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2022-04-27 12:14:05,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:05,056 INFO L225 Difference]: With dead ends: 77 [2022-04-27 12:14:05,056 INFO L226 Difference]: Without dead ends: 75 [2022-04-27 12:14:05,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:14:05,057 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:05,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 131 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:14:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-27 12:14:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2022-04-27 12:14:05,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:05,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:14:05,069 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:14:05,069 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:14:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:05,071 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-04-27 12:14:05,071 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-04-27 12:14:05,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:05,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:05,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 75 states. [2022-04-27 12:14:05,072 INFO L87 Difference]: Start difference. First operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 75 states. [2022-04-27 12:14:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:05,075 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-04-27 12:14:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-04-27 12:14:05,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:05,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:05,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:05,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:14:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-04-27 12:14:05,078 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 49 [2022-04-27 12:14:05,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:05,079 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-04-27 12:14:05,079 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-04-27 12:14:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 12:14:05,080 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:05,080 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:05,110 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:14:05,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:05,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:05,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:05,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 2 times [2022-04-27 12:14:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:05,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049944470] [2022-04-27 12:14:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:05,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:05,307 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:05,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1445320068] [2022-04-27 12:14:05,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:14:05,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:05,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:05,320 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:14:05,321 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:14:05,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:14:05,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:14:05,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:14:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:05,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:05,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2230#true} is VALID [2022-04-27 12:14:05,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#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); {2230#true} is VALID [2022-04-27 12:14:05,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #84#return; {2230#true} is VALID [2022-04-27 12:14:05,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret5 := main(); {2230#true} is VALID [2022-04-27 12:14:05,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {2230#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; {2230#true} is VALID [2022-04-27 12:14:05,591 INFO L272 TraceCheckUtils]: 6: Hoare triple {2230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:14:05,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,592 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2230#true} {2230#true} #60#return; {2230#true} is VALID [2022-04-27 12:14:05,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {2230#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:14:05,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !false; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:14:05,593 INFO L272 TraceCheckUtils]: 13: Hoare triple {2268#(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)); {2230#true} is VALID [2022-04-27 12:14:05,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,594 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #62#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:14:05,594 INFO L272 TraceCheckUtils]: 18: Hoare triple {2268#(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)); {2230#true} is VALID [2022-04-27 12:14:05,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,595 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #64#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:14:05,595 INFO L272 TraceCheckUtils]: 23: Hoare triple {2268#(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)); {2230#true} is VALID [2022-04-27 12:14:05,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,596 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #66#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:14:05,596 INFO L272 TraceCheckUtils]: 28: Hoare triple {2268#(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)); {2230#true} is VALID [2022-04-27 12:14:05,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,599 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #68#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:14:05,599 INFO L272 TraceCheckUtils]: 33: Hoare triple {2268#(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)); {2230#true} is VALID [2022-04-27 12:14:05,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,599 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #70#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:14:05,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {2268#(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; {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:05,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !false; {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:05,600 INFO L272 TraceCheckUtils]: 40: Hoare triple {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:14:05,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,601 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2230#true} {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #62#return; {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:05,601 INFO L272 TraceCheckUtils]: 45: Hoare triple {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2230#true} is VALID [2022-04-27 12:14:05,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,601 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2230#true} {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #64#return; {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:05,602 INFO L272 TraceCheckUtils]: 50: Hoare triple {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:05,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2391#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:05,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {2391#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2231#false} is VALID [2022-04-27 12:14:05,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2022-04-27 12:14:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 12:14:05,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:05,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2022-04-27 12:14:05,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {2391#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2231#false} is VALID [2022-04-27 12:14:05,825 INFO L290 TraceCheckUtils]: 51: Hoare triple {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2391#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:05,825 INFO L272 TraceCheckUtils]: 50: Hoare triple {2407#(= (* 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)); {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:05,826 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2230#true} {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:14:05,826 INFO L290 TraceCheckUtils]: 48: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,826 INFO L272 TraceCheckUtils]: 45: Hoare triple {2407#(= (* 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)); {2230#true} is VALID [2022-04-27 12:14:05,826 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2230#true} {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:14:05,826 INFO L290 TraceCheckUtils]: 43: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,826 INFO L290 TraceCheckUtils]: 42: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,827 INFO L272 TraceCheckUtils]: 40: Hoare triple {2407#(= (* 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)); {2230#true} is VALID [2022-04-27 12:14:05,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:14:05,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {2444#(= (* (+ 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; {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:14:05,829 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:05,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,829 INFO L272 TraceCheckUtils]: 33: Hoare triple {2444#(= (* (+ 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)); {2230#true} is VALID [2022-04-27 12:14:05,830 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:05,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,830 INFO L272 TraceCheckUtils]: 28: Hoare triple {2444#(= (* (+ 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)); {2230#true} is VALID [2022-04-27 12:14:05,830 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:05,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,831 INFO L272 TraceCheckUtils]: 23: Hoare triple {2444#(= (* (+ 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)); {2230#true} is VALID [2022-04-27 12:14:05,831 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:05,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,831 INFO L272 TraceCheckUtils]: 18: Hoare triple {2444#(= (* (+ 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)); {2230#true} is VALID [2022-04-27 12:14:05,832 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:05,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,832 INFO L272 TraceCheckUtils]: 13: Hoare triple {2444#(= (* (+ 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)); {2230#true} is VALID [2022-04-27 12:14:05,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:05,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {2230#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:05,833 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2230#true} {2230#true} #60#return; {2230#true} is VALID [2022-04-27 12:14:05,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:14:05,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:14:05,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {2230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:14:05,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {2230#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; {2230#true} is VALID [2022-04-27 12:14:05,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret5 := main(); {2230#true} is VALID [2022-04-27 12:14:05,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #84#return; {2230#true} is VALID [2022-04-27 12:14:05,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:14:05,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#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); {2230#true} is VALID [2022-04-27 12:14:05,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2230#true} is VALID [2022-04-27 12:14:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 12:14:05,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:05,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049944470] [2022-04-27 12:14:05,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:05,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445320068] [2022-04-27 12:14:05,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445320068] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:14:05,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:14:05,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:14:05,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932428527] [2022-04-27 12:14:05,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:05,835 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 54 [2022-04-27 12:14:05,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:05,835 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:14:05,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:05,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:14:05,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:05,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:14:05,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:14:05,877 INFO L87 Difference]: Start difference. First operand 62 states and 71 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:14:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:06,264 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-27 12:14:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:14:06,264 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 54 [2022-04-27 12:14:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:06,265 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:14:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-27 12:14:06,266 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:14:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-27 12:14:06,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-27 12:14:06,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:06,330 INFO L225 Difference]: With dead ends: 81 [2022-04-27 12:14:06,331 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 12:14:06,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 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:14:06,331 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:06,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 197 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:14:06,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 12:14:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-04-27 12:14:06,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:06,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:14:06,341 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:14:06,341 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:14:06,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:06,344 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-27 12:14:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-27 12:14:06,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:06,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:06,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-27 12:14:06,344 INFO L87 Difference]: Start difference. First operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-27 12:14:06,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:06,346 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-27 12:14:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-27 12:14:06,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:06,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:06,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:06,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:14:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2022-04-27 12:14:06,349 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 54 [2022-04-27 12:14:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:06,349 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2022-04-27 12:14:06,349 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:14:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2022-04-27 12:14:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 12:14:06,350 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:06,350 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:06,369 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:14:06,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:06,564 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:06,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 3 times [2022-04-27 12:14:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:06,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796977549] [2022-04-27 12:14:06,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:06,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:06,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986137355] [2022-04-27 12:14:06,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:14:06,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:06,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:06,575 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:14:06,576 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:14:06,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 12:14:06,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:14:06,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 12:14:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:06,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:06,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2952#true} is VALID [2022-04-27 12:14:06,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#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); {2952#true} is VALID [2022-04-27 12:14:06,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:06,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #84#return; {2952#true} is VALID [2022-04-27 12:14:06,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret5 := main(); {2952#true} is VALID [2022-04-27 12:14:06,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#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; {2952#true} is VALID [2022-04-27 12:14:06,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {2952#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:14:06,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:06,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:06,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:06,898 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2952#true} {2952#true} #60#return; {2952#true} is VALID [2022-04-27 12:14:06,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {2952#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:06,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:06,899 INFO L272 TraceCheckUtils]: 13: Hoare triple {2990#(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)); {2952#true} is VALID [2022-04-27 12:14:06,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:06,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:06,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:06,899 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:06,899 INFO L272 TraceCheckUtils]: 18: Hoare triple {2990#(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)); {2952#true} is VALID [2022-04-27 12:14:06,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:06,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:06,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:06,900 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:06,900 INFO L272 TraceCheckUtils]: 23: Hoare triple {2990#(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)); {2952#true} is VALID [2022-04-27 12:14:06,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:06,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:06,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:06,901 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:06,901 INFO L272 TraceCheckUtils]: 28: Hoare triple {2990#(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)); {2952#true} is VALID [2022-04-27 12:14:06,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:06,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:06,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:06,902 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:06,902 INFO L272 TraceCheckUtils]: 33: Hoare triple {2990#(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)); {2952#true} is VALID [2022-04-27 12:14:06,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:06,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:06,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:06,903 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:06,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {2990#(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; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-27 12:14:06,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} assume !false; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-27 12:14:06,903 INFO L272 TraceCheckUtils]: 40: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:14:06,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:06,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:06,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:06,907 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2952#true} {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} #62#return; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-27 12:14:06,907 INFO L272 TraceCheckUtils]: 45: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2952#true} is VALID [2022-04-27 12:14:06,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:06,907 INFO L290 TraceCheckUtils]: 47: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:06,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:06,908 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2952#true} {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} #64#return; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-27 12:14:06,908 INFO L272 TraceCheckUtils]: 50: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:14:06,908 INFO L290 TraceCheckUtils]: 51: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:06,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:06,908 INFO L290 TraceCheckUtils]: 53: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:06,909 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2952#true} {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} #66#return; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-27 12:14:06,909 INFO L272 TraceCheckUtils]: 55: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= 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)); {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:06,910 INFO L290 TraceCheckUtils]: 56: Hoare triple {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:06,910 INFO L290 TraceCheckUtils]: 57: Hoare triple {3128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2953#false} is VALID [2022-04-27 12:14:06,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-27 12:14:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 12:14:06,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:07,246 INFO L290 TraceCheckUtils]: 58: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-27 12:14:07,246 INFO L290 TraceCheckUtils]: 57: Hoare triple {3128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2953#false} is VALID [2022-04-27 12:14:07,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:07,258 INFO L272 TraceCheckUtils]: 55: Hoare triple {3144#(= (+ (* 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)); {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:07,258 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2952#true} {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {3144#(= (+ (* 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:14:07,258 INFO L290 TraceCheckUtils]: 53: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:07,258 INFO L290 TraceCheckUtils]: 52: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:07,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:07,258 INFO L272 TraceCheckUtils]: 50: Hoare triple {3144#(= (+ (* 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)); {2952#true} is VALID [2022-04-27 12:14:07,260 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2952#true} {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {3144#(= (+ (* 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:14:07,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:07,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:07,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:07,260 INFO L272 TraceCheckUtils]: 45: Hoare triple {3144#(= (+ (* 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)); {2952#true} is VALID [2022-04-27 12:14:07,260 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2952#true} {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {3144#(= (+ (* 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:14:07,260 INFO L290 TraceCheckUtils]: 43: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:07,260 INFO L290 TraceCheckUtils]: 42: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:07,261 INFO L290 TraceCheckUtils]: 41: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:07,261 INFO L272 TraceCheckUtils]: 40: Hoare triple {3144#(= (+ (* 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)); {2952#true} is VALID [2022-04-27 12:14:07,261 INFO L290 TraceCheckUtils]: 39: Hoare triple {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {3144#(= (+ (* 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:14:07,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {3196#(= (+ (* 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; {3144#(= (+ (* 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:14:07,264 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2952#true} {3196#(= (+ (* 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)))} #70#return; {3196#(= (+ (* 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:14:07,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:07,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:07,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:07,265 INFO L272 TraceCheckUtils]: 33: Hoare triple {3196#(= (+ (* 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)); {2952#true} is VALID [2022-04-27 12:14:07,265 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2952#true} {3196#(= (+ (* 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)))} #68#return; {3196#(= (+ (* 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:14:07,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:07,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:07,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:07,266 INFO L272 TraceCheckUtils]: 28: Hoare triple {3196#(= (+ (* 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)); {2952#true} is VALID [2022-04-27 12:14:07,266 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2952#true} {3196#(= (+ (* 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)))} #66#return; {3196#(= (+ (* 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:14:07,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:07,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:07,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:07,266 INFO L272 TraceCheckUtils]: 23: Hoare triple {3196#(= (+ (* 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)); {2952#true} is VALID [2022-04-27 12:14:07,267 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2952#true} {3196#(= (+ (* 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)))} #64#return; {3196#(= (+ (* 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:14:07,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:07,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:07,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:07,267 INFO L272 TraceCheckUtils]: 18: Hoare triple {3196#(= (+ (* 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)); {2952#true} is VALID [2022-04-27 12:14:07,268 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2952#true} {3196#(= (+ (* 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)))} #62#return; {3196#(= (+ (* 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:14:07,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:07,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:07,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:07,268 INFO L272 TraceCheckUtils]: 13: Hoare triple {3196#(= (+ (* 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)); {2952#true} is VALID [2022-04-27 12:14:07,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {3196#(= (+ (* 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 !false; {3196#(= (+ (* 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:14:07,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {2952#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3196#(= (+ (* 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:14:07,269 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2952#true} {2952#true} #60#return; {2952#true} is VALID [2022-04-27 12:14:07,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:07,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:14:07,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:14:07,269 INFO L272 TraceCheckUtils]: 6: Hoare triple {2952#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:14:07,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#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; {2952#true} is VALID [2022-04-27 12:14:07,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret5 := main(); {2952#true} is VALID [2022-04-27 12:14:07,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #84#return; {2952#true} is VALID [2022-04-27 12:14:07,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:14:07,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#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); {2952#true} is VALID [2022-04-27 12:14:07,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2952#true} is VALID [2022-04-27 12:14:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 12:14:07,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:07,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796977549] [2022-04-27 12:14:07,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:07,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986137355] [2022-04-27 12:14:07,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986137355] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:14:07,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:14:07,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:14:07,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287321449] [2022-04-27 12:14:07,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:07,271 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 59 [2022-04-27 12:14:07,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:07,271 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:14:07,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:07,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:14:07,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:07,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:14:07,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:14:07,330 INFO L87 Difference]: Start difference. First operand 70 states and 81 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:14:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:08,893 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-27 12:14:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:14:08,893 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 59 [2022-04-27 12:14:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:08,894 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:14:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-27 12:14:08,896 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:14:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-27 12:14:08,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2022-04-27 12:14:09,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:09,003 INFO L225 Difference]: With dead ends: 93 [2022-04-27 12:14:09,004 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 12:14:09,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:14:09,004 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:09,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 135 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 12:14:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 12:14:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2022-04-27 12:14:09,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:09,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:14:09,022 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:14:09,023 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:14:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:09,025 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-04-27 12:14:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2022-04-27 12:14:09,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:09,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:09,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 85 states. [2022-04-27 12:14:09,026 INFO L87 Difference]: Start difference. First operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 85 states. [2022-04-27 12:14:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:09,028 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-04-27 12:14:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2022-04-27 12:14:09,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:09,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:09,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:09,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:14:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-27 12:14:09,031 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 59 [2022-04-27 12:14:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:09,031 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-27 12:14:09,032 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:14:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-27 12:14:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 12:14:09,033 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:09,033 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:09,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 12:14:09,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:09,247 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 1 times [2022-04-27 12:14:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:09,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101999525] [2022-04-27 12:14:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:09,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:09,257 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:09,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113431410] [2022-04-27 12:14:09,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:09,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:09,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:09,267 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:14:09,268 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:14:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:09,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 12:14:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:09,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:09,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {3742#true} call ULTIMATE.init(); {3742#true} is VALID [2022-04-27 12:14:09,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {3742#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); {3742#true} is VALID [2022-04-27 12:14:09,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3742#true} {3742#true} #84#return; {3742#true} is VALID [2022-04-27 12:14:09,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {3742#true} call #t~ret5 := main(); {3742#true} is VALID [2022-04-27 12:14:09,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {3742#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; {3742#true} is VALID [2022-04-27 12:14:09,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {3742#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {3742#true} is VALID [2022-04-27 12:14:09,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:14:09,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:14:09,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3742#true} {3742#true} #60#return; {3742#true} is VALID [2022-04-27 12:14:09,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {3742#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:09,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:09,813 INFO L272 TraceCheckUtils]: 13: Hoare triple {3780#(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)); {3742#true} is VALID [2022-04-27 12:14:09,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:14:09,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:14:09,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,814 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:09,814 INFO L272 TraceCheckUtils]: 18: Hoare triple {3780#(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)); {3742#true} is VALID [2022-04-27 12:14:09,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:14:09,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:14:09,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,815 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:09,815 INFO L272 TraceCheckUtils]: 23: Hoare triple {3780#(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)); {3742#true} is VALID [2022-04-27 12:14:09,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:14:09,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:14:09,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,816 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:09,816 INFO L272 TraceCheckUtils]: 28: Hoare triple {3780#(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)); {3742#true} is VALID [2022-04-27 12:14:09,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:14:09,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:14:09,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,816 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:09,816 INFO L272 TraceCheckUtils]: 33: Hoare triple {3780#(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)); {3742#true} is VALID [2022-04-27 12:14:09,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:14:09,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:14:09,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,817 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:09,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {3780#(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; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:09,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !false; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:09,818 INFO L272 TraceCheckUtils]: 40: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-27 12:14:09,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:14:09,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:14:09,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,819 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #62#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:09,819 INFO L272 TraceCheckUtils]: 45: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3742#true} is VALID [2022-04-27 12:14:09,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:14:09,819 INFO L290 TraceCheckUtils]: 47: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:14:09,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,820 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #64#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:09,820 INFO L272 TraceCheckUtils]: 50: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-27 12:14:09,820 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:14:09,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:14:09,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,828 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #66#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:09,828 INFO L272 TraceCheckUtils]: 55: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~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)); {3742#true} is VALID [2022-04-27 12:14:09,828 INFO L290 TraceCheckUtils]: 56: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:14:09,828 INFO L290 TraceCheckUtils]: 57: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:14:09,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,829 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #68#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:09,829 INFO L272 TraceCheckUtils]: 60: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~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)); {3742#true} is VALID [2022-04-27 12:14:09,829 INFO L290 TraceCheckUtils]: 61: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:14:09,829 INFO L290 TraceCheckUtils]: 62: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:14:09,829 INFO L290 TraceCheckUtils]: 63: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,830 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #70#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:09,831 INFO L290 TraceCheckUtils]: 65: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-27 12:14:09,831 INFO L272 TraceCheckUtils]: 66: Hoare triple {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-27 12:14:09,831 INFO L290 TraceCheckUtils]: 67: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:14:09,831 INFO L290 TraceCheckUtils]: 68: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:14:09,831 INFO L290 TraceCheckUtils]: 69: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:14:09,831 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3742#true} {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-27 12:14:09,832 INFO L272 TraceCheckUtils]: 71: Hoare triple {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 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)); {3963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:09,833 INFO L290 TraceCheckUtils]: 72: Hoare triple {3963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:09,833 INFO L290 TraceCheckUtils]: 73: Hoare triple {3967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3743#false} is VALID [2022-04-27 12:14:09,833 INFO L290 TraceCheckUtils]: 74: Hoare triple {3743#false} assume !false; {3743#false} is VALID [2022-04-27 12:14:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 12:14:09,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:10,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:10,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101999525] [2022-04-27 12:14:10,220 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:10,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113431410] [2022-04-27 12:14:10,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113431410] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:14:10,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:14:10,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 12:14:10,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86924951] [2022-04-27 12:14:10,220 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:10,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 75 [2022-04-27 12:14:10,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:10,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:14:10,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:10,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:14:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:10,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:14:10,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:14:10,256 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:14:10,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:10,643 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-04-27 12:14:10,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:14:10,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 75 [2022-04-27 12:14:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:14:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-27 12:14:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:14:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-27 12:14:10,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2022-04-27 12:14:10,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:10,703 INFO L225 Difference]: With dead ends: 95 [2022-04-27 12:14:10,703 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 12:14:10,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:14:10,705 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:10,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 162 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:14:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 12:14:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-04-27 12:14:10,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:10,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:14:10,729 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:14:10,729 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:14:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:10,731 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-27 12:14:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-27 12:14:10,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:10,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:10,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 93 states. [2022-04-27 12:14:10,732 INFO L87 Difference]: Start difference. First operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 93 states. [2022-04-27 12:14:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:10,735 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-27 12:14:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-27 12:14:10,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:10,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:10,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:10,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:14:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-04-27 12:14:10,737 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 75 [2022-04-27 12:14:10,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:10,738 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-04-27 12:14:10,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:14:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-04-27 12:14:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-27 12:14:10,738 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:10,738 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:10,762 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:14:10,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:10,951 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:10,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 1 times [2022-04-27 12:14:10,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:10,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251115569] [2022-04-27 12:14:10,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:10,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:10,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:10,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401375195] [2022-04-27 12:14:10,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:10,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:10,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:10,961 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:14:10,962 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:14:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:11,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 12:14:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:11,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:12,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {4552#true} call ULTIMATE.init(); {4552#true} is VALID [2022-04-27 12:14:12,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {4552#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); {4552#true} is VALID [2022-04-27 12:14:12,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:14:12,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4552#true} {4552#true} #84#return; {4552#true} is VALID [2022-04-27 12:14:12,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {4552#true} call #t~ret5 := main(); {4552#true} is VALID [2022-04-27 12:14:12,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {4552#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; {4572#(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)))} is VALID [2022-04-27 12:14:12,901 INFO L272 TraceCheckUtils]: 6: Hoare triple {4572#(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)))} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:14:12,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {4552#true} ~cond := #in~cond; {4579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:14:12,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {4579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:14:12,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {4583#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:14:12,903 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4583#(not (= |assume_abort_if_not_#in~cond| 0))} {4572#(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)))} #60#return; {4590#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:14:12,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {4590#(and (<= 0 main_~a~0) (<= main_~a~0 2))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} is VALID [2022-04-27 12:14:12,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} assume !false; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} is VALID [2022-04-27 12:14:12,903 INFO L272 TraceCheckUtils]: 13: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:14:12,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:14:12,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:14:12,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:14:12,904 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} #62#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} is VALID [2022-04-27 12:14:12,905 INFO L272 TraceCheckUtils]: 18: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4552#true} is VALID [2022-04-27 12:14:12,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:14:12,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:14:12,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:14:12,905 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} #64#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} is VALID [2022-04-27 12:14:12,905 INFO L272 TraceCheckUtils]: 23: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:14:12,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:14:12,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:14:12,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:14:12,906 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} #66#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} is VALID [2022-04-27 12:14:12,906 INFO L272 TraceCheckUtils]: 28: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 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)); {4552#true} is VALID [2022-04-27 12:14:12,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:14:12,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:14:12,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:14:12,911 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} #68#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} is VALID [2022-04-27 12:14:12,911 INFO L272 TraceCheckUtils]: 33: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4552#true} is VALID [2022-04-27 12:14:12,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:14:12,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:14:12,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:14:12,912 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} #70#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 6 main_~z~0))} is VALID [2022-04-27 12:14:12,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 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; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:12,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} assume !false; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:12,913 INFO L272 TraceCheckUtils]: 40: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:14:12,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:14:12,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:14:12,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:14:12,914 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4552#true} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} #62#return; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:12,914 INFO L272 TraceCheckUtils]: 45: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4552#true} is VALID [2022-04-27 12:14:12,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:14:12,914 INFO L290 TraceCheckUtils]: 47: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:14:12,914 INFO L290 TraceCheckUtils]: 48: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:14:12,914 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4552#true} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} #64#return; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:12,914 INFO L272 TraceCheckUtils]: 50: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:14:12,914 INFO L290 TraceCheckUtils]: 51: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:14:12,914 INFO L290 TraceCheckUtils]: 52: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:14:12,914 INFO L290 TraceCheckUtils]: 53: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:14:12,915 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4552#true} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} #66#return; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:12,915 INFO L272 TraceCheckUtils]: 55: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= 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)); {4552#true} is VALID [2022-04-27 12:14:12,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:14:12,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:14:12,915 INFO L290 TraceCheckUtils]: 58: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:14:12,916 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4552#true} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} #68#return; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:12,916 INFO L272 TraceCheckUtils]: 60: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4552#true} is VALID [2022-04-27 12:14:12,916 INFO L290 TraceCheckUtils]: 61: Hoare triple {4552#true} ~cond := #in~cond; {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:12,916 INFO L290 TraceCheckUtils]: 62: Hoare triple {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:12,916 INFO L290 TraceCheckUtils]: 63: Hoare triple {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:12,917 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} #70#return; {4757#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} is VALID [2022-04-27 12:14:12,918 INFO L290 TraceCheckUtils]: 65: Hoare triple {4757#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~a~0 2) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-27 12:14:12,918 INFO L272 TraceCheckUtils]: 66: Hoare triple {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= 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)); {4552#true} is VALID [2022-04-27 12:14:12,918 INFO L290 TraceCheckUtils]: 67: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:14:12,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:14:12,918 INFO L290 TraceCheckUtils]: 69: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:14:12,919 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4552#true} {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-27 12:14:12,919 INFO L272 TraceCheckUtils]: 71: Hoare triple {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= 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)); {4552#true} is VALID [2022-04-27 12:14:12,919 INFO L290 TraceCheckUtils]: 72: Hoare triple {4552#true} ~cond := #in~cond; {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:12,919 INFO L290 TraceCheckUtils]: 73: Hoare triple {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:12,919 INFO L290 TraceCheckUtils]: 74: Hoare triple {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:12,920 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #74#return; {4792#(and (<= 7 main_~y~0) (<= (+ 5 main_~y~0) main_~z~0) (< main_~a~0 1) (= main_~z~0 (+ (* main_~a~0 6) 12)))} is VALID [2022-04-27 12:14:12,922 INFO L272 TraceCheckUtils]: 76: Hoare triple {4792#(and (<= 7 main_~y~0) (<= (+ 5 main_~y~0) main_~z~0) (< main_~a~0 1) (= main_~z~0 (+ (* main_~a~0 6) 12)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {4796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:12,922 INFO L290 TraceCheckUtils]: 77: Hoare triple {4796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:12,922 INFO L290 TraceCheckUtils]: 78: Hoare triple {4800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4553#false} is VALID [2022-04-27 12:14:12,922 INFO L290 TraceCheckUtils]: 79: Hoare triple {4553#false} assume !false; {4553#false} is VALID [2022-04-27 12:14:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 79 proven. 12 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-04-27 12:14:12,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:51,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:51,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251115569] [2022-04-27 12:14:51,463 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:51,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401375195] [2022-04-27 12:14:51,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401375195] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:14:51,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:14:51,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 12:14:51,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363999202] [2022-04-27 12:14:51,463 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:51,463 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 80 [2022-04-27 12:14:51,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:51,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:51,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:51,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:14:51,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:51,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:14:51,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-04-27 12:14:51,506 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:53,141 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-04-27 12:14:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 12:14:53,142 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 80 [2022-04-27 12:14:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-27 12:14:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-27 12:14:53,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-27 12:14:53,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:53,227 INFO L225 Difference]: With dead ends: 103 [2022-04-27 12:14:53,227 INFO L226 Difference]: Without dead ends: 90 [2022-04-27 12:14:53,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2022-04-27 12:14:53,228 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:53,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 119 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 12:14:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-27 12:14:53,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-04-27 12:14:53,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:53,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:53,280 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:53,280 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:53,282 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-27 12:14:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-27 12:14:53,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:53,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:53,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-27 12:14:53,282 INFO L87 Difference]: Start difference. First operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-27 12:14:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:53,284 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-27 12:14:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-27 12:14:53,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:53,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:53,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:53,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-04-27 12:14:53,285 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 80 [2022-04-27 12:14:53,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:53,286 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-04-27 12:14:53,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-27 12:14:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-27 12:14:53,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:53,286 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:53,314 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:14:53,507 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,SelfDestructingSolverStorable9 [2022-04-27 12:14:53,508 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:53,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 4 times [2022-04-27 12:14:53,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:53,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151266440] [2022-04-27 12:14:53,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:53,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:53,531 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:53,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337358147] [2022-04-27 12:14:53,531 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 12:14:53,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:53,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:53,535 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:14:53,536 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:14:53,584 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 12:14:53,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:14:53,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 12:14:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:53,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:54,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {5407#true} call ULTIMATE.init(); {5407#true} is VALID [2022-04-27 12:14:54,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {5407#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); {5407#true} is VALID [2022-04-27 12:14:54,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5407#true} {5407#true} #84#return; {5407#true} is VALID [2022-04-27 12:14:54,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {5407#true} call #t~ret5 := main(); {5407#true} is VALID [2022-04-27 12:14:54,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {5407#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; {5407#true} is VALID [2022-04-27 12:14:54,011 INFO L272 TraceCheckUtils]: 6: Hoare triple {5407#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:54,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,011 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5407#true} {5407#true} #60#return; {5407#true} is VALID [2022-04-27 12:14:54,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {5407#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:54,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:54,012 INFO L272 TraceCheckUtils]: 13: Hoare triple {5445#(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)); {5407#true} is VALID [2022-04-27 12:14:54,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,013 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:54,013 INFO L272 TraceCheckUtils]: 18: Hoare triple {5445#(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)); {5407#true} is VALID [2022-04-27 12:14:54,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,013 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:54,013 INFO L272 TraceCheckUtils]: 23: Hoare triple {5445#(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)); {5407#true} is VALID [2022-04-27 12:14:54,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,015 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:54,015 INFO L272 TraceCheckUtils]: 28: Hoare triple {5445#(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)); {5407#true} is VALID [2022-04-27 12:14:54,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,016 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:54,016 INFO L272 TraceCheckUtils]: 33: Hoare triple {5445#(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)); {5407#true} is VALID [2022-04-27 12:14:54,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,016 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:54,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {5445#(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; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:54,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:54,017 INFO L272 TraceCheckUtils]: 40: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:54,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,018 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #62#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:54,018 INFO L272 TraceCheckUtils]: 45: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:54,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,019 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #64#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:54,019 INFO L272 TraceCheckUtils]: 50: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:54,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,019 INFO L290 TraceCheckUtils]: 52: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,019 INFO L290 TraceCheckUtils]: 53: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,020 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #66#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:54,020 INFO L272 TraceCheckUtils]: 55: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) 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)); {5407#true} is VALID [2022-04-27 12:14:54,020 INFO L290 TraceCheckUtils]: 56: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,020 INFO L290 TraceCheckUtils]: 57: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,020 INFO L290 TraceCheckUtils]: 58: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,020 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #68#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:54,021 INFO L272 TraceCheckUtils]: 60: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:54,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,021 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #70#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:54,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) 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; {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-27 12:14:54,022 INFO L290 TraceCheckUtils]: 66: Hoare triple {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} assume !false; {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-27 12:14:54,022 INFO L272 TraceCheckUtils]: 67: Hoare triple {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:54,022 INFO L290 TraceCheckUtils]: 68: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,022 INFO L290 TraceCheckUtils]: 69: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,023 INFO L290 TraceCheckUtils]: 70: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,023 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5407#true} {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} #62#return; {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-27 12:14:54,023 INFO L272 TraceCheckUtils]: 72: Hoare triple {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:54,023 INFO L290 TraceCheckUtils]: 73: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,023 INFO L290 TraceCheckUtils]: 74: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,023 INFO L290 TraceCheckUtils]: 75: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,024 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {5407#true} {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} #64#return; {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-27 12:14:54,024 INFO L272 TraceCheckUtils]: 77: Hoare triple {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:54,025 INFO L290 TraceCheckUtils]: 78: Hoare triple {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:54,025 INFO L290 TraceCheckUtils]: 79: Hoare triple {5650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5408#false} is VALID [2022-04-27 12:14:54,025 INFO L290 TraceCheckUtils]: 80: Hoare triple {5408#false} assume !false; {5408#false} is VALID [2022-04-27 12:14:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 12:14:54,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:54,302 INFO L290 TraceCheckUtils]: 80: Hoare triple {5408#false} assume !false; {5408#false} is VALID [2022-04-27 12:14:54,302 INFO L290 TraceCheckUtils]: 79: Hoare triple {5650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5408#false} is VALID [2022-04-27 12:14:54,303 INFO L290 TraceCheckUtils]: 78: Hoare triple {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:54,303 INFO L272 TraceCheckUtils]: 77: Hoare triple {5666#(= (* 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)); {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:54,304 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {5407#true} {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:14:54,304 INFO L290 TraceCheckUtils]: 75: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,304 INFO L272 TraceCheckUtils]: 72: Hoare triple {5666#(= (* 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)); {5407#true} is VALID [2022-04-27 12:14:54,304 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5407#true} {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:14:54,304 INFO L290 TraceCheckUtils]: 70: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,304 INFO L290 TraceCheckUtils]: 68: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,304 INFO L272 TraceCheckUtils]: 67: Hoare triple {5666#(= (* 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)); {5407#true} is VALID [2022-04-27 12:14:54,305 INFO L290 TraceCheckUtils]: 66: Hoare triple {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:14:54,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {5703#(= (* (+ 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; {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:14:54,307 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:54,307 INFO L290 TraceCheckUtils]: 63: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,307 INFO L272 TraceCheckUtils]: 60: Hoare triple {5703#(= (* (+ 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)); {5407#true} is VALID [2022-04-27 12:14:54,308 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:54,308 INFO L290 TraceCheckUtils]: 58: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,308 INFO L290 TraceCheckUtils]: 57: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,308 INFO L290 TraceCheckUtils]: 56: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,308 INFO L272 TraceCheckUtils]: 55: Hoare triple {5703#(= (* (+ 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)); {5407#true} is VALID [2022-04-27 12:14:54,308 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:54,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,309 INFO L272 TraceCheckUtils]: 50: Hoare triple {5703#(= (* (+ 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)); {5407#true} is VALID [2022-04-27 12:14:54,309 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:54,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,309 INFO L272 TraceCheckUtils]: 45: Hoare triple {5703#(= (* (+ 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)); {5407#true} is VALID [2022-04-27 12:14:54,310 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:54,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,310 INFO L272 TraceCheckUtils]: 40: Hoare triple {5703#(= (* (+ 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)); {5407#true} is VALID [2022-04-27 12:14:54,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:54,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:54,313 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:54,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,313 INFO L272 TraceCheckUtils]: 33: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:54,314 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:54,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,314 INFO L272 TraceCheckUtils]: 28: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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)); {5407#true} is VALID [2022-04-27 12:14:54,314 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:54,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,315 INFO L272 TraceCheckUtils]: 23: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:54,315 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:54,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,315 INFO L272 TraceCheckUtils]: 18: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:54,316 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:54,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,316 INFO L272 TraceCheckUtils]: 13: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:54,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:54,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {5407#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:54,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5407#true} {5407#true} #60#return; {5407#true} is VALID [2022-04-27 12:14:54,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:54,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:54,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {5407#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:54,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {5407#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; {5407#true} is VALID [2022-04-27 12:14:54,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {5407#true} call #t~ret5 := main(); {5407#true} is VALID [2022-04-27 12:14:54,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5407#true} {5407#true} #84#return; {5407#true} is VALID [2022-04-27 12:14:54,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:54,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {5407#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); {5407#true} is VALID [2022-04-27 12:14:54,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {5407#true} call ULTIMATE.init(); {5407#true} is VALID [2022-04-27 12:14:54,318 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 12:14:54,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:54,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151266440] [2022-04-27 12:14:54,318 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:54,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337358147] [2022-04-27 12:14:54,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337358147] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:14:54,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:14:54,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 12:14:54,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206908387] [2022-04-27 12:14:54,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:54,319 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) Word has length 81 [2022-04-27 12:14:54,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:54,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-27 12:14:54,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:54,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:14:54,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:54,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:14:54,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:14:54,391 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-27 12:14:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:55,592 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2022-04-27 12:14:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:14:55,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) Word has length 81 [2022-04-27 12:14:55,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-27 12:14:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-27 12:14:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-27 12:14:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-27 12:14:55,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-27 12:14:55,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:55,804 INFO L225 Difference]: With dead ends: 106 [2022-04-27 12:14:55,804 INFO L226 Difference]: Without dead ends: 104 [2022-04-27 12:14:55,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:14:55,805 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:55,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 149 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 12:14:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-27 12:14:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2022-04-27 12:14:55,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:55,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:55,893 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:55,894 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:55,895 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-04-27 12:14:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2022-04-27 12:14:55,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:55,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:55,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 104 states. [2022-04-27 12:14:55,896 INFO L87 Difference]: Start difference. First operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 104 states. [2022-04-27 12:14:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:55,898 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-04-27 12:14:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2022-04-27 12:14:55,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:55,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:55,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:55,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-04-27 12:14:55,900 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 81 [2022-04-27 12:14:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:55,900 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-04-27 12:14:55,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-27 12:14:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-04-27 12:14:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-27 12:14:55,900 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:55,901 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:55,936 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:14:56,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:56,112 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 2 times [2022-04-27 12:14:56,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:56,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575374306] [2022-04-27 12:14:56,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:56,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:56,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:56,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1745261409] [2022-04-27 12:14:56,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:14:56,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:56,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:56,127 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:14:56,127 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:14:56,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:14:56,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:14:56,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 12:14:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:56,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:56,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {6409#true} call ULTIMATE.init(); {6409#true} is VALID [2022-04-27 12:14:56,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {6409#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); {6409#true} is VALID [2022-04-27 12:14:56,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6409#true} {6409#true} #84#return; {6409#true} is VALID [2022-04-27 12:14:56,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {6409#true} call #t~ret5 := main(); {6409#true} is VALID [2022-04-27 12:14:56,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {6409#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; {6409#true} is VALID [2022-04-27 12:14:56,753 INFO L272 TraceCheckUtils]: 6: Hoare triple {6409#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:56,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,753 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6409#true} {6409#true} #60#return; {6409#true} is VALID [2022-04-27 12:14:56,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {6409#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:56,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:56,754 INFO L272 TraceCheckUtils]: 13: Hoare triple {6447#(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)); {6409#true} is VALID [2022-04-27 12:14:56,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,754 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:56,754 INFO L272 TraceCheckUtils]: 18: Hoare triple {6447#(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)); {6409#true} is VALID [2022-04-27 12:14:56,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,755 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:56,755 INFO L272 TraceCheckUtils]: 23: Hoare triple {6447#(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)); {6409#true} is VALID [2022-04-27 12:14:56,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,756 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:56,756 INFO L272 TraceCheckUtils]: 28: Hoare triple {6447#(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)); {6409#true} is VALID [2022-04-27 12:14:56,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,756 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:56,756 INFO L272 TraceCheckUtils]: 33: Hoare triple {6447#(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)); {6409#true} is VALID [2022-04-27 12:14:56,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,757 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:56,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {6447#(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; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:56,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !false; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:56,758 INFO L272 TraceCheckUtils]: 40: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:56,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,758 INFO L290 TraceCheckUtils]: 43: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,758 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #62#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:56,758 INFO L272 TraceCheckUtils]: 45: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:56,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,759 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #64#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:56,759 INFO L272 TraceCheckUtils]: 50: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:56,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,759 INFO L290 TraceCheckUtils]: 52: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,759 INFO L290 TraceCheckUtils]: 53: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,760 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #66#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:56,760 INFO L272 TraceCheckUtils]: 55: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) 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)); {6409#true} is VALID [2022-04-27 12:14:56,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,760 INFO L290 TraceCheckUtils]: 57: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,760 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #68#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:56,760 INFO L272 TraceCheckUtils]: 60: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:56,760 INFO L290 TraceCheckUtils]: 61: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,760 INFO L290 TraceCheckUtils]: 62: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,760 INFO L290 TraceCheckUtils]: 63: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,761 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #70#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:56,761 INFO L290 TraceCheckUtils]: 65: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 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; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:56,762 INFO L290 TraceCheckUtils]: 66: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !false; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:56,762 INFO L272 TraceCheckUtils]: 67: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:56,762 INFO L290 TraceCheckUtils]: 68: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,762 INFO L290 TraceCheckUtils]: 69: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,762 INFO L290 TraceCheckUtils]: 70: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,762 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #62#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:56,762 INFO L272 TraceCheckUtils]: 72: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:56,763 INFO L290 TraceCheckUtils]: 73: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,763 INFO L290 TraceCheckUtils]: 74: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,763 INFO L290 TraceCheckUtils]: 75: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,764 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #64#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:56,764 INFO L272 TraceCheckUtils]: 77: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:56,764 INFO L290 TraceCheckUtils]: 78: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,764 INFO L290 TraceCheckUtils]: 79: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,764 INFO L290 TraceCheckUtils]: 80: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,764 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #66#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:56,764 INFO L272 TraceCheckUtils]: 82: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:56,764 INFO L290 TraceCheckUtils]: 83: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,764 INFO L290 TraceCheckUtils]: 84: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,764 INFO L290 TraceCheckUtils]: 85: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,765 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #68#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:56,765 INFO L272 TraceCheckUtils]: 87: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:56,765 INFO L290 TraceCheckUtils]: 88: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,765 INFO L290 TraceCheckUtils]: 89: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,765 INFO L290 TraceCheckUtils]: 90: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,766 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #70#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:56,766 INFO L290 TraceCheckUtils]: 92: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !(~n~0 <= ~a~0); {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-27 12:14:56,766 INFO L272 TraceCheckUtils]: 93: Hoare triple {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:56,766 INFO L290 TraceCheckUtils]: 94: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:56,766 INFO L290 TraceCheckUtils]: 95: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:56,766 INFO L290 TraceCheckUtils]: 96: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:56,767 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {6409#true} {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} #72#return; {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-27 12:14:56,767 INFO L272 TraceCheckUtils]: 98: Hoare triple {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6712#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:56,768 INFO L290 TraceCheckUtils]: 99: Hoare triple {6712#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6716#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:56,768 INFO L290 TraceCheckUtils]: 100: Hoare triple {6716#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6410#false} is VALID [2022-04-27 12:14:56,768 INFO L290 TraceCheckUtils]: 101: Hoare triple {6410#false} assume !false; {6410#false} is VALID [2022-04-27 12:14:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-27 12:14:56,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:57,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:57,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575374306] [2022-04-27 12:14:57,215 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:57,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745261409] [2022-04-27 12:14:57,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745261409] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:14:57,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:14:57,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 12:14:57,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385007372] [2022-04-27 12:14:57,216 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:57,216 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 102 [2022-04-27 12:14:57,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:57,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:14:57,264 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:14:57,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:14:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:57,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:14:57,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:14:57,265 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:14:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:58,059 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-04-27 12:14:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:14:58,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 102 [2022-04-27 12:14:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:14:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-27 12:14:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:14:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-27 12:14:58,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-27 12:14:58,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:58,136 INFO L225 Difference]: With dead ends: 118 [2022-04-27 12:14:58,136 INFO L226 Difference]: Without dead ends: 116 [2022-04-27 12:14:58,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 12:14:58,137 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:58,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 198 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:14:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-27 12:14:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-04-27 12:14:58,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:58,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:14:58,203 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:14:58,203 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:14:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:58,205 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-04-27 12:14:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-04-27 12:14:58,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:58,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:58,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 116 states. [2022-04-27 12:14:58,211 INFO L87 Difference]: Start difference. First operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 116 states. [2022-04-27 12:14:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:58,213 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-04-27 12:14:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-04-27 12:14:58,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:58,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:58,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:58,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:14:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2022-04-27 12:14:58,230 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 102 [2022-04-27 12:14:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:58,236 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2022-04-27 12:14:58,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:14:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2022-04-27 12:14:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-27 12:14:58,237 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:58,237 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:58,257 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:14:58,443 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,SelfDestructingSolverStorable11 [2022-04-27 12:14:58,444 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:58,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 2 times [2022-04-27 12:14:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:58,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696008095] [2022-04-27 12:14:58,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:58,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:58,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [602598279] [2022-04-27 12:14:58,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:14:58,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:58,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:58,455 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:14:58,456 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:14:58,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:14:58,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:14:58,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 12:14:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:58,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:59,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {7413#true} call ULTIMATE.init(); {7413#true} is VALID [2022-04-27 12:14:59,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {7413#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); {7413#true} is VALID [2022-04-27 12:14:59,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7413#true} {7413#true} #84#return; {7413#true} is VALID [2022-04-27 12:14:59,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {7413#true} call #t~ret5 := main(); {7413#true} is VALID [2022-04-27 12:14:59,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {7413#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; {7413#true} is VALID [2022-04-27 12:14:59,018 INFO L272 TraceCheckUtils]: 6: Hoare triple {7413#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:59,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,018 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7413#true} {7413#true} #60#return; {7413#true} is VALID [2022-04-27 12:14:59,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {7413#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:59,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:59,019 INFO L272 TraceCheckUtils]: 13: Hoare triple {7451#(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)); {7413#true} is VALID [2022-04-27 12:14:59,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,019 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:59,019 INFO L272 TraceCheckUtils]: 18: Hoare triple {7451#(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)); {7413#true} is VALID [2022-04-27 12:14:59,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,020 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:59,020 INFO L272 TraceCheckUtils]: 23: Hoare triple {7451#(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)); {7413#true} is VALID [2022-04-27 12:14:59,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,020 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:59,021 INFO L272 TraceCheckUtils]: 28: Hoare triple {7451#(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)); {7413#true} is VALID [2022-04-27 12:14:59,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,021 INFO L290 TraceCheckUtils]: 30: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,021 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:59,021 INFO L272 TraceCheckUtils]: 33: Hoare triple {7451#(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)); {7413#true} is VALID [2022-04-27 12:14:59,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,021 INFO L290 TraceCheckUtils]: 35: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,022 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:59,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {7451#(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; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:59,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} assume !false; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:59,023 INFO L272 TraceCheckUtils]: 40: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:59,023 INFO L290 TraceCheckUtils]: 41: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,023 INFO L290 TraceCheckUtils]: 42: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,023 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #62#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:59,023 INFO L272 TraceCheckUtils]: 45: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:59,023 INFO L290 TraceCheckUtils]: 46: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,023 INFO L290 TraceCheckUtils]: 47: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,023 INFO L290 TraceCheckUtils]: 48: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,024 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #64#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:59,024 INFO L272 TraceCheckUtils]: 50: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:59,024 INFO L290 TraceCheckUtils]: 51: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,025 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #66#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:59,025 INFO L272 TraceCheckUtils]: 55: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ 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)); {7413#true} is VALID [2022-04-27 12:14:59,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,025 INFO L290 TraceCheckUtils]: 58: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,026 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #68#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:59,026 INFO L272 TraceCheckUtils]: 60: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ 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)); {7413#true} is VALID [2022-04-27 12:14:59,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,026 INFO L290 TraceCheckUtils]: 62: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,026 INFO L290 TraceCheckUtils]: 63: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,026 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #70#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:59,027 INFO L290 TraceCheckUtils]: 65: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ 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; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:59,027 INFO L290 TraceCheckUtils]: 66: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} assume !false; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:59,027 INFO L272 TraceCheckUtils]: 67: Hoare triple {7615#(and (<= main_~n~0 2) (= 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)); {7413#true} is VALID [2022-04-27 12:14:59,027 INFO L290 TraceCheckUtils]: 68: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,027 INFO L290 TraceCheckUtils]: 69: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,028 INFO L290 TraceCheckUtils]: 70: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,028 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #62#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:59,028 INFO L272 TraceCheckUtils]: 72: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:59,028 INFO L290 TraceCheckUtils]: 73: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,028 INFO L290 TraceCheckUtils]: 74: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,028 INFO L290 TraceCheckUtils]: 75: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,029 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #64#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:59,029 INFO L272 TraceCheckUtils]: 77: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:59,029 INFO L290 TraceCheckUtils]: 78: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,029 INFO L290 TraceCheckUtils]: 79: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,029 INFO L290 TraceCheckUtils]: 80: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,030 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #66#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:59,030 INFO L272 TraceCheckUtils]: 82: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:59,030 INFO L290 TraceCheckUtils]: 83: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,030 INFO L290 TraceCheckUtils]: 84: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,030 INFO L290 TraceCheckUtils]: 85: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,030 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #68#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:59,031 INFO L272 TraceCheckUtils]: 87: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:59,031 INFO L290 TraceCheckUtils]: 88: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,031 INFO L290 TraceCheckUtils]: 89: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,031 INFO L290 TraceCheckUtils]: 90: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,031 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #70#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:59,032 INFO L290 TraceCheckUtils]: 92: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} assume !(~n~0 <= ~a~0); {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:59,032 INFO L272 TraceCheckUtils]: 93: Hoare triple {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:59,032 INFO L290 TraceCheckUtils]: 94: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,032 INFO L290 TraceCheckUtils]: 95: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,032 INFO L290 TraceCheckUtils]: 96: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,033 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {7413#true} {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} #72#return; {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:59,033 INFO L272 TraceCheckUtils]: 98: Hoare triple {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ 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)); {7413#true} is VALID [2022-04-27 12:14:59,033 INFO L290 TraceCheckUtils]: 99: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:59,033 INFO L290 TraceCheckUtils]: 100: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:59,033 INFO L290 TraceCheckUtils]: 101: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:59,033 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {7413#true} {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} #74#return; {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:59,034 INFO L272 TraceCheckUtils]: 103: Hoare triple {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ 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)); {7731#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:59,035 INFO L290 TraceCheckUtils]: 104: Hoare triple {7731#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7735#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:59,035 INFO L290 TraceCheckUtils]: 105: Hoare triple {7735#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7414#false} is VALID [2022-04-27 12:14:59,035 INFO L290 TraceCheckUtils]: 106: Hoare triple {7414#false} assume !false; {7414#false} is VALID [2022-04-27 12:14:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-27 12:14:59,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:15:06,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:15:06,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696008095] [2022-04-27 12:15:06,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:15:06,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602598279] [2022-04-27 12:15:06,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602598279] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:15:06,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:15:06,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 12:15:06,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421497795] [2022-04-27 12:15:06,153 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:15:06,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-27 12:15:06,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:15:06,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 12:15:06,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:06,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:15:06,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:15:06,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:15:06,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:15:06,238 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 12:15:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:07,020 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2022-04-27 12:15:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:15:07,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-27 12:15:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:15:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 12:15:07,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-27 12:15:07,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 12:15:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-27 12:15:07,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-27 12:15:07,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:07,103 INFO L225 Difference]: With dead ends: 126 [2022-04-27 12:15:07,104 INFO L226 Difference]: Without dead ends: 113 [2022-04-27 12:15:07,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 12:15:07,104 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:15:07,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 207 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:15:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-27 12:15:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-27 12:15:07,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:15:07,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:15:07,185 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:15:07,185 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:15:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:07,188 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-04-27 12:15:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-04-27 12:15:07,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:07,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:07,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 113 states. [2022-04-27 12:15:07,189 INFO L87 Difference]: Start difference. First operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 113 states. [2022-04-27 12:15:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:07,191 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-04-27 12:15:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-04-27 12:15:07,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:07,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:07,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:15:07,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:15:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:15:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2022-04-27 12:15:07,194 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 107 [2022-04-27 12:15:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:15:07,194 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2022-04-27 12:15:07,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 12:15:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-04-27 12:15:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-27 12:15:07,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:15:07,196 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:15:07,224 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:15:07,411 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,SelfDestructingSolverStorable12 [2022-04-27 12:15:07,411 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:15:07,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:15:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 3 times [2022-04-27 12:15:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:15:07,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718767067] [2022-04-27 12:15:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:15:07,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:15:07,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168514413] [2022-04-27 12:15:07,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:15:07,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:07,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:15:07,424 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:15:07,425 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:15:07,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 12:15:07,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:15:07,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 12:15:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:07,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:15:10,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {8447#true} call ULTIMATE.init(); {8447#true} is VALID [2022-04-27 12:15:10,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {8447#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); {8447#true} is VALID [2022-04-27 12:15:10,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8447#true} {8447#true} #84#return; {8447#true} is VALID [2022-04-27 12:15:10,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {8447#true} call #t~ret5 := main(); {8447#true} is VALID [2022-04-27 12:15:10,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {8447#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; {8467#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} is VALID [2022-04-27 12:15:10,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {8467#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {8447#true} ~cond := #in~cond; {8474#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:15:10,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {8474#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8478#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:15:10,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {8478#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8478#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:15:10,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8478#(not (= |assume_abort_if_not_#in~cond| 0))} {8467#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} #60#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,659 INFO L272 TraceCheckUtils]: 13: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,660 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,660 INFO L272 TraceCheckUtils]: 18: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,661 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,661 INFO L272 TraceCheckUtils]: 23: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,661 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,662 INFO L272 TraceCheckUtils]: 28: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~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)); {8447#true} is VALID [2022-04-27 12:15:10,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,662 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,662 INFO L272 TraceCheckUtils]: 33: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,663 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~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; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,664 INFO L290 TraceCheckUtils]: 39: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,664 INFO L272 TraceCheckUtils]: 40: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,664 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,664 INFO L272 TraceCheckUtils]: 45: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,665 INFO L290 TraceCheckUtils]: 48: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,665 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,665 INFO L272 TraceCheckUtils]: 50: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,665 INFO L290 TraceCheckUtils]: 51: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,666 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,666 INFO L272 TraceCheckUtils]: 55: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~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)); {8447#true} is VALID [2022-04-27 12:15:10,666 INFO L290 TraceCheckUtils]: 56: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,666 INFO L290 TraceCheckUtils]: 58: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,666 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,666 INFO L272 TraceCheckUtils]: 60: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,666 INFO L290 TraceCheckUtils]: 61: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,667 INFO L290 TraceCheckUtils]: 62: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,667 INFO L290 TraceCheckUtils]: 63: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,667 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~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; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,668 INFO L290 TraceCheckUtils]: 66: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,668 INFO L272 TraceCheckUtils]: 67: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,668 INFO L290 TraceCheckUtils]: 68: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,668 INFO L290 TraceCheckUtils]: 69: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,668 INFO L290 TraceCheckUtils]: 70: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,669 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,669 INFO L272 TraceCheckUtils]: 72: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,669 INFO L290 TraceCheckUtils]: 73: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,669 INFO L290 TraceCheckUtils]: 74: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,669 INFO L290 TraceCheckUtils]: 75: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,669 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,669 INFO L272 TraceCheckUtils]: 77: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,669 INFO L290 TraceCheckUtils]: 78: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,669 INFO L290 TraceCheckUtils]: 79: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,669 INFO L290 TraceCheckUtils]: 80: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,670 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,670 INFO L272 TraceCheckUtils]: 82: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~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)); {8447#true} is VALID [2022-04-27 12:15:10,670 INFO L290 TraceCheckUtils]: 83: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,670 INFO L290 TraceCheckUtils]: 84: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,670 INFO L290 TraceCheckUtils]: 85: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,670 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,671 INFO L272 TraceCheckUtils]: 87: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,671 INFO L290 TraceCheckUtils]: 88: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,671 INFO L290 TraceCheckUtils]: 89: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,671 INFO L290 TraceCheckUtils]: 90: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,671 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {8447#true} {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {8485#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,672 INFO L290 TraceCheckUtils]: 92: Hoare triple {8485#(and (<= 0 main_~a~0) (<= main_~a~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; {8732#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,672 INFO L290 TraceCheckUtils]: 93: Hoare triple {8732#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {8732#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,673 INFO L272 TraceCheckUtils]: 94: Hoare triple {8732#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,673 INFO L290 TraceCheckUtils]: 95: Hoare triple {8447#true} ~cond := #in~cond; {8742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:10,673 INFO L290 TraceCheckUtils]: 96: Hoare triple {8742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:10,673 INFO L290 TraceCheckUtils]: 97: Hoare triple {8746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:10,674 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {8746#(not (= |__VERIFIER_assert_#in~cond| 0))} {8732#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,674 INFO L272 TraceCheckUtils]: 99: Hoare triple {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,674 INFO L290 TraceCheckUtils]: 100: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,674 INFO L290 TraceCheckUtils]: 101: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,674 INFO L290 TraceCheckUtils]: 102: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,675 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {8447#true} {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,675 INFO L272 TraceCheckUtils]: 104: Hoare triple {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,675 INFO L290 TraceCheckUtils]: 105: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,675 INFO L290 TraceCheckUtils]: 106: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,675 INFO L290 TraceCheckUtils]: 107: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,675 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8447#true} {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,676 INFO L272 TraceCheckUtils]: 109: Hoare triple {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~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)); {8447#true} is VALID [2022-04-27 12:15:10,676 INFO L290 TraceCheckUtils]: 110: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,676 INFO L290 TraceCheckUtils]: 111: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,676 INFO L290 TraceCheckUtils]: 112: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,676 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {8447#true} {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,676 INFO L272 TraceCheckUtils]: 114: Hoare triple {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:10,676 INFO L290 TraceCheckUtils]: 115: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,676 INFO L290 TraceCheckUtils]: 116: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,676 INFO L290 TraceCheckUtils]: 117: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,677 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {8447#true} {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:10,678 INFO L290 TraceCheckUtils]: 119: Hoare triple {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} assume !(~n~0 <= ~a~0); {8817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-27 12:15:10,678 INFO L272 TraceCheckUtils]: 120: Hoare triple {8817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (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)); {8447#true} is VALID [2022-04-27 12:15:10,678 INFO L290 TraceCheckUtils]: 121: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:10,678 INFO L290 TraceCheckUtils]: 122: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:10,678 INFO L290 TraceCheckUtils]: 123: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:10,679 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {8447#true} {8817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #72#return; {8817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-27 12:15:10,682 INFO L272 TraceCheckUtils]: 125: Hoare triple {8817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (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)); {8836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:15:10,682 INFO L290 TraceCheckUtils]: 126: Hoare triple {8836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:10,683 INFO L290 TraceCheckUtils]: 127: Hoare triple {8840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8448#false} is VALID [2022-04-27 12:15:10,683 INFO L290 TraceCheckUtils]: 128: Hoare triple {8448#false} assume !false; {8448#false} is VALID [2022-04-27 12:15:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-04-27 12:15:10,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:15:21,443 INFO L290 TraceCheckUtils]: 128: Hoare triple {8448#false} assume !false; {8448#false} is VALID [2022-04-27 12:15:21,444 INFO L290 TraceCheckUtils]: 127: Hoare triple {8840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8448#false} is VALID [2022-04-27 12:15:21,444 INFO L290 TraceCheckUtils]: 126: Hoare triple {8836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:21,445 INFO L272 TraceCheckUtils]: 125: Hoare triple {8856#(= (* 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)); {8836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:15:21,445 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {8447#true} {8856#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} #72#return; {8856#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-27 12:15:21,445 INFO L290 TraceCheckUtils]: 123: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,445 INFO L290 TraceCheckUtils]: 122: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,445 INFO L290 TraceCheckUtils]: 121: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,445 INFO L272 TraceCheckUtils]: 120: Hoare triple {8856#(= (* 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)); {8447#true} is VALID [2022-04-27 12:15:21,446 INFO L290 TraceCheckUtils]: 119: Hoare triple {8875#(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); {8856#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-27 12:15:21,446 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {8447#true} {8875#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #70#return; {8875#(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:15:21,446 INFO L290 TraceCheckUtils]: 117: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,446 INFO L290 TraceCheckUtils]: 116: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,446 INFO L290 TraceCheckUtils]: 115: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,446 INFO L272 TraceCheckUtils]: 114: Hoare triple {8875#(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)); {8447#true} is VALID [2022-04-27 12:15:21,447 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {8447#true} {8875#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #68#return; {8875#(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:15:21,447 INFO L290 TraceCheckUtils]: 112: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,447 INFO L290 TraceCheckUtils]: 111: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,447 INFO L290 TraceCheckUtils]: 110: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,447 INFO L272 TraceCheckUtils]: 109: Hoare triple {8875#(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)); {8447#true} is VALID [2022-04-27 12:15:21,448 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8447#true} {8875#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #66#return; {8875#(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:15:21,448 INFO L290 TraceCheckUtils]: 107: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,448 INFO L290 TraceCheckUtils]: 106: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,448 INFO L290 TraceCheckUtils]: 105: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,448 INFO L272 TraceCheckUtils]: 104: Hoare triple {8875#(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)); {8447#true} is VALID [2022-04-27 12:15:21,448 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {8447#true} {8875#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #64#return; {8875#(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:15:21,448 INFO L290 TraceCheckUtils]: 102: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,448 INFO L290 TraceCheckUtils]: 101: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,448 INFO L290 TraceCheckUtils]: 100: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,448 INFO L272 TraceCheckUtils]: 99: Hoare triple {8875#(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)); {8447#true} is VALID [2022-04-27 12:15:21,450 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {8746#(not (= |__VERIFIER_assert_#in~cond| 0))} {8939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #62#return; {8875#(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:15:21,450 INFO L290 TraceCheckUtils]: 97: Hoare triple {8746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:21,450 INFO L290 TraceCheckUtils]: 96: Hoare triple {8949#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:21,450 INFO L290 TraceCheckUtils]: 95: Hoare triple {8447#true} ~cond := #in~cond; {8949#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:15:21,451 INFO L272 TraceCheckUtils]: 94: Hoare triple {8939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= 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)); {8447#true} is VALID [2022-04-27 12:15:21,451 INFO L290 TraceCheckUtils]: 93: Hoare triple {8939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !false; {8939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= 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:15:21,453 INFO L290 TraceCheckUtils]: 92: Hoare triple {8447#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; {8939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= 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:15:21,453 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {8447#true} {8447#true} #70#return; {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L290 TraceCheckUtils]: 90: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L290 TraceCheckUtils]: 89: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L290 TraceCheckUtils]: 88: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L272 TraceCheckUtils]: 87: Hoare triple {8447#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8447#true} {8447#true} #68#return; {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L290 TraceCheckUtils]: 85: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L290 TraceCheckUtils]: 84: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L290 TraceCheckUtils]: 83: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L272 TraceCheckUtils]: 82: Hoare triple {8447#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8447#true} {8447#true} #66#return; {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L290 TraceCheckUtils]: 80: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L290 TraceCheckUtils]: 79: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L290 TraceCheckUtils]: 78: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L272 TraceCheckUtils]: 77: Hoare triple {8447#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8447#true} {8447#true} #64#return; {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L290 TraceCheckUtils]: 75: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L290 TraceCheckUtils]: 74: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,453 INFO L290 TraceCheckUtils]: 73: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L272 TraceCheckUtils]: 72: Hoare triple {8447#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8447#true} {8447#true} #62#return; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 70: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 69: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 68: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L272 TraceCheckUtils]: 67: Hoare triple {8447#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 66: Hoare triple {8447#true} assume !false; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 65: Hoare triple {8447#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; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8447#true} {8447#true} #70#return; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 63: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 62: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L272 TraceCheckUtils]: 60: Hoare triple {8447#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8447#true} {8447#true} #68#return; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L272 TraceCheckUtils]: 55: Hoare triple {8447#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8447#true} {8447#true} #66#return; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,454 INFO L290 TraceCheckUtils]: 51: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L272 TraceCheckUtils]: 50: Hoare triple {8447#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8447#true} {8447#true} #64#return; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L290 TraceCheckUtils]: 48: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L290 TraceCheckUtils]: 47: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L290 TraceCheckUtils]: 46: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L272 TraceCheckUtils]: 45: Hoare triple {8447#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8447#true} {8447#true} #62#return; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L290 TraceCheckUtils]: 42: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L272 TraceCheckUtils]: 40: Hoare triple {8447#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {8447#true} assume !false; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {8447#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; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8447#true} {8447#true} #70#return; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L272 TraceCheckUtils]: 33: Hoare triple {8447#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8447#true} {8447#true} #68#return; {8447#true} is VALID [2022-04-27 12:15:21,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L272 TraceCheckUtils]: 28: Hoare triple {8447#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8447#true} {8447#true} #66#return; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L272 TraceCheckUtils]: 23: Hoare triple {8447#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8447#true} {8447#true} #64#return; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L272 TraceCheckUtils]: 18: Hoare triple {8447#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8447#true} {8447#true} #62#return; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L272 TraceCheckUtils]: 13: Hoare triple {8447#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {8447#true} assume !false; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {8447#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8447#true} is VALID [2022-04-27 12:15:21,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8447#true} {8447#true} #60#return; {8447#true} is VALID [2022-04-27 12:15:21,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:15:21,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:15:21,457 INFO L272 TraceCheckUtils]: 6: Hoare triple {8447#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:15:21,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {8447#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; {8447#true} is VALID [2022-04-27 12:15:21,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {8447#true} call #t~ret5 := main(); {8447#true} is VALID [2022-04-27 12:15:21,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8447#true} {8447#true} #84#return; {8447#true} is VALID [2022-04-27 12:15:21,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:15:21,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {8447#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); {8447#true} is VALID [2022-04-27 12:15:21,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {8447#true} call ULTIMATE.init(); {8447#true} is VALID [2022-04-27 12:15:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-04-27 12:15:21,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:15:21,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718767067] [2022-04-27 12:15:21,473 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:15:21,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168514413] [2022-04-27 12:15:21,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168514413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:15:21,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:15:21,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2022-04-27 12:15:21,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205999803] [2022-04-27 12:15:21,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:15:21,474 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 9 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (25), 6 states have call predecessors, (25), 9 states have call successors, (25) Word has length 129 [2022-04-27 12:15:21,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:15:21,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 9 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (25), 6 states have call predecessors, (25), 9 states have call successors, (25) [2022-04-27 12:15:21,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:21,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 12:15:21,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:15:21,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 12:15:21,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-27 12:15:21,544 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 9 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (25), 6 states have call predecessors, (25), 9 states have call successors, (25) [2022-04-27 12:15:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:24,474 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-04-27 12:15:24,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:15:24,475 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 9 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (25), 6 states have call predecessors, (25), 9 states have call successors, (25) Word has length 129 [2022-04-27 12:15:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:15:24,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 9 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (25), 6 states have call predecessors, (25), 9 states have call successors, (25) [2022-04-27 12:15:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-04-27 12:15:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 9 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (25), 6 states have call predecessors, (25), 9 states have call successors, (25) [2022-04-27 12:15:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-04-27 12:15:24,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 52 transitions. [2022-04-27 12:15:24,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:24,546 INFO L225 Difference]: With dead ends: 119 [2022-04-27 12:15:24,546 INFO L226 Difference]: Without dead ends: 115 [2022-04-27 12:15:24,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-04-27 12:15:24,547 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:15:24,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 112 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 12:15:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-27 12:15:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-27 12:15:24,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:15:24,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:15:24,646 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:15:24,646 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:15:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:24,648 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-27 12:15:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-27 12:15:24,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:24,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:24,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 115 states. [2022-04-27 12:15:24,649 INFO L87 Difference]: Start difference. First operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 115 states. [2022-04-27 12:15:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:24,651 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-27 12:15:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-27 12:15:24,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:24,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:24,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:15:24,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:15:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:15:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2022-04-27 12:15:24,654 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 129 [2022-04-27 12:15:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:15:24,655 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2022-04-27 12:15:24,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 9 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (25), 6 states have call predecessors, (25), 9 states have call successors, (25) [2022-04-27 12:15:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-27 12:15:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-27 12:15:24,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:15:24,656 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:15:24,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 12:15:24,877 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,SelfDestructingSolverStorable13 [2022-04-27 12:15:24,877 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:15:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:15:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 3 times [2022-04-27 12:15:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:15:24,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483621739] [2022-04-27 12:15:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:15:24,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:15:24,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781267983] [2022-04-27 12:15:24,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:15:24,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:24,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:15:24,900 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:15:24,901 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:15:25,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 12:15:25,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:15:25,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 12:15:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:25,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:15:28,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {9813#true} call ULTIMATE.init(); {9813#true} is VALID [2022-04-27 12:15:28,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {9813#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); {9813#true} is VALID [2022-04-27 12:15:28,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9813#true} {9813#true} #84#return; {9813#true} is VALID [2022-04-27 12:15:28,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {9813#true} call #t~ret5 := main(); {9813#true} is VALID [2022-04-27 12:15:28,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {9813#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; {9813#true} is VALID [2022-04-27 12:15:28,442 INFO L272 TraceCheckUtils]: 6: Hoare triple {9813#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {9813#true} ~cond := #in~cond; {9839#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:15:28,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {9839#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9843#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:15:28,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {9843#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9843#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:15:28,443 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9843#(not (= |assume_abort_if_not_#in~cond| 0))} {9813#true} #60#return; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,444 INFO L272 TraceCheckUtils]: 13: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,444 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9813#true} {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,444 INFO L272 TraceCheckUtils]: 18: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,445 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9813#true} {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,445 INFO L272 TraceCheckUtils]: 23: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,446 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9813#true} {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,446 INFO L272 TraceCheckUtils]: 28: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~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)); {9813#true} is VALID [2022-04-27 12:15:28,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,446 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9813#true} {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,447 INFO L272 TraceCheckUtils]: 33: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,453 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9813#true} {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~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; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,454 INFO L272 TraceCheckUtils]: 40: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,454 INFO L290 TraceCheckUtils]: 41: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,454 INFO L290 TraceCheckUtils]: 42: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,454 INFO L290 TraceCheckUtils]: 43: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,454 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9813#true} {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,455 INFO L272 TraceCheckUtils]: 45: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,455 INFO L290 TraceCheckUtils]: 46: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,455 INFO L290 TraceCheckUtils]: 47: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,455 INFO L290 TraceCheckUtils]: 48: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,455 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9813#true} {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,455 INFO L272 TraceCheckUtils]: 50: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,455 INFO L290 TraceCheckUtils]: 51: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,455 INFO L290 TraceCheckUtils]: 52: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,455 INFO L290 TraceCheckUtils]: 53: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,456 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9813#true} {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,456 INFO L272 TraceCheckUtils]: 55: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~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)); {9813#true} is VALID [2022-04-27 12:15:28,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,456 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9813#true} {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,457 INFO L272 TraceCheckUtils]: 60: Hoare triple {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {9813#true} ~cond := #in~cond; {10004#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:28,457 INFO L290 TraceCheckUtils]: 62: Hoare triple {10004#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:28,457 INFO L290 TraceCheckUtils]: 63: Hoare triple {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:28,458 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} {9850#(and (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,460 INFO L290 TraceCheckUtils]: 65: Hoare triple {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~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; {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,460 INFO L272 TraceCheckUtils]: 67: Hoare triple {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,461 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9813#true} {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,461 INFO L272 TraceCheckUtils]: 72: Hoare triple {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,461 INFO L290 TraceCheckUtils]: 73: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,461 INFO L290 TraceCheckUtils]: 74: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,461 INFO L290 TraceCheckUtils]: 75: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,462 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9813#true} {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,462 INFO L272 TraceCheckUtils]: 77: Hoare triple {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,462 INFO L290 TraceCheckUtils]: 78: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,462 INFO L290 TraceCheckUtils]: 79: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,462 INFO L290 TraceCheckUtils]: 80: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,462 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9813#true} {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,462 INFO L272 TraceCheckUtils]: 82: Hoare triple {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~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)); {9813#true} is VALID [2022-04-27 12:15:28,462 INFO L290 TraceCheckUtils]: 83: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,462 INFO L290 TraceCheckUtils]: 84: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,463 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9813#true} {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,463 INFO L272 TraceCheckUtils]: 87: Hoare triple {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,463 INFO L290 TraceCheckUtils]: 88: Hoare triple {9813#true} ~cond := #in~cond; {10004#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:28,464 INFO L290 TraceCheckUtils]: 89: Hoare triple {10004#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:28,464 INFO L290 TraceCheckUtils]: 90: Hoare triple {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:28,464 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,466 INFO L290 TraceCheckUtils]: 92: Hoare triple {10015#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~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; {10100#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,466 INFO L290 TraceCheckUtils]: 93: Hoare triple {10100#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 2))} assume !false; {10100#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,466 INFO L272 TraceCheckUtils]: 94: Hoare triple {10100#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,467 INFO L290 TraceCheckUtils]: 95: Hoare triple {9813#true} ~cond := #in~cond; {10004#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:28,467 INFO L290 TraceCheckUtils]: 96: Hoare triple {10004#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:28,467 INFO L290 TraceCheckUtils]: 97: Hoare triple {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:28,468 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} {10100#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 2))} #62#return; {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,468 INFO L272 TraceCheckUtils]: 99: Hoare triple {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,468 INFO L290 TraceCheckUtils]: 100: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,468 INFO L290 TraceCheckUtils]: 101: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,468 INFO L290 TraceCheckUtils]: 102: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,468 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {9813#true} {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #64#return; {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,469 INFO L272 TraceCheckUtils]: 104: Hoare triple {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,469 INFO L290 TraceCheckUtils]: 105: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,469 INFO L290 TraceCheckUtils]: 106: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,469 INFO L290 TraceCheckUtils]: 107: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,469 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9813#true} {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #66#return; {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,469 INFO L272 TraceCheckUtils]: 109: Hoare triple {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~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)); {9813#true} is VALID [2022-04-27 12:15:28,469 INFO L290 TraceCheckUtils]: 110: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,469 INFO L290 TraceCheckUtils]: 111: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,469 INFO L290 TraceCheckUtils]: 112: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,470 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {9813#true} {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #68#return; {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,470 INFO L272 TraceCheckUtils]: 114: Hoare triple {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,470 INFO L290 TraceCheckUtils]: 115: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,470 INFO L290 TraceCheckUtils]: 116: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,470 INFO L290 TraceCheckUtils]: 117: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,470 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {9813#true} {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} #70#return; {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} is VALID [2022-04-27 12:15:28,471 INFO L290 TraceCheckUtils]: 119: Hoare triple {10119#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2))} assume !(~n~0 <= ~a~0); {10183#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} is VALID [2022-04-27 12:15:28,471 INFO L272 TraceCheckUtils]: 120: Hoare triple {10183#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,471 INFO L290 TraceCheckUtils]: 121: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,471 INFO L290 TraceCheckUtils]: 122: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,471 INFO L290 TraceCheckUtils]: 123: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,472 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {9813#true} {10183#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} #72#return; {10183#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} is VALID [2022-04-27 12:15:28,472 INFO L272 TraceCheckUtils]: 125: Hoare triple {10183#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:28,472 INFO L290 TraceCheckUtils]: 126: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:28,472 INFO L290 TraceCheckUtils]: 127: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:28,472 INFO L290 TraceCheckUtils]: 128: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:28,473 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {9813#true} {10183#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} #74#return; {10183#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} is VALID [2022-04-27 12:15:28,483 INFO L272 TraceCheckUtils]: 130: Hoare triple {10183#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 2) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {10217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:15:28,483 INFO L290 TraceCheckUtils]: 131: Hoare triple {10217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:28,484 INFO L290 TraceCheckUtils]: 132: Hoare triple {10221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9814#false} is VALID [2022-04-27 12:15:28,484 INFO L290 TraceCheckUtils]: 133: Hoare triple {9814#false} assume !false; {9814#false} is VALID [2022-04-27 12:15:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 181 proven. 69 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-04-27 12:15:28,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:15:34,410 INFO L290 TraceCheckUtils]: 133: Hoare triple {9814#false} assume !false; {9814#false} is VALID [2022-04-27 12:15:34,410 INFO L290 TraceCheckUtils]: 132: Hoare triple {10221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9814#false} is VALID [2022-04-27 12:15:34,411 INFO L290 TraceCheckUtils]: 131: Hoare triple {10217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:34,411 INFO L272 TraceCheckUtils]: 130: Hoare triple {10237#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {10217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:15:34,412 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {9813#true} {10237#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #74#return; {10237#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-27 12:15:34,412 INFO L290 TraceCheckUtils]: 128: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,412 INFO L290 TraceCheckUtils]: 127: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,412 INFO L290 TraceCheckUtils]: 126: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,412 INFO L272 TraceCheckUtils]: 125: Hoare triple {10237#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,413 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {9813#true} {10237#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #72#return; {10237#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-27 12:15:34,413 INFO L290 TraceCheckUtils]: 123: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,413 INFO L290 TraceCheckUtils]: 122: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,413 INFO L290 TraceCheckUtils]: 121: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,413 INFO L272 TraceCheckUtils]: 120: Hoare triple {10237#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,413 INFO L290 TraceCheckUtils]: 119: Hoare triple {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {10237#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-27 12:15:34,414 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {9813#true} {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #70#return; {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:15:34,414 INFO L290 TraceCheckUtils]: 117: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,414 INFO L290 TraceCheckUtils]: 116: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,414 INFO L290 TraceCheckUtils]: 115: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,414 INFO L272 TraceCheckUtils]: 114: Hoare triple {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,414 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {9813#true} {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #68#return; {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:15:34,414 INFO L290 TraceCheckUtils]: 112: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,414 INFO L290 TraceCheckUtils]: 111: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,414 INFO L290 TraceCheckUtils]: 110: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,415 INFO L272 TraceCheckUtils]: 109: Hoare triple {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 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)); {9813#true} is VALID [2022-04-27 12:15:34,415 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9813#true} {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #66#return; {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:15:34,415 INFO L290 TraceCheckUtils]: 107: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,415 INFO L290 TraceCheckUtils]: 106: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,415 INFO L290 TraceCheckUtils]: 105: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,415 INFO L272 TraceCheckUtils]: 104: Hoare triple {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,416 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {9813#true} {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #64#return; {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:15:34,416 INFO L290 TraceCheckUtils]: 102: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,416 INFO L290 TraceCheckUtils]: 101: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,416 INFO L290 TraceCheckUtils]: 100: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,416 INFO L272 TraceCheckUtils]: 99: Hoare triple {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,416 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} {10335#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #62#return; {10271#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:15:34,417 INFO L290 TraceCheckUtils]: 97: Hoare triple {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:34,417 INFO L290 TraceCheckUtils]: 96: Hoare triple {10345#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:34,417 INFO L290 TraceCheckUtils]: 95: Hoare triple {9813#true} ~cond := #in~cond; {10345#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:15:34,417 INFO L272 TraceCheckUtils]: 94: Hoare triple {10335#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,418 INFO L290 TraceCheckUtils]: 93: Hoare triple {10335#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !false; {10335#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:15:34,420 INFO L290 TraceCheckUtils]: 92: Hoare triple {10355#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (<= (+ (div (+ main_~z~0 (- 6)) 6) 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} 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; {10335#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:15:34,729 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} {9813#true} #70#return; {10355#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (<= (+ (div (+ main_~z~0 (- 6)) 6) 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} is VALID [2022-04-27 12:15:34,729 INFO L290 TraceCheckUtils]: 90: Hoare triple {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:34,729 INFO L290 TraceCheckUtils]: 89: Hoare triple {10345#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10008#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:34,730 INFO L290 TraceCheckUtils]: 88: Hoare triple {9813#true} ~cond := #in~cond; {10345#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:15:34,730 INFO L272 TraceCheckUtils]: 87: Hoare triple {9813#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9813#true} {9813#true} #68#return; {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L290 TraceCheckUtils]: 85: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L290 TraceCheckUtils]: 84: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L290 TraceCheckUtils]: 83: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L272 TraceCheckUtils]: 82: Hoare triple {9813#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9813#true} {9813#true} #66#return; {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L290 TraceCheckUtils]: 80: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L290 TraceCheckUtils]: 79: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L290 TraceCheckUtils]: 78: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L272 TraceCheckUtils]: 77: Hoare triple {9813#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9813#true} {9813#true} #64#return; {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L290 TraceCheckUtils]: 75: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L290 TraceCheckUtils]: 74: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L290 TraceCheckUtils]: 73: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L272 TraceCheckUtils]: 72: Hoare triple {9813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9813#true} {9813#true} #62#return; {9813#true} is VALID [2022-04-27 12:15:34,730 INFO L290 TraceCheckUtils]: 70: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 68: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L272 TraceCheckUtils]: 67: Hoare triple {9813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 66: Hoare triple {9813#true} assume !false; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 65: Hoare triple {9813#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; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9813#true} {9813#true} #70#return; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L272 TraceCheckUtils]: 60: Hoare triple {9813#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9813#true} {9813#true} #68#return; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L272 TraceCheckUtils]: 55: Hoare triple {9813#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9813#true} {9813#true} #66#return; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 53: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 52: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L272 TraceCheckUtils]: 50: Hoare triple {9813#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9813#true} {9813#true} #64#return; {9813#true} is VALID [2022-04-27 12:15:34,731 INFO L290 TraceCheckUtils]: 48: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L272 TraceCheckUtils]: 45: Hoare triple {9813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9813#true} {9813#true} #62#return; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L272 TraceCheckUtils]: 40: Hoare triple {9813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {9813#true} assume !false; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {9813#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; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9813#true} {9813#true} #70#return; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L272 TraceCheckUtils]: 33: Hoare triple {9813#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9813#true} {9813#true} #68#return; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L272 TraceCheckUtils]: 28: Hoare triple {9813#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9813#true} {9813#true} #66#return; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L272 TraceCheckUtils]: 23: Hoare triple {9813#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9813#true} {9813#true} #64#return; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L272 TraceCheckUtils]: 18: Hoare triple {9813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9813#true} {9813#true} #62#return; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L272 TraceCheckUtils]: 13: Hoare triple {9813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {9813#true} assume !false; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {9813#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9813#true} {9813#true} #60#return; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L272 TraceCheckUtils]: 6: Hoare triple {9813#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 2 then 1 else 0)); {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {9813#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; {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {9813#true} call #t~ret5 := main(); {9813#true} is VALID [2022-04-27 12:15:34,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9813#true} {9813#true} #84#return; {9813#true} is VALID [2022-04-27 12:15:34,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-27 12:15:34,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {9813#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); {9813#true} is VALID [2022-04-27 12:15:34,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {9813#true} call ULTIMATE.init(); {9813#true} is VALID [2022-04-27 12:15:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 148 proven. 39 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2022-04-27 12:15:34,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:15:34,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483621739] [2022-04-27 12:15:34,734 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:15:34,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781267983] [2022-04-27 12:15:34,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781267983] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:15:34,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:15:34,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-27 12:15:34,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967782771] [2022-04-27 12:15:34,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:15:34,735 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 9 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 134 [2022-04-27 12:15:34,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:15:34,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 9 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 12:15:35,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:35,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 12:15:35,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:15:35,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 12:15:35,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-27 12:15:35,726 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 9 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 12:15:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:38,427 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-27 12:15:38,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 12:15:38,428 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 9 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 134 [2022-04-27 12:15:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:15:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 9 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 12:15:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-04-27 12:15:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 9 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 12:15:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-04-27 12:15:38,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 50 transitions. [2022-04-27 12:15:38,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:38,492 INFO L225 Difference]: With dead ends: 115 [2022-04-27 12:15:38,492 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 12:15:38,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2022-04-27 12:15:38,493 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:15:38,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 142 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 12:15:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 12:15:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 12:15:38,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:15:38,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:15:38,494 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:15:38,494 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:15:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:38,494 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:15:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:15:38,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:38,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:38,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:15:38,495 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:15:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:38,495 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:15:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:15:38,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:38,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:38,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:15:38,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:15:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:15:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 12:15:38,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2022-04-27 12:15:38,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:15:38,495 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 12:15:38,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 9 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 12:15:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:15:38,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:38,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:15:38,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-27 12:15:38,701 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,SelfDestructingSolverStorable14 [2022-04-27 12:15:38,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 12:15:42,424 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-27 12:15:42,424 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-27 12:15:42,424 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-27 12:15:42,424 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-27 12:15:42,424 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 12:15:42,424 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-27 12:15:42,424 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-27 12:15:42,424 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (<= main_~a~0 2) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) [2022-04-27 12:15:42,424 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) .cse0 (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (<= main_~a~0 2) (<= .cse1 (+ main_~a~0 1)) (< main_~a~0 .cse1))))) [2022-04-27 12:15:42,424 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 22 56) no Hoare annotation was computed. [2022-04-27 12:15:42,424 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) [2022-04-27 12:15:42,425 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) [2022-04-27 12:15:42,425 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) .cse0 (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (<= main_~a~0 2) (<= .cse1 (+ main_~a~0 1)) (< main_~a~0 .cse1))))) [2022-04-27 12:15:42,425 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 22 56) no Hoare annotation was computed. [2022-04-27 12:15:42,425 INFO L899 garLoopResultBuilder]: For program point L38(lines 33 46) no Hoare annotation was computed. [2022-04-27 12:15:42,425 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) [2022-04-27 12:15:42,425 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (<= main_~a~0 2) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) [2022-04-27 12:15:42,425 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (<= main_~a~0 2) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) [2022-04-27 12:15:42,425 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 56) the Hoare annotation is: true [2022-04-27 12:15:42,425 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (* (- 1) main_~a~0))) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ .cse0 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) .cse0) 65536) 1)) (< main_~a~0 0)))) [2022-04-27 12:15:42,425 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-04-27 12:15:42,425 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-04-27 12:15:42,425 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) [2022-04-27 12:15:42,425 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (or (let ((.cse0 (* main_~n~0 main_~n~0)) (.cse1 (* main_~n~0 main_~n~0 main_~n~0)) (.cse2 (div (+ main_~z~0 (- 6)) 6))) (and (= (+ (* 3 .cse0) .cse1 (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0)) (= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) .cse1 (* 6 .cse0) 8)) (<= 0 main_~a~0) (<= main_~a~0 2) (<= .cse2 (+ main_~a~0 1)) (= .cse1 main_~x~0) (< main_~a~0 .cse2))) (and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* main_~n~0 6) 6) main_~z~0) (= main_~z~0 6))) [2022-04-27 12:15:42,425 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) [2022-04-27 12:15:42,425 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 2) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) [2022-04-27 12:15:42,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:15:42,425 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 12:15:42,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:15:42,426 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:15:42,426 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 12:15:42,426 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 12:15:42,426 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:15:42,426 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-27 12:15:42,426 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-27 12:15:42,426 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-27 12:15:42,426 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-27 12:15:42,426 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-27 12:15:42,426 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 12:15:42,432 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1] [2022-04-27 12:15:42,436 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:15:42,438 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:15:42,438 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:15:42,439 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:15:42,440 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:15:42,440 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 12:15:42,440 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:15:42,440 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:15:42,440 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:15:42,440 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:15:42,440 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-27 12:15:42,440 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:15:42,440 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:15:42,440 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:15:42,440 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:15:42,440 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 12:15:42,441 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-27 12:15:42,441 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:15:42,441 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:15:42,441 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 12:15:42,441 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:15:42,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:42,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:42,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:42,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:42,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:42,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:42,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:42,444 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:42,444 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:42,444 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:42,444 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:42,444 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:15:42,444 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:15:42,444 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:15:42,444 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 12:15:42,444 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 12:15:42,444 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:15:42,444 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:15:42,444 INFO L163 areAnnotationChecker]: CFG has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:15:42,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:15:42 BoogieIcfgContainer [2022-04-27 12:15:42,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:15:42,459 INFO L158 Benchmark]: Toolchain (without parser) took 103683.77ms. Allocated memory was 211.8MB in the beginning and 307.2MB in the end (delta: 95.4MB). Free memory was 158.4MB in the beginning and 149.8MB in the end (delta: 8.6MB). Peak memory consumption was 153.3MB. Max. memory is 8.0GB. [2022-04-27 12:15:42,459 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 211.8MB. Free memory was 175.2MB in the beginning and 175.1MB in the end (delta: 74.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:15:42,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.38ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 158.2MB in the beginning and 231.4MB in the end (delta: -73.2MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-27 12:15:42,459 INFO L158 Benchmark]: Boogie Preprocessor took 19.49ms. Allocated memory is still 255.9MB. Free memory was 230.9MB in the beginning and 229.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 12:15:42,459 INFO L158 Benchmark]: RCFGBuilder took 271.21ms. Allocated memory is still 255.9MB. Free memory was 229.8MB in the beginning and 217.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 12:15:42,460 INFO L158 Benchmark]: TraceAbstraction took 103164.25ms. Allocated memory was 255.9MB in the beginning and 307.2MB in the end (delta: 51.4MB). Free memory was 216.7MB in the beginning and 149.8MB in the end (delta: 66.9MB). Peak memory consumption was 167.7MB. Max. memory is 8.0GB. [2022-04-27 12:15:42,460 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.29ms. Allocated memory is still 211.8MB. Free memory was 175.2MB in the beginning and 175.1MB in the end (delta: 74.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.38ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 158.2MB in the beginning and 231.4MB in the end (delta: -73.2MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.49ms. Allocated memory is still 255.9MB. Free memory was 230.9MB in the beginning and 229.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 271.21ms. Allocated memory is still 255.9MB. Free memory was 229.8MB in the beginning and 217.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 103164.25ms. Allocated memory was 255.9MB in the beginning and 307.2MB in the end (delta: 51.4MB). Free memory was 216.7MB in the beginning and 149.8MB in the end (delta: 66.9MB). Peak memory consumption was 167.7MB. 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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 103.1s, OverallIterations: 15, TraceHistogramMax: 23, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 237 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 2064 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1462 mSDsCounter, 368 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2385 IncrementalHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 368 mSolverCounterUnsat, 602 mSDtfsCounter, 2385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1659 GetRequests, 1495 SyntacticMatches, 11 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=12, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 54 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 70 PreInvPairs, 115 NumberOfFragments, 626 HoareAnnotationTreeSize, 70 FomulaSimplifications, 2358 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 19 FomulaSimplificationsInter, 28644 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 76.7s InterpolantComputationTime, 985 NumberOfCodeBlocks, 797 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1470 ConstructedInterpolants, 0 QuantifiedInterpolants, 5554 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1925 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 6543/6798 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((n <= a + 1 && n * 6 + 6 == z) && 0 <= a) && 3 * (n * n) + n * 3 + 1 == y) && a <= 2) && n * n * n == x RESULT: Ultimate proved your program to be correct! [2022-04-27 12:15:42,494 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...