/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_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:13:28,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:13:28,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:13:28,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:13:28,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:13:28,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:13:28,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:13:28,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:13:28,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:13:28,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:13:28,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:13:28,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:13:28,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:13:28,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:13:28,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:13:28,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:13:28,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:13:28,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:13:28,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:13:28,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:13:28,638 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:13:28,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:13:28,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:13:28,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:13:28,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:13:28,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:13:28,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:13:28,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:13:28,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:13:28,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:13:28,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:13:28,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:13:28,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:13:28,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:13:28,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:13:28,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:13:28,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:13:28,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:13:28,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:13:28,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:13:28,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:13:28,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:13:28,653 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-14 15:13:28,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:13:28,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:13:28,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:13:28,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:13:28,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:13:28,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:13:28,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:13:28,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:13:28,677 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:13:28,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:13:28,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:13:28,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:13:28,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:13:28,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:13:28,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:13:28,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:13:28,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:13:28,679 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:13:28,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:13:28,679 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:13:28,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:13:28,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:13:28,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:13:28,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:13:28,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:13:28,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:13:28,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:13:28,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:13:28,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:13:28,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:13:28,680 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:13:28,680 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:13:28,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:13:28,681 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-14 15:13:28,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:13:28,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:13:28,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:13:28,860 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:13:28,860 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:13:28,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound20.c [2022-04-14 15:13:28,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40516cb8/357a891322ed4d908050f9e881a8e5bc/FLAGddcb9f39a [2022-04-14 15:13:29,334 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:13:29,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound20.c [2022-04-14 15:13:29,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40516cb8/357a891322ed4d908050f9e881a8e5bc/FLAGddcb9f39a [2022-04-14 15:13:29,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40516cb8/357a891322ed4d908050f9e881a8e5bc [2022-04-14 15:13:29,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:13:29,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:13:29,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:13:29,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:13:29,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:13:29,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:13:29" (1/1) ... [2022-04-14 15:13:29,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534241f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:13:29, skipping insertion in model container [2022-04-14 15:13:29,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:13:29" (1/1) ... [2022-04-14 15:13:29,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:13:29,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:13:29,552 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_valuebound20.c[588,601] [2022-04-14 15:13:29,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:13:29,589 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:13:29,600 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_valuebound20.c[588,601] [2022-04-14 15:13:29,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:13:29,630 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:13:29,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:13:29 WrapperNode [2022-04-14 15:13:29,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:13:29,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:13:29,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:13:29,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:13:29,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:13:29" (1/1) ... [2022-04-14 15:13:29,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:13:29" (1/1) ... [2022-04-14 15:13:29,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:13:29" (1/1) ... [2022-04-14 15:13:29,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:13:29" (1/1) ... [2022-04-14 15:13:29,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:13:29" (1/1) ... [2022-04-14 15:13:29,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:13:29" (1/1) ... [2022-04-14 15:13:29,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:13:29" (1/1) ... [2022-04-14 15:13:29,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:13:29,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:13:29,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:13:29,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:13:29,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:13:29" (1/1) ... [2022-04-14 15:13:29,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:13:29,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:29,698 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-14 15:13:29,719 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-14 15:13:29,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:13:29,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:13:29,734 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:13:29,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:13:29,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:13:29,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:13:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:13:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:13:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:13:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:13:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-14 15:13:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:13:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:13:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:13:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:13:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:13:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:13:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:13:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:13:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:13:29,781 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:13:29,783 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:13:29,884 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:13:29,889 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:13:29,889 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 15:13:29,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:13:29 BoogieIcfgContainer [2022-04-14 15:13:29,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:13:29,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:13:29,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:13:29,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:13:29,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:13:29" (1/3) ... [2022-04-14 15:13:29,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6527eba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:13:29, skipping insertion in model container [2022-04-14 15:13:29,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:13:29" (2/3) ... [2022-04-14 15:13:29,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6527eba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:13:29, skipping insertion in model container [2022-04-14 15:13:29,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:13:29" (3/3) ... [2022-04-14 15:13:29,895 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound20.c [2022-04-14 15:13:29,898 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:13:29,898 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:13:29,924 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:13:29,928 INFO L340 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 [2022-04-14 15:13:29,928 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:13:29,940 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-14 15:13:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 15:13:29,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:29,943 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:13:29,944 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-14 15:13:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:29,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059736947] [2022-04-14 15:13:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:29,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:13:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:30,118 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-14 15:13:30,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-14 15:13:30,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-14 15:13:30,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:13:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:30,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-14 15:13:30,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-14 15:13:30,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-14 15:13:30,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-14 15:13:30,127 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-14 15:13:30,127 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-14 15:13:30,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-14 15:13:30,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-14 15:13:30,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-14 15:13:30,127 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-14 15:13:30,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {39#true} is VALID [2022-04-14 15:13:30,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-14 15:13:30,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-14 15:13:30,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-14 15:13:30,128 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-14 15:13:30,129 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-14 15:13:30,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-14 15:13:30,129 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-14 15:13:30,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-14 15:13:30,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-14 15:13:30,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-14 15:13:30,130 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-14 15:13:30,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:13:30,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059736947] [2022-04-14 15:13:30,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059736947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:13:30,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:13:30,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:13:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533216302] [2022-04-14 15:13:30,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:13:30,135 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-14 15:13:30,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:13:30,138 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-14 15:13:30,156 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-14 15:13:30,156 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:13:30,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:13:30,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:13:30,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:13:30,170 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-14 15:13:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:30,330 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-14 15:13:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:13:30,330 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-14 15:13:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:13:30,331 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-14 15:13:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-14 15:13:30,338 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-14 15:13:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-14 15:13:30,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-14 15:13:30,445 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-14 15:13:30,455 INFO L225 Difference]: With dead ends: 63 [2022-04-14 15:13:30,456 INFO L226 Difference]: Without dead ends: 31 [2022-04-14 15:13:30,458 INFO L912 BasicCegarLoop]: 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-14 15:13:30,460 INFO L913 BasicCegarLoop]: 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-14 15:13:30,460 INFO L914 BasicCegarLoop]: 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-14 15:13:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-14 15:13:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-14 15:13:30,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:30,480 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-14 15:13:30,481 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-14 15:13:30,481 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-14 15:13:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:30,485 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-14 15:13:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-14 15:13:30,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:30,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:30,486 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-14 15:13:30,486 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-14 15:13:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:30,489 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-14 15:13:30,489 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-14 15:13:30,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:30,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:30,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:30,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:30,490 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-14 15:13:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-14 15:13:30,493 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-14 15:13:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:30,493 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-14 15:13:30,494 INFO L479 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-14 15:13:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-14 15:13:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 15:13:30,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:30,494 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:13:30,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:13:30,494 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-14 15:13:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:30,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161213418] [2022-04-14 15:13:30,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:30,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:30,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:13:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:30,636 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-14 15:13:30,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-14 15:13:30,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {258#true} {258#true} #84#return; {258#true} is VALID [2022-04-14 15:13:30,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:13:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:30,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#true} ~cond := #in~cond; {258#true} is VALID [2022-04-14 15:13:30,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} assume !(0 == ~cond); {258#true} is VALID [2022-04-14 15:13:30,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-14 15:13:30,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #60#return; {258#true} is VALID [2022-04-14 15:13:30,646 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-14 15:13:30,646 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-14 15:13:30,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-14 15:13:30,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #84#return; {258#true} is VALID [2022-04-14 15:13:30,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret5 := main(); {258#true} is VALID [2022-04-14 15:13:30,646 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-14 15:13:30,646 INFO L272 TraceCheckUtils]: 6: Hoare triple {258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {258#true} is VALID [2022-04-14 15:13:30,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {258#true} ~cond := #in~cond; {258#true} is VALID [2022-04-14 15:13:30,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#true} assume !(0 == ~cond); {258#true} is VALID [2022-04-14 15:13:30,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-14 15:13:30,647 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {258#true} {258#true} #60#return; {258#true} is VALID [2022-04-14 15:13:30,647 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-14 15:13:30,648 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-14 15:13:30,648 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-14 15:13:30,649 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-14 15:13:30,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {259#false} is VALID [2022-04-14 15:13:30,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#false} assume !false; {259#false} is VALID [2022-04-14 15:13:30,650 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-14 15:13:30,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:13:30,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161213418] [2022-04-14 15:13:30,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161213418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:13:30,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:13:30,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 15:13:30,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837447459] [2022-04-14 15:13:30,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:13:30,653 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-14 15:13:30,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:13:30,653 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-14 15:13:30,664 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-14 15:13:30,664 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 15:13:30,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:13:30,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 15:13:30,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:13:30,666 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-14 15:13:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:31,029 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-14 15:13:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:13:31,029 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-14 15:13:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:13:31,031 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-14 15:13:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-14 15:13:31,033 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-14 15:13:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-14 15:13:31,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-14 15:13:31,093 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-14 15:13:31,094 INFO L225 Difference]: With dead ends: 37 [2022-04-14 15:13:31,094 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 15:13:31,094 INFO L912 BasicCegarLoop]: 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-14 15:13:31,095 INFO L913 BasicCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:13:31,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:13:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 15:13:31,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-14 15:13:31,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:31,100 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-14 15:13:31,101 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-14 15:13:31,101 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-14 15:13:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:31,103 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-14 15:13:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-14 15:13:31,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:31,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:31,104 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-14 15:13:31,105 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-14 15:13:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:31,106 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-14 15:13:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-14 15:13:31,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:31,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:31,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:31,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:31,108 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-14 15:13:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-14 15:13:31,109 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-14 15:13:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:31,109 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-14 15:13:31,110 INFO L479 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-14 15:13:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-14 15:13:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 15:13:31,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:31,110 INFO L499 BasicCegarLoop]: 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-14 15:13:31,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 15:13:31,110 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:31,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-14 15:13:31,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:31,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289617005] [2022-04-14 15:13:31,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:31,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:31,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:13:31,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1147196466] [2022-04-14 15:13:31,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:31,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:31,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:31,149 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-14 15:13:31,181 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-14 15:13:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:31,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:13:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:31,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:13:31,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2022-04-14 15:13:31,316 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-14 15:13:31,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-14 15:13:31,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {463#true} {463#true} #84#return; {463#true} is VALID [2022-04-14 15:13:31,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {463#true} call #t~ret5 := main(); {463#true} is VALID [2022-04-14 15:13:31,316 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-14 15:13:31,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {463#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {463#true} is VALID [2022-04-14 15:13:31,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#true} ~cond := #in~cond; {463#true} is VALID [2022-04-14 15:13:31,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#true} assume !(0 == ~cond); {463#true} is VALID [2022-04-14 15:13:31,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-14 15:13:31,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {463#true} {463#true} #60#return; {463#true} is VALID [2022-04-14 15:13:31,318 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-14 15:13:31,318 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-14 15:13:31,318 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-14 15:13:31,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {463#true} ~cond := #in~cond; {463#true} is VALID [2022-04-14 15:13:31,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {463#true} assume !(0 == ~cond); {463#true} is VALID [2022-04-14 15:13:31,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-14 15:13:31,319 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-14 15:13:31,320 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-14 15:13:31,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:31,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {464#false} is VALID [2022-04-14 15:13:31,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#false} assume !false; {464#false} is VALID [2022-04-14 15:13:31,321 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-14 15:13:31,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:13:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:13:31,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289617005] [2022-04-14 15:13:31,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:13:31,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147196466] [2022-04-14 15:13:31,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147196466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:13:31,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:13:31,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:13:31,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313072627] [2022-04-14 15:13:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:13:31,322 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-14 15:13:31,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:13:31,323 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-14 15:13:31,336 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-14 15:13:31,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:13:31,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:13:31,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:13:31,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:13:31,337 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-14 15:13:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:31,640 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-14 15:13:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:13:31,641 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-14 15:13:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:13:31,641 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-14 15:13:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-14 15:13:31,643 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-14 15:13:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-14 15:13:31,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-14 15:13:31,708 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-14 15:13:31,710 INFO L225 Difference]: With dead ends: 54 [2022-04-14 15:13:31,710 INFO L226 Difference]: Without dead ends: 52 [2022-04-14 15:13:31,710 INFO L912 BasicCegarLoop]: 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-14 15:13:31,711 INFO L913 BasicCegarLoop]: 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-14 15:13:31,711 INFO L914 BasicCegarLoop]: 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-14 15:13:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-14 15:13:31,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-14 15:13:31,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:31,718 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-14 15:13:31,718 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-14 15:13:31,718 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-14 15:13:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:31,721 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 15:13:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-14 15:13:31,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:31,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:31,723 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-14 15:13:31,723 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-14 15:13:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:31,725 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 15:13:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-14 15:13:31,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:31,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:31,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:31,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:31,737 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-14 15:13:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-14 15:13:31,738 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-14 15:13:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:31,739 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-14 15:13:31,739 INFO L479 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-14 15:13:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-14 15:13:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 15:13:31,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:31,739 INFO L499 BasicCegarLoop]: 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-14 15:13:31,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-14 15:13:31,940 WARN L460 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-14 15:13:31,940 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:31,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:31,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-14 15:13:31,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:31,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303048269] [2022-04-14 15:13:31,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:31,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:13:31,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063940837] [2022-04-14 15:13:31,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:31,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:31,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:31,960 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-14 15:13:31,975 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-14 15:13:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:32,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:13:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:32,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:13:32,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {792#true} call ULTIMATE.init(); {792#true} is VALID [2022-04-14 15:13:32,128 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-14 15:13:32,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-14 15:13:32,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {792#true} {792#true} #84#return; {792#true} is VALID [2022-04-14 15:13:32,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {792#true} call #t~ret5 := main(); {792#true} is VALID [2022-04-14 15:13:32,128 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-14 15:13:32,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {792#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {792#true} is VALID [2022-04-14 15:13:32,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {792#true} ~cond := #in~cond; {792#true} is VALID [2022-04-14 15:13:32,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {792#true} assume !(0 == ~cond); {792#true} is VALID [2022-04-14 15:13:32,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-14 15:13:32,129 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {792#true} {792#true} #60#return; {792#true} is VALID [2022-04-14 15:13:32,133 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-14 15:13:32,133 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-14 15:13:32,133 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-14 15:13:32,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {792#true} ~cond := #in~cond; {792#true} is VALID [2022-04-14 15:13:32,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {792#true} assume !(0 == ~cond); {792#true} is VALID [2022-04-14 15:13:32,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-14 15:13:32,134 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-14 15:13:32,134 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-14 15:13:32,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {792#true} ~cond := #in~cond; {792#true} is VALID [2022-04-14 15:13:32,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {792#true} assume !(0 == ~cond); {792#true} is VALID [2022-04-14 15:13:32,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-14 15:13:32,135 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-14 15:13:32,136 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-14 15:13:32,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:32,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {793#false} is VALID [2022-04-14 15:13:32,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {793#false} assume !false; {793#false} is VALID [2022-04-14 15:13:32,137 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-14 15:13:32,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:13:32,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:13:32,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303048269] [2022-04-14 15:13:32,137 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:13:32,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063940837] [2022-04-14 15:13:32,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063940837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:13:32,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:13:32,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:13:32,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435236164] [2022-04-14 15:13:32,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:13:32,138 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-14 15:13:32,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:13:32,138 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-14 15:13:32,158 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-14 15:13:32,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:13:32,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:13:32,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:13:32,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:13:32,159 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-14 15:13:32,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:32,318 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-14 15:13:32,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:13:32,319 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-14 15:13:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:13:32,320 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-14 15:13:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-14 15:13:32,322 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-14 15:13:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-14 15:13:32,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-14 15:13:32,370 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-14 15:13:32,373 INFO L225 Difference]: With dead ends: 58 [2022-04-14 15:13:32,373 INFO L226 Difference]: Without dead ends: 56 [2022-04-14 15:13:32,373 INFO L912 BasicCegarLoop]: 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-14 15:13:32,375 INFO L913 BasicCegarLoop]: 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-14 15:13:32,377 INFO L914 BasicCegarLoop]: 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-14 15:13:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-14 15:13:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-14 15:13:32,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:32,390 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-14 15:13:32,390 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-14 15:13:32,392 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-14 15:13:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:32,395 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-14 15:13:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-14 15:13:32,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:32,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:32,397 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-14 15:13:32,398 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-14 15:13:32,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:32,402 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-14 15:13:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-14 15:13:32,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:32,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:32,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:32,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:32,404 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-14 15:13:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-14 15:13:32,407 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-14 15:13:32,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:32,407 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-14 15:13:32,407 INFO L479 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-14 15:13:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-14 15:13:32,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 15:13:32,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:32,408 INFO L499 BasicCegarLoop]: 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-14 15:13:32,431 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-14 15:13:32,624 WARN L460 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-14 15:13:32,624 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:32,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:32,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-14 15:13:32,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:32,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791584412] [2022-04-14 15:13:32,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:32,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:32,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:13:32,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498928042] [2022-04-14 15:13:32,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:32,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:32,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:32,638 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-14 15:13:32,639 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-14 15:13:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:32,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:13:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:32,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:13:32,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {1165#true} call ULTIMATE.init(); {1165#true} is VALID [2022-04-14 15:13:32,774 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-14 15:13:32,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-14 15:13:32,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} #84#return; {1165#true} is VALID [2022-04-14 15:13:32,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {1165#true} call #t~ret5 := main(); {1165#true} is VALID [2022-04-14 15:13:32,775 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-14 15:13:32,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {1165#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1165#true} is VALID [2022-04-14 15:13:32,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-14 15:13:32,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-14 15:13:32,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-14 15:13:32,776 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1165#true} {1165#true} #60#return; {1165#true} is VALID [2022-04-14 15:13:32,776 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-14 15:13:32,776 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-14 15:13:32,776 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-14 15:13:32,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-14 15:13:32,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-14 15:13:32,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-14 15:13:32,777 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-14 15:13:32,778 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-14 15:13:32,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-14 15:13:32,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-14 15:13:32,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-14 15:13:32,778 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-14 15:13:32,778 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-14 15:13:32,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-14 15:13:32,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-14 15:13:32,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-14 15:13:32,779 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-14 15:13:32,780 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-14 15:13:32,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {1255#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1259#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:32,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {1259#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1166#false} is VALID [2022-04-14 15:13:32,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2022-04-14 15:13:32,781 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-14 15:13:32,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:13:32,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:13:32,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791584412] [2022-04-14 15:13:32,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:13:32,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498928042] [2022-04-14 15:13:32,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498928042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:13:32,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:13:32,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:13:32,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406585768] [2022-04-14 15:13:32,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:13:32,782 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-14 15:13:32,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:13:32,782 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-14 15:13:32,805 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-14 15:13:32,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:13:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:13:32,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:13:32,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:13:32,806 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-14 15:13:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:33,015 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-14 15:13:33,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:13:33,015 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-14 15:13:33,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:13:33,016 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-14 15:13:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-14 15:13:33,017 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-14 15:13:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-14 15:13:33,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-14 15:13:33,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-14 15:13:33,071 INFO L225 Difference]: With dead ends: 66 [2022-04-14 15:13:33,071 INFO L226 Difference]: Without dead ends: 54 [2022-04-14 15:13:33,072 INFO L912 BasicCegarLoop]: 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-14 15:13:33,072 INFO L913 BasicCegarLoop]: 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-14 15:13:33,072 INFO L914 BasicCegarLoop]: 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-14 15:13:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-14 15:13:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-14 15:13:33,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:33,079 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-14 15:13:33,079 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-14 15:13:33,080 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-14 15:13:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:33,081 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-14 15:13:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-14 15:13:33,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:33,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:33,082 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-14 15:13:33,082 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-14 15:13:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:33,084 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-14 15:13:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-14 15:13:33,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:33,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:33,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:33,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:33,085 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-14 15:13:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-14 15:13:33,087 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-14 15:13:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:33,087 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-14 15:13:33,087 INFO L479 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-14 15:13:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-14 15:13:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-14 15:13:33,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:33,088 INFO L499 BasicCegarLoop]: 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-14 15:13:33,125 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-14 15:13:33,304 WARN L460 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-14 15:13:33,304 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:33,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-14 15:13:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:33,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416093381] [2022-04-14 15:13:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:33,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:33,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:13:33,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296962449] [2022-04-14 15:13:33,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:33,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:33,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:33,316 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-14 15:13:33,317 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-14 15:13:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:33,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:13:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:33,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:13:33,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-14 15:13:33,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-14 15:13:33,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #84#return; {1560#true} is VALID [2022-04-14 15:13:33,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret5 := main(); {1560#true} is VALID [2022-04-14 15:13:33,558 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-14 15:13:33,559 INFO L272 TraceCheckUtils]: 6: Hoare triple {1560#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1560#true} is VALID [2022-04-14 15:13:33,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,559 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1560#true} {1560#true} #60#return; {1560#true} is VALID [2022-04-14 15:13:33,559 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-14 15:13:33,560 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-14 15:13:33,560 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-14 15:13:33,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,561 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-14 15:13:33,561 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-14 15:13:33,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,580 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-14 15:13:33,580 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-14 15:13:33,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,581 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-14 15:13:33,581 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-14 15:13:33,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,582 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-14 15:13:33,582 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-14 15:13:33,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,583 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-14 15:13:33,584 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-14 15:13:33,584 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-14 15:13:33,584 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-14 15:13:33,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,584 INFO L290 TraceCheckUtils]: 42: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,585 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-14 15:13:33,586 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-14 15:13:33,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1706#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:33,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {1706#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1561#false} is VALID [2022-04-14 15:13:33,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-14 15:13:33,587 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-14 15:13:33,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:13:33,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-14 15:13:33,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {1706#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1561#false} is VALID [2022-04-14 15:13:33,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1706#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:33,747 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-14 15:13:33,748 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-14 15:13:33,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,748 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-14 15:13:33,748 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-14 15:13:33,752 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-14 15:13:33,752 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-14 15:13:33,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,753 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-14 15:13:33,753 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-14 15:13:33,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,753 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-14 15:13:33,754 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-14 15:13:33,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,754 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-14 15:13:33,755 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-14 15:13:33,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,755 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-14 15:13:33,756 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-14 15:13:33,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,756 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-14 15:13:33,756 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-14 15:13:33,757 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-14 15:13:33,757 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1560#true} {1560#true} #60#return; {1560#true} is VALID [2022-04-14 15:13:33,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-14 15:13:33,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-14 15:13:33,757 INFO L272 TraceCheckUtils]: 6: Hoare triple {1560#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1560#true} is VALID [2022-04-14 15:13:33,757 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-14 15:13:33,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret5 := main(); {1560#true} is VALID [2022-04-14 15:13:33,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #84#return; {1560#true} is VALID [2022-04-14 15:13:33,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-14 15:13:33,758 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-14 15:13:33,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-14 15:13:33,758 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-14 15:13:33,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:13:33,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416093381] [2022-04-14 15:13:33,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:13:33,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296962449] [2022-04-14 15:13:33,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296962449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:13:33,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:13:33,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:13:33,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582413253] [2022-04-14 15:13:33,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:13:33,759 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-14 15:13:33,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:13:33,760 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-14 15:13:33,799 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-14 15:13:33,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:13:33,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:13:33,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:13:33,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:13:33,800 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-14 15:13:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:34,673 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-04-14 15:13:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:13:34,673 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-14 15:13:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:13:34,673 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-14 15:13:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-14 15:13:34,675 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-14 15:13:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-14 15:13:34,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2022-04-14 15:13:34,756 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-14 15:13:34,758 INFO L225 Difference]: With dead ends: 77 [2022-04-14 15:13:34,758 INFO L226 Difference]: Without dead ends: 75 [2022-04-14 15:13:34,758 INFO L912 BasicCegarLoop]: 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-14 15:13:34,759 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-14 15:13:34,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 131 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-14 15:13:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-14 15:13:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2022-04-14 15:13:34,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:34,782 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-14 15:13:34,782 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-14 15:13:34,782 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-14 15:13:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:34,784 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-04-14 15:13:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-04-14 15:13:34,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:34,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:34,785 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-14 15:13:34,785 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-14 15:13:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:34,787 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-04-14 15:13:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-04-14 15:13:34,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:34,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:34,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:34,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:34,788 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-14 15:13:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-04-14 15:13:34,789 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 49 [2022-04-14 15:13:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:34,789 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-04-14 15:13:34,790 INFO L479 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-14 15:13:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-04-14 15:13:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-14 15:13:34,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:34,790 INFO L499 BasicCegarLoop]: 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-14 15:13:34,820 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-14 15:13:35,018 WARN L460 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-14 15:13:35,019 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:35,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 2 times [2022-04-14 15:13:35,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:35,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332753255] [2022-04-14 15:13:35,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:35,036 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:13:35,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1139900999] [2022-04-14 15:13:35,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:13:35,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:35,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:35,037 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-14 15:13:35,051 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-14 15:13:35,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:13:35,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:13:35,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:13:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:35,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:13:35,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2230#true} is VALID [2022-04-14 15:13:35,263 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-14 15:13:35,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #84#return; {2230#true} is VALID [2022-04-14 15:13:35,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret5 := main(); {2230#true} is VALID [2022-04-14 15:13:35,263 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-14 15:13:35,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {2230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {2230#true} is VALID [2022-04-14 15:13:35,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2230#true} {2230#true} #60#return; {2230#true} is VALID [2022-04-14 15:13:35,264 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-14 15:13:35,265 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-14 15:13:35,265 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-14 15:13:35,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,270 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-14 15:13:35,270 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-14 15:13:35,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,271 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-14 15:13:35,271 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-14 15:13:35,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,271 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-14 15:13:35,272 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-14 15:13:35,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,272 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-14 15:13:35,272 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-14 15:13:35,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,273 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-14 15:13:35,274 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-14 15:13:35,274 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-14 15:13:35,274 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-14 15:13:35,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,275 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-14 15:13:35,275 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-14 15:13:35,275 INFO L290 TraceCheckUtils]: 46: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,275 INFO L290 TraceCheckUtils]: 47: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,275 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-14 15:13:35,276 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-14 15:13:35,276 INFO L290 TraceCheckUtils]: 51: Hoare triple {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2391#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:35,277 INFO L290 TraceCheckUtils]: 52: Hoare triple {2391#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2231#false} is VALID [2022-04-14 15:13:35,277 INFO L290 TraceCheckUtils]: 53: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2022-04-14 15:13:35,277 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-14 15:13:35,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:13:35,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2022-04-14 15:13:35,478 INFO L290 TraceCheckUtils]: 52: Hoare triple {2391#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2231#false} is VALID [2022-04-14 15:13:35,478 INFO L290 TraceCheckUtils]: 51: Hoare triple {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2391#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:35,479 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-14 15:13:35,479 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-14 15:13:35,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,480 INFO L290 TraceCheckUtils]: 47: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,480 INFO L290 TraceCheckUtils]: 46: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,480 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-14 15:13:35,480 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-14 15:13:35,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,480 INFO L290 TraceCheckUtils]: 42: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,480 INFO L290 TraceCheckUtils]: 41: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,481 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-14 15:13:35,481 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-14 15:13:35,483 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-14 15:13:35,483 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-14 15:13:35,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,484 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-14 15:13:35,484 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-14 15:13:35,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,485 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-14 15:13:35,485 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-14 15:13:35,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,486 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-14 15:13:35,486 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-14 15:13:35,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,486 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-14 15:13:35,487 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-14 15:13:35,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,487 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-14 15:13:35,488 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-14 15:13:35,488 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-14 15:13:35,488 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2230#true} {2230#true} #60#return; {2230#true} is VALID [2022-04-14 15:13:35,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-14 15:13:35,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-14 15:13:35,488 INFO L272 TraceCheckUtils]: 6: Hoare triple {2230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {2230#true} is VALID [2022-04-14 15:13:35,489 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-14 15:13:35,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret5 := main(); {2230#true} is VALID [2022-04-14 15:13:35,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #84#return; {2230#true} is VALID [2022-04-14 15:13:35,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-14 15:13:35,489 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-14 15:13:35,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2230#true} is VALID [2022-04-14 15:13:35,489 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-14 15:13:35,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:13:35,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332753255] [2022-04-14 15:13:35,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:13:35,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139900999] [2022-04-14 15:13:35,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139900999] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:13:35,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:13:35,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:13:35,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701117803] [2022-04-14 15:13:35,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:13:35,491 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-14 15:13:35,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:13:35,491 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-14 15:13:35,530 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-14 15:13:35,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:13:35,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:13:35,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:13:35,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:13:35,531 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-14 15:13:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:35,941 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-14 15:13:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:13:35,942 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-14 15:13:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:13:35,942 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-14 15:13:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-14 15:13:35,944 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-14 15:13:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-14 15:13:35,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-14 15:13:36,007 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-14 15:13:36,009 INFO L225 Difference]: With dead ends: 81 [2022-04-14 15:13:36,009 INFO L226 Difference]: Without dead ends: 79 [2022-04-14 15:13:36,009 INFO L912 BasicCegarLoop]: 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-14 15:13:36,010 INFO L913 BasicCegarLoop]: 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-14 15:13:36,010 INFO L914 BasicCegarLoop]: 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-14 15:13:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-14 15:13:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-04-14 15:13:36,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:36,021 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-14 15:13:36,021 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-14 15:13:36,021 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-14 15:13:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:36,023 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-14 15:13:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-14 15:13:36,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:36,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:36,024 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-14 15:13:36,024 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-14 15:13:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:36,026 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-14 15:13:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-14 15:13:36,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:36,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:36,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:36,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:36,027 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-14 15:13:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2022-04-14 15:13:36,028 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 54 [2022-04-14 15:13:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:36,028 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2022-04-14 15:13:36,029 INFO L479 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-14 15:13:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2022-04-14 15:13:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-14 15:13:36,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:36,029 INFO L499 BasicCegarLoop]: 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-14 15:13:36,045 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-14 15:13:36,245 WARN L460 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-14 15:13:36,245 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:36,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:36,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 3 times [2022-04-14 15:13:36,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:36,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377923535] [2022-04-14 15:13:36,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:36,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:36,257 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:13:36,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516043522] [2022-04-14 15:13:36,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:13:36,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:36,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:36,258 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-14 15:13:36,287 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-14 15:13:36,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-14 15:13:36,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:13:36,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 15:13:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:36,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:13:36,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2952#true} is VALID [2022-04-14 15:13:36,586 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-14 15:13:36,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #84#return; {2952#true} is VALID [2022-04-14 15:13:36,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret5 := main(); {2952#true} is VALID [2022-04-14 15:13:36,586 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-14 15:13:36,586 INFO L272 TraceCheckUtils]: 6: Hoare triple {2952#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {2952#true} is VALID [2022-04-14 15:13:36,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,586 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2952#true} {2952#true} #60#return; {2952#true} is VALID [2022-04-14 15:13:36,587 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-14 15:13:36,587 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-14 15:13:36,587 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-14 15:13:36,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,588 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-14 15:13:36,588 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-14 15:13:36,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,589 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-14 15:13:36,589 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-14 15:13:36,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,590 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-14 15:13:36,590 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-14 15:13:36,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,590 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-14 15:13:36,590 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-14 15:13:36,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,592 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-14 15:13:36,593 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-14 15:13:36,596 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-14 15:13:36,597 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-14 15:13:36,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,598 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-14 15:13:36,599 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-14 15:13:36,599 INFO L290 TraceCheckUtils]: 46: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,605 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-14 15:13:36,605 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-14 15:13:36,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,605 INFO L290 TraceCheckUtils]: 53: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,606 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-14 15:13:36,606 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-14 15:13:36,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:36,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {3128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2953#false} is VALID [2022-04-14 15:13:36,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-14 15:13:36,608 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-14 15:13:36,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:13:36,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-14 15:13:36,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {3128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2953#false} is VALID [2022-04-14 15:13:36,927 INFO L290 TraceCheckUtils]: 56: Hoare triple {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:36,927 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-14 15:13:36,928 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-14 15:13:36,928 INFO L290 TraceCheckUtils]: 53: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,928 INFO L290 TraceCheckUtils]: 52: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,928 INFO L290 TraceCheckUtils]: 51: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,928 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-14 15:13:36,929 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-14 15:13:36,929 INFO L290 TraceCheckUtils]: 48: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,929 INFO L290 TraceCheckUtils]: 47: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,929 INFO L290 TraceCheckUtils]: 46: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,929 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-14 15:13:36,930 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-14 15:13:36,930 INFO L290 TraceCheckUtils]: 43: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,930 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-14 15:13:36,931 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-14 15:13:36,933 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-14 15:13:36,934 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-14 15:13:36,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,934 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-14 15:13:36,935 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-14 15:13:36,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,935 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-14 15:13:36,935 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-14 15:13:36,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,936 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-14 15:13:36,936 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-14 15:13:36,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,936 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-14 15:13:36,937 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-14 15:13:36,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,937 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-14 15:13:36,937 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-14 15:13:36,938 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-14 15:13:36,938 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2952#true} {2952#true} #60#return; {2952#true} is VALID [2022-04-14 15:13:36,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-14 15:13:36,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-14 15:13:36,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {2952#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {2952#true} is VALID [2022-04-14 15:13:36,938 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-14 15:13:36,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret5 := main(); {2952#true} is VALID [2022-04-14 15:13:36,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #84#return; {2952#true} is VALID [2022-04-14 15:13:36,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-14 15:13:36,938 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-14 15:13:36,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2952#true} is VALID [2022-04-14 15:13:36,940 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-14 15:13:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:13:36,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377923535] [2022-04-14 15:13:36,941 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:13:36,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516043522] [2022-04-14 15:13:36,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516043522] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:13:36,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:13:36,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:13:36,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556756256] [2022-04-14 15:13:36,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:13:36,943 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-14 15:13:36,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:13:36,943 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-14 15:13:36,989 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-14 15:13:36,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:13:36,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:13:36,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:13:36,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:13:36,990 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-14 15:13:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:38,055 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-14 15:13:38,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:13:38,056 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-14 15:13:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:13:38,056 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-14 15:13:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-14 15:13:38,057 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-14 15:13:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-14 15:13:38,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2022-04-14 15:13:38,153 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-14 15:13:38,155 INFO L225 Difference]: With dead ends: 93 [2022-04-14 15:13:38,155 INFO L226 Difference]: Without dead ends: 85 [2022-04-14 15:13:38,155 INFO L912 BasicCegarLoop]: 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-14 15:13:38,156 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-14 15:13:38,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 135 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 15:13:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-14 15:13:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2022-04-14 15:13:38,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:38,167 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-14 15:13:38,167 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-14 15:13:38,167 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-14 15:13:38,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:38,169 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-04-14 15:13:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2022-04-14 15:13:38,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:38,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:38,170 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-14 15:13:38,170 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-14 15:13:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:38,172 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-04-14 15:13:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2022-04-14 15:13:38,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:38,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:38,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:38,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:38,173 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-14 15:13:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-14 15:13:38,174 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 59 [2022-04-14 15:13:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:38,174 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-14 15:13:38,174 INFO L479 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-14 15:13:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-14 15:13:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-14 15:13:38,175 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:38,175 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:13:38,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-14 15:13:38,391 WARN L460 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-14 15:13:38,391 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:38,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 1 times [2022-04-14 15:13:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:38,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441312131] [2022-04-14 15:13:38,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:38,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:38,400 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:13:38,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516001580] [2022-04-14 15:13:38,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:38,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:38,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:38,401 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-14 15:13:38,402 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-14 15:13:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:38,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-14 15:13:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:38,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:13:38,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {3742#true} call ULTIMATE.init(); {3742#true} is VALID [2022-04-14 15:13:38,953 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-14 15:13:38,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3742#true} {3742#true} #84#return; {3742#true} is VALID [2022-04-14 15:13:38,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {3742#true} call #t~ret5 := main(); {3742#true} is VALID [2022-04-14 15:13:38,954 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-14 15:13:38,954 INFO L272 TraceCheckUtils]: 6: Hoare triple {3742#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {3742#true} is VALID [2022-04-14 15:13:38,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-14 15:13:38,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-14 15:13:38,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,954 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3742#true} {3742#true} #60#return; {3742#true} is VALID [2022-04-14 15:13:38,954 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-14 15:13:38,955 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-14 15:13:38,955 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-14 15:13:38,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-14 15:13:38,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-14 15:13:38,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,956 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-14 15:13:38,956 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-14 15:13:38,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-14 15:13:38,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-14 15:13:38,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,956 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-14 15:13:38,956 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-14 15:13:38,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-14 15:13:38,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-14 15:13:38,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,957 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-14 15:13:38,957 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-14 15:13:38,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-14 15:13:38,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-14 15:13:38,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,958 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-14 15:13:38,958 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-14 15:13:38,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-14 15:13:38,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-14 15:13:38,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,959 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-14 15:13:38,959 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-14 15:13:38,959 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-14 15:13:38,959 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-14 15:13:38,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-14 15:13:38,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-14 15:13:38,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,961 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-14 15:13:38,961 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-14 15:13:38,961 INFO L290 TraceCheckUtils]: 46: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-14 15:13:38,961 INFO L290 TraceCheckUtils]: 47: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-14 15:13:38,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,963 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-14 15:13:38,963 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-14 15:13:38,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-14 15:13:38,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-14 15:13:38,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,964 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-14 15:13:38,964 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-14 15:13:38,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-14 15:13:38,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-14 15:13:38,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,965 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-14 15:13:38,965 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-14 15:13:38,965 INFO L290 TraceCheckUtils]: 61: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-14 15:13:38,965 INFO L290 TraceCheckUtils]: 62: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-14 15:13:38,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,966 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-14 15:13:38,966 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-14 15:13:38,966 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-14 15:13:38,966 INFO L290 TraceCheckUtils]: 67: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-14 15:13:38,966 INFO L290 TraceCheckUtils]: 68: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-14 15:13:38,966 INFO L290 TraceCheckUtils]: 69: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-14 15:13:38,967 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-14 15:13:38,967 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-14 15:13:38,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {3963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:38,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {3967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3743#false} is VALID [2022-04-14 15:13:38,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {3743#false} assume !false; {3743#false} is VALID [2022-04-14 15:13:38,969 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-14 15:13:38,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:13:39,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:13:39,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441312131] [2022-04-14 15:13:39,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:13:39,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516001580] [2022-04-14 15:13:39,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516001580] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:13:39,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:13:39,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-14 15:13:39,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669856802] [2022-04-14 15:13:39,314 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:13:39,315 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-14 15:13:39,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:13:39,315 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-14 15:13:39,349 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-14 15:13:39,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 15:13:39,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:13:39,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 15:13:39,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:13:39,350 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-14 15:13:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:39,781 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-04-14 15:13:39,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:13:39,781 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-14 15:13:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:13:39,781 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-14 15:13:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-14 15:13:39,783 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-14 15:13:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-14 15:13:39,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2022-04-14 15:13:39,835 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-14 15:13:39,840 INFO L225 Difference]: With dead ends: 95 [2022-04-14 15:13:39,841 INFO L226 Difference]: Without dead ends: 93 [2022-04-14 15:13:39,844 INFO L912 BasicCegarLoop]: 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-14 15:13:39,850 INFO L913 BasicCegarLoop]: 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-14 15:13:39,850 INFO L914 BasicCegarLoop]: 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-14 15:13:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-14 15:13:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-04-14 15:13:39,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:13:39,879 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-14 15:13:39,881 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-14 15:13:39,881 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-14 15:13:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:39,892 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-14 15:13:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-14 15:13:39,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:39,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:39,892 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-14 15:13:39,893 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-14 15:13:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:13:39,894 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-14 15:13:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-14 15:13:39,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:13:39,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:13:39,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:13:39,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:13:39,896 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-14 15:13:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-04-14 15:13:39,899 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 75 [2022-04-14 15:13:39,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:13:39,900 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-04-14 15:13:39,900 INFO L479 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-14 15:13:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-04-14 15:13:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-14 15:13:39,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:13:39,901 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:13:39,917 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-14 15:13:40,104 WARN L460 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-14 15:13:40,105 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:13:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:13:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 1 times [2022-04-14 15:13:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:13:40,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395705866] [2022-04-14 15:13:40,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:40,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:13:40,126 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:13:40,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724456943] [2022-04-14 15:13:40,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:13:40,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:13:40,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:13:40,137 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-14 15:13:40,138 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-14 15:13:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:40,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 15:13:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:13:40,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:13:41,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {4552#true} call ULTIMATE.init(); {4552#true} is VALID [2022-04-14 15:13:41,857 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-14 15:13:41,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-14 15:13:41,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4552#true} {4552#true} #84#return; {4552#true} is VALID [2022-04-14 15:13:41,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {4552#true} call #t~ret5 := main(); {4552#true} is VALID [2022-04-14 15:13:41,858 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-14 15:13:41,858 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 <= 20 then 1 else 0)); {4552#true} is VALID [2022-04-14 15:13:41,858 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-14 15:13:41,858 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-14 15:13:41,858 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-14 15:13:41,859 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 (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:13:41,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {4590#(and (<= main_~a~0 20) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-14 15:13:41,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} assume !false; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-14 15:13:41,859 INFO L272 TraceCheckUtils]: 13: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-14 15:13:41,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-14 15:13:41,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-14 15:13:41,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-14 15:13:41,860 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} #62#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-14 15:13:41,860 INFO L272 TraceCheckUtils]: 18: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 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-14 15:13:41,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-14 15:13:41,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-14 15:13:41,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-14 15:13:41,867 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} #64#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-14 15:13:41,867 INFO L272 TraceCheckUtils]: 23: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 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-14 15:13:41,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-14 15:13:41,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-14 15:13:41,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-14 15:13:41,868 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} #66#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-14 15:13:41,868 INFO L272 TraceCheckUtils]: 28: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 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-14 15:13:41,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-14 15:13:41,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-14 15:13:41,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-14 15:13:41,869 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} #68#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-14 15:13:41,869 INFO L272 TraceCheckUtils]: 33: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 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-14 15:13:41,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-14 15:13:41,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-14 15:13:41,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-14 15:13:41,869 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} #70#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-14 15:13:41,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (<= main_~a~0 20) (= main_~y~0 1) (<= 0 main_~a~0) (<= 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:13:41,870 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:13:41,870 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-14 15:13:41,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-14 15:13:41,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-14 15:13:41,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-14 15:13:41,871 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:13:41,871 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_~a~0 20) (= main_~x~0 1) (<= 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)); {4552#true} is VALID [2022-04-14 15:13:41,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-14 15:13:41,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-14 15:13:41,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-14 15:13:41,872 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:13:41,872 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= 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-14 15:13:41,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-14 15:13:41,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-14 15:13:41,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-14 15:13:41,872 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:13:41,872 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_~a~0 20) (= main_~x~0 1) (<= 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)); {4552#true} is VALID [2022-04-14 15:13:41,872 INFO L290 TraceCheckUtils]: 56: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-14 15:13:41,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-14 15:13:41,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-14 15:13:41,873 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:13:41,873 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_~a~0 20) (= main_~x~0 1) (<= 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)); {4552#true} is VALID [2022-04-14 15:13:41,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {4552#true} ~cond := #in~cond; {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:41,875 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-14 15:13:41,875 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-14 15:13:41,876 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_~a~0 20) (= main_~x~0 1) (<= 0 main_~a~0) (<= 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_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-14 15:13:41,876 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_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (<= 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-14 15:13:41,876 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-14 15:13:41,876 INFO L290 TraceCheckUtils]: 67: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-14 15:13:41,876 INFO L290 TraceCheckUtils]: 68: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-14 15:13:41,876 INFO L290 TraceCheckUtils]: 69: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-14 15:13:41,877 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-14 15:13:41,877 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-14 15:13:41,877 INFO L290 TraceCheckUtils]: 72: Hoare triple {4552#true} ~cond := #in~cond; {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:41,877 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-14 15:13:41,877 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-14 15:13:41,878 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-14 15:13:41,879 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-14 15:13:41,879 INFO L290 TraceCheckUtils]: 77: Hoare triple {4796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:13:41,879 INFO L290 TraceCheckUtils]: 78: Hoare triple {4800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4553#false} is VALID [2022-04-14 15:13:41,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {4553#false} assume !false; {4553#false} is VALID [2022-04-14 15:13:41,880 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-14 15:13:41,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:14:24,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:14:24,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395705866] [2022-04-14 15:14:24,620 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:14:24,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724456943] [2022-04-14 15:14:24,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724456943] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:14:24,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:14:24,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-14 15:14:24,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808960895] [2022-04-14 15:14:24,620 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:14:24,621 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-14 15:14:24,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:14:24,621 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-14 15:14:24,670 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-14 15:14:24,670 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 15:14:24,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:14:24,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 15:14:24,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-04-14 15:14:24,671 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-14 15:14:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:25,926 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-04-14 15:14:25,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-14 15:14:25,927 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-14 15:14:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:14:25,927 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-14 15:14:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-14 15:14:25,928 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-14 15:14:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-14 15:14:25,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-14 15:14:25,995 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-14 15:14:25,997 INFO L225 Difference]: With dead ends: 103 [2022-04-14 15:14:25,997 INFO L226 Difference]: Without dead ends: 90 [2022-04-14 15:14:25,997 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2022-04-14 15:14:25,997 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:14:25,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 119 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 15:14:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-14 15:14:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-04-14 15:14:26,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:14:26,042 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-14 15:14:26,042 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-14 15:14:26,042 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-14 15:14:26,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:26,044 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-14 15:14:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-14 15:14:26,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:14:26,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:14:26,044 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-14 15:14:26,044 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-14 15:14:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:26,046 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-14 15:14:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-14 15:14:26,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:14:26,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:14:26,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:14:26,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:14:26,046 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-14 15:14:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-04-14 15:14:26,048 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 80 [2022-04-14 15:14:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:14:26,048 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-04-14 15:14:26,048 INFO L479 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-14 15:14:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-14 15:14:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-14 15:14:26,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:14:26,048 INFO L499 BasicCegarLoop]: 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-14 15:14:26,072 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-14 15:14:26,249 WARN L460 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-14 15:14:26,249 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:14:26,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:14:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 4 times [2022-04-14 15:14:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:14:26,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959792505] [2022-04-14 15:14:26,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:14:26,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:14:26,269 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:14:26,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535873247] [2022-04-14 15:14:26,269 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 15:14:26,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:14:26,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:14:26,272 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-14 15:14:26,273 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-14 15:14:26,331 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 15:14:26,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:14:26,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-14 15:14:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:14:26,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:14:26,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {5407#true} call ULTIMATE.init(); {5407#true} is VALID [2022-04-14 15:14:26,648 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-14 15:14:26,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5407#true} {5407#true} #84#return; {5407#true} is VALID [2022-04-14 15:14:26,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {5407#true} call #t~ret5 := main(); {5407#true} is VALID [2022-04-14 15:14:26,649 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-14 15:14:26,649 INFO L272 TraceCheckUtils]: 6: Hoare triple {5407#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {5407#true} is VALID [2022-04-14 15:14:26,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,649 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5407#true} {5407#true} #60#return; {5407#true} is VALID [2022-04-14 15:14:26,649 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-14 15:14:26,650 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-14 15:14:26,650 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-14 15:14:26,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,651 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-14 15:14:26,651 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-14 15:14:26,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,652 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-14 15:14:26,652 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-14 15:14:26,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,653 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-14 15:14:26,653 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-14 15:14:26,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,653 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-14 15:14:26,654 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-14 15:14:26,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,654 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-14 15:14:26,655 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-14 15:14:26,655 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-14 15:14:26,655 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-14 15:14:26,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,656 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-14 15:14:26,656 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-14 15:14:26,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,656 INFO L290 TraceCheckUtils]: 47: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,656 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-14 15:14:26,657 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-14 15:14:26,657 INFO L290 TraceCheckUtils]: 51: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,657 INFO L290 TraceCheckUtils]: 52: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,657 INFO L290 TraceCheckUtils]: 53: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,659 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-14 15:14:26,659 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-14 15:14:26,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,659 INFO L290 TraceCheckUtils]: 58: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,660 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-14 15:14:26,660 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-14 15:14:26,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,660 INFO L290 TraceCheckUtils]: 63: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,660 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-14 15:14:26,661 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-14 15:14:26,661 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-14 15:14:26,661 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-14 15:14:26,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,661 INFO L290 TraceCheckUtils]: 70: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,662 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-14 15:14:26,662 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-14 15:14:26,662 INFO L290 TraceCheckUtils]: 73: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,662 INFO L290 TraceCheckUtils]: 75: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,662 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-14 15:14:26,663 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-14 15:14:26,663 INFO L290 TraceCheckUtils]: 78: Hoare triple {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:14:26,664 INFO L290 TraceCheckUtils]: 79: Hoare triple {5650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5408#false} is VALID [2022-04-14 15:14:26,664 INFO L290 TraceCheckUtils]: 80: Hoare triple {5408#false} assume !false; {5408#false} is VALID [2022-04-14 15:14:26,664 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-14 15:14:26,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:14:26,949 INFO L290 TraceCheckUtils]: 80: Hoare triple {5408#false} assume !false; {5408#false} is VALID [2022-04-14 15:14:26,949 INFO L290 TraceCheckUtils]: 79: Hoare triple {5650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5408#false} is VALID [2022-04-14 15:14:26,949 INFO L290 TraceCheckUtils]: 78: Hoare triple {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:14:26,950 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-14 15:14:26,950 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-14 15:14:26,950 INFO L290 TraceCheckUtils]: 75: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,950 INFO L290 TraceCheckUtils]: 74: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,951 INFO L290 TraceCheckUtils]: 73: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,951 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-14 15:14:26,951 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-14 15:14:26,951 INFO L290 TraceCheckUtils]: 70: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,951 INFO L290 TraceCheckUtils]: 69: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,951 INFO L290 TraceCheckUtils]: 68: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,951 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-14 15:14:26,952 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-14 15:14:26,953 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-14 15:14:26,954 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-14 15:14:26,954 INFO L290 TraceCheckUtils]: 63: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,954 INFO L290 TraceCheckUtils]: 62: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,954 INFO L290 TraceCheckUtils]: 61: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,954 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-14 15:14:26,954 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-14 15:14:26,954 INFO L290 TraceCheckUtils]: 58: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,955 INFO L290 TraceCheckUtils]: 57: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,955 INFO L290 TraceCheckUtils]: 56: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,955 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-14 15:14:26,955 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-14 15:14:26,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,955 INFO L290 TraceCheckUtils]: 52: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,955 INFO L290 TraceCheckUtils]: 51: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,955 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-14 15:14:26,956 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-14 15:14:26,956 INFO L290 TraceCheckUtils]: 48: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,956 INFO L290 TraceCheckUtils]: 47: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,956 INFO L290 TraceCheckUtils]: 46: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,956 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-14 15:14:26,956 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-14 15:14:26,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,957 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-14 15:14:26,957 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-14 15:14:26,959 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-14 15:14:26,959 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-14 15:14:26,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,960 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-14 15:14:26,960 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-14 15:14:26,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,960 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-14 15:14:26,961 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-14 15:14:26,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,961 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-14 15:14:26,961 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-14 15:14:26,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,962 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-14 15:14:26,962 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-14 15:14:26,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,962 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-14 15:14:26,963 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-14 15:14:26,963 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-14 15:14:26,963 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5407#true} {5407#true} #60#return; {5407#true} is VALID [2022-04-14 15:14:26,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-14 15:14:26,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-14 15:14:26,963 INFO L272 TraceCheckUtils]: 6: Hoare triple {5407#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {5407#true} is VALID [2022-04-14 15:14:26,963 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-14 15:14:26,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {5407#true} call #t~ret5 := main(); {5407#true} is VALID [2022-04-14 15:14:26,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5407#true} {5407#true} #84#return; {5407#true} is VALID [2022-04-14 15:14:26,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-14 15:14:26,964 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-14 15:14:26,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {5407#true} call ULTIMATE.init(); {5407#true} is VALID [2022-04-14 15:14:26,964 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-14 15:14:26,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:14:26,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959792505] [2022-04-14 15:14:26,964 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:14:26,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535873247] [2022-04-14 15:14:26,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535873247] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:14:26,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:14:26,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-14 15:14:26,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007818918] [2022-04-14 15:14:26,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:14:26,965 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-14 15:14:26,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:14:26,965 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-14 15:14:27,014 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-14 15:14:27,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 15:14:27,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:14:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 15:14:27,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:14:27,016 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-14 15:14:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:27,852 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2022-04-14 15:14:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 15:14:27,852 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-14 15:14:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:14:27,853 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-14 15:14:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-14 15:14:27,858 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-14 15:14:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-14 15:14:27,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-14 15:14:27,988 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-14 15:14:27,989 INFO L225 Difference]: With dead ends: 106 [2022-04-14 15:14:27,989 INFO L226 Difference]: Without dead ends: 104 [2022-04-14 15:14:27,990 INFO L912 BasicCegarLoop]: 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-14 15:14:27,990 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:14:27,990 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 149 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 15:14:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-14 15:14:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2022-04-14 15:14:28,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:14:28,048 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-14 15:14:28,048 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-14 15:14:28,049 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-14 15:14:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:28,052 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-04-14 15:14:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2022-04-14 15:14:28,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:14:28,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:14:28,053 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-14 15:14:28,053 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-14 15:14:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:28,055 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-04-14 15:14:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2022-04-14 15:14:28,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:14:28,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:14:28,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:14:28,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:14:28,056 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-14 15:14:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-04-14 15:14:28,058 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 81 [2022-04-14 15:14:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:14:28,058 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-04-14 15:14:28,058 INFO L479 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-14 15:14:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-04-14 15:14:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-14 15:14:28,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:14:28,062 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:14:28,082 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-14 15:14:28,277 WARN L460 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-14 15:14:28,277 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:14:28,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:14:28,278 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 2 times [2022-04-14 15:14:28,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:14:28,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372901167] [2022-04-14 15:14:28,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:14:28,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:14:28,286 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:14:28,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409879204] [2022-04-14 15:14:28,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:14:28,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:14:28,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:14:28,290 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-14 15:14:28,297 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-14 15:14:28,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:14:28,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:14:28,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-14 15:14:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:14:28,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:14:29,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {6409#true} call ULTIMATE.init(); {6409#true} is VALID [2022-04-14 15:14:29,024 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-14 15:14:29,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6409#true} {6409#true} #84#return; {6409#true} is VALID [2022-04-14 15:14:29,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {6409#true} call #t~ret5 := main(); {6409#true} is VALID [2022-04-14 15:14:29,024 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-14 15:14:29,024 INFO L272 TraceCheckUtils]: 6: Hoare triple {6409#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {6409#true} is VALID [2022-04-14 15:14:29,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,024 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6409#true} {6409#true} #60#return; {6409#true} is VALID [2022-04-14 15:14:29,025 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-14 15:14:29,025 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-14 15:14:29,025 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-14 15:14:29,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,026 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-14 15:14:29,026 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-14 15:14:29,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,027 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-14 15:14:29,027 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-14 15:14:29,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,027 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-14 15:14:29,027 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-14 15:14:29,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,028 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-14 15:14:29,028 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-14 15:14:29,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,029 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-14 15:14:29,029 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-14 15:14:29,030 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-14 15:14:29,030 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-14 15:14:29,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,030 INFO L290 TraceCheckUtils]: 43: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,031 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-14 15:14:29,031 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-14 15:14:29,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,031 INFO L290 TraceCheckUtils]: 47: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,031 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-14 15:14:29,032 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-14 15:14:29,032 INFO L290 TraceCheckUtils]: 51: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,032 INFO L290 TraceCheckUtils]: 52: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,032 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-14 15:14:29,032 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-14 15:14:29,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,033 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-14 15:14:29,037 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-14 15:14:29,037 INFO L290 TraceCheckUtils]: 61: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,037 INFO L290 TraceCheckUtils]: 63: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,038 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-14 15:14:29,038 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-14 15:14:29,039 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-14 15:14:29,039 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-14 15:14:29,039 INFO L290 TraceCheckUtils]: 68: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,039 INFO L290 TraceCheckUtils]: 69: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,039 INFO L290 TraceCheckUtils]: 70: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,039 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-14 15:14:29,040 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-14 15:14:29,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,040 INFO L290 TraceCheckUtils]: 74: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,040 INFO L290 TraceCheckUtils]: 75: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,040 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-14 15:14:29,041 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-14 15:14:29,041 INFO L290 TraceCheckUtils]: 78: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,041 INFO L290 TraceCheckUtils]: 79: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,041 INFO L290 TraceCheckUtils]: 80: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,041 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-14 15:14:29,041 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-14 15:14:29,042 INFO L290 TraceCheckUtils]: 83: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,042 INFO L290 TraceCheckUtils]: 84: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,042 INFO L290 TraceCheckUtils]: 85: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,042 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-14 15:14:29,042 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-14 15:14:29,042 INFO L290 TraceCheckUtils]: 88: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,042 INFO L290 TraceCheckUtils]: 89: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,042 INFO L290 TraceCheckUtils]: 90: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,043 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-14 15:14:29,043 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-14 15:14:29,043 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-14 15:14:29,043 INFO L290 TraceCheckUtils]: 94: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-14 15:14:29,044 INFO L290 TraceCheckUtils]: 95: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-14 15:14:29,044 INFO L290 TraceCheckUtils]: 96: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-14 15:14:29,044 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-14 15:14:29,045 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-14 15:14:29,045 INFO L290 TraceCheckUtils]: 99: Hoare triple {6712#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6716#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:14:29,045 INFO L290 TraceCheckUtils]: 100: Hoare triple {6716#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6410#false} is VALID [2022-04-14 15:14:29,045 INFO L290 TraceCheckUtils]: 101: Hoare triple {6410#false} assume !false; {6410#false} is VALID [2022-04-14 15:14:29,046 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-14 15:14:29,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:14:29,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:14:29,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372901167] [2022-04-14 15:14:29,391 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:14:29,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409879204] [2022-04-14 15:14:29,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409879204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:14:29,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:14:29,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-14 15:14:29,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26272581] [2022-04-14 15:14:29,391 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:14:29,392 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-14 15:14:29,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:14:29,392 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-14 15:14:29,437 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-14 15:14:29,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:14:29,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:14:29,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:14:29,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:14:29,437 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-14 15:14:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:30,068 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-04-14 15:14:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 15:14:30,069 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-14 15:14:30,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:14:30,069 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-14 15:14:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-14 15:14:30,070 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-14 15:14:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-14 15:14:30,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-14 15:14:30,140 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-14 15:14:30,142 INFO L225 Difference]: With dead ends: 118 [2022-04-14 15:14:30,142 INFO L226 Difference]: Without dead ends: 116 [2022-04-14 15:14:30,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 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-14 15:14:30,143 INFO L913 BasicCegarLoop]: 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-14 15:14:30,143 INFO L914 BasicCegarLoop]: 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-14 15:14:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-14 15:14:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-04-14 15:14:30,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:14:30,205 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-14 15:14:30,205 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-14 15:14:30,206 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-14 15:14:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:30,207 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-04-14 15:14:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-04-14 15:14:30,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:14:30,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:14:30,208 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-14 15:14:30,208 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-14 15:14:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:30,210 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-04-14 15:14:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-04-14 15:14:30,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:14:30,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:14:30,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:14:30,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:14:30,210 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-14 15:14:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2022-04-14 15:14:30,212 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 102 [2022-04-14 15:14:30,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:14:30,212 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2022-04-14 15:14:30,212 INFO L479 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-14 15:14:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2022-04-14 15:14:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-14 15:14:30,213 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:14:30,213 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:14:30,231 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-14 15:14:30,431 WARN L460 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-14 15:14:30,432 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:14:30,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:14:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 2 times [2022-04-14 15:14:30,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:14:30,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363127758] [2022-04-14 15:14:30,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:14:30,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:14:30,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:14:30,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1569921058] [2022-04-14 15:14:30,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:14:30,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:14:30,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:14:30,463 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-14 15:14:30,464 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-14 15:14:30,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:14:30,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:14:30,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-14 15:14:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:14:30,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:14:30,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {7413#true} call ULTIMATE.init(); {7413#true} is VALID [2022-04-14 15:14:30,975 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-14 15:14:30,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7413#true} {7413#true} #84#return; {7413#true} is VALID [2022-04-14 15:14:30,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {7413#true} call #t~ret5 := main(); {7413#true} is VALID [2022-04-14 15:14:30,976 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-14 15:14:30,976 INFO L272 TraceCheckUtils]: 6: Hoare triple {7413#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {7413#true} is VALID [2022-04-14 15:14:30,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,976 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7413#true} {7413#true} #60#return; {7413#true} is VALID [2022-04-14 15:14:30,976 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-14 15:14:30,977 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-14 15:14:30,977 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-14 15:14:30,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,977 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-14 15:14:30,977 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-14 15:14:30,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,978 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-14 15:14:30,978 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-14 15:14:30,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,978 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-14 15:14:30,978 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-14 15:14:30,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,979 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-14 15:14:30,979 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-14 15:14:30,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,979 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-14 15:14:30,980 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-14 15:14:30,980 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-14 15:14:30,980 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-14 15:14:30,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,980 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-14 15:14:30,980 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-14 15:14:30,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,983 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-14 15:14:30,983 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-14 15:14:30,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,983 INFO L290 TraceCheckUtils]: 52: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,983 INFO L290 TraceCheckUtils]: 53: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,995 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-14 15:14:30,995 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-14 15:14:30,996 INFO L290 TraceCheckUtils]: 56: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,996 INFO L290 TraceCheckUtils]: 57: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,996 INFO L290 TraceCheckUtils]: 58: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,996 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-14 15:14:30,996 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-14 15:14:30,996 INFO L290 TraceCheckUtils]: 61: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,996 INFO L290 TraceCheckUtils]: 62: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,997 INFO L290 TraceCheckUtils]: 63: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,997 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-14 15:14:30,997 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-14 15:14:30,998 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-14 15:14:30,998 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-14 15:14:30,998 INFO L290 TraceCheckUtils]: 68: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,998 INFO L290 TraceCheckUtils]: 69: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,998 INFO L290 TraceCheckUtils]: 70: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,999 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-14 15:14:30,999 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-14 15:14:30,999 INFO L290 TraceCheckUtils]: 73: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,999 INFO L290 TraceCheckUtils]: 74: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:30,999 INFO L290 TraceCheckUtils]: 75: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:30,999 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-14 15:14:30,999 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-14 15:14:30,999 INFO L290 TraceCheckUtils]: 78: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:30,999 INFO L290 TraceCheckUtils]: 79: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:31,000 INFO L290 TraceCheckUtils]: 80: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:31,000 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-14 15:14:31,000 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-14 15:14:31,000 INFO L290 TraceCheckUtils]: 83: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:31,000 INFO L290 TraceCheckUtils]: 84: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:31,000 INFO L290 TraceCheckUtils]: 85: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:31,001 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-14 15:14:31,001 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-14 15:14:31,001 INFO L290 TraceCheckUtils]: 88: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:31,001 INFO L290 TraceCheckUtils]: 89: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:31,001 INFO L290 TraceCheckUtils]: 90: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:31,002 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-14 15:14:31,002 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-14 15:14:31,002 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-14 15:14:31,002 INFO L290 TraceCheckUtils]: 94: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:31,002 INFO L290 TraceCheckUtils]: 95: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:31,002 INFO L290 TraceCheckUtils]: 96: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:31,003 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-14 15:14:31,003 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-14 15:14:31,003 INFO L290 TraceCheckUtils]: 99: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-14 15:14:31,003 INFO L290 TraceCheckUtils]: 100: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-14 15:14:31,003 INFO L290 TraceCheckUtils]: 101: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-14 15:14:31,003 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-14 15:14:31,004 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-14 15:14:31,004 INFO L290 TraceCheckUtils]: 104: Hoare triple {7731#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7735#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:14:31,004 INFO L290 TraceCheckUtils]: 105: Hoare triple {7735#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7414#false} is VALID [2022-04-14 15:14:31,004 INFO L290 TraceCheckUtils]: 106: Hoare triple {7414#false} assume !false; {7414#false} is VALID [2022-04-14 15:14:31,005 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-14 15:14:31,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:14:36,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:14:36,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363127758] [2022-04-14 15:14:36,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:14:36,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569921058] [2022-04-14 15:14:36,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569921058] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:14:36,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:14:36,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-14 15:14:36,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356135691] [2022-04-14 15:14:36,535 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:14:36,535 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-14 15:14:36,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:14:36,535 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-14 15:14:36,582 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-14 15:14:36,582 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:14:36,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:14:36,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:14:36,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:14:36,583 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-14 15:14:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:37,200 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2022-04-14 15:14:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 15:14:37,200 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-14 15:14:37,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:14:37,201 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-14 15:14:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-14 15:14:37,202 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-14 15:14:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-14 15:14:37,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-14 15:14:37,270 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-14 15:14:37,272 INFO L225 Difference]: With dead ends: 126 [2022-04-14 15:14:37,272 INFO L226 Difference]: Without dead ends: 113 [2022-04-14 15:14:37,272 INFO L912 BasicCegarLoop]: 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-14 15:14:37,272 INFO L913 BasicCegarLoop]: 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-14 15:14:37,273 INFO L914 BasicCegarLoop]: 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-14 15:14:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-14 15:14:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-14 15:14:37,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:14:37,331 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-14 15:14:37,331 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-14 15:14:37,332 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-14 15:14:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:37,333 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-04-14 15:14:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-04-14 15:14:37,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:14:37,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:14:37,335 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-14 15:14:37,335 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-14 15:14:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:37,337 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-04-14 15:14:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-04-14 15:14:37,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:14:37,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:14:37,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:14:37,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:14:37,338 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-14 15:14:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2022-04-14 15:14:37,339 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 107 [2022-04-14 15:14:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:14:37,339 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2022-04-14 15:14:37,340 INFO L479 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-14 15:14:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-04-14 15:14:37,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-14 15:14:37,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:14:37,340 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:14:37,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-14 15:14:37,551 WARN L460 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-14 15:14:37,552 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:14:37,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:14:37,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 3 times [2022-04-14 15:14:37,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:14:37,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016743386] [2022-04-14 15:14:37,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:14:37,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:14:37,579 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:14:37,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1268634096] [2022-04-14 15:14:37,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:14:37,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:14:37,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:14:37,592 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-14 15:14:37,602 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-14 15:14:37,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-14 15:14:37,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:14:37,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-14 15:14:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:14:37,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:14:41,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {8447#true} call ULTIMATE.init(); {8447#true} is VALID [2022-04-14 15:14:41,662 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-14 15:14:41,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8447#true} {8447#true} #84#return; {8447#true} is VALID [2022-04-14 15:14:41,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {8447#true} call #t~ret5 := main(); {8447#true} is VALID [2022-04-14 15:14:41,663 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-14 15:14:41,663 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 <= 20 then 1 else 0)); {8447#true} is VALID [2022-04-14 15:14:41,664 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-14 15:14:41,664 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-14 15:14:41,664 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-14 15:14:41,665 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 (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,665 INFO L272 TraceCheckUtils]: 13: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-14 15:14:41,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,666 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,666 INFO L272 TraceCheckUtils]: 18: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} 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-14 15:14:41,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,667 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #64#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,667 INFO L272 TraceCheckUtils]: 23: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-14 15:14:41,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,667 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #66#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,667 INFO L272 TraceCheckUtils]: 28: Hoare triple {8485#(and (<= main_~a~0 20) (<= 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)); {8447#true} is VALID [2022-04-14 15:14:41,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,668 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #68#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,668 INFO L272 TraceCheckUtils]: 33: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} 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-14 15:14:41,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,668 INFO L290 TraceCheckUtils]: 36: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,669 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #70#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,669 INFO L272 TraceCheckUtils]: 40: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-14 15:14:41,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,670 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,670 INFO L272 TraceCheckUtils]: 45: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} 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-14 15:14:41,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,670 INFO L290 TraceCheckUtils]: 47: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,671 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #64#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,671 INFO L272 TraceCheckUtils]: 50: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-14 15:14:41,671 INFO L290 TraceCheckUtils]: 51: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,671 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #66#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,672 INFO L272 TraceCheckUtils]: 55: Hoare triple {8485#(and (<= main_~a~0 20) (<= 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)); {8447#true} is VALID [2022-04-14 15:14:41,672 INFO L290 TraceCheckUtils]: 56: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,672 INFO L290 TraceCheckUtils]: 57: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,672 INFO L290 TraceCheckUtils]: 58: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,672 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #68#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,672 INFO L272 TraceCheckUtils]: 60: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} 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-14 15:14:41,672 INFO L290 TraceCheckUtils]: 61: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,672 INFO L290 TraceCheckUtils]: 62: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,672 INFO L290 TraceCheckUtils]: 63: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,673 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #70#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,673 INFO L290 TraceCheckUtils]: 65: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,674 INFO L290 TraceCheckUtils]: 66: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,674 INFO L272 TraceCheckUtils]: 67: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-14 15:14:41,674 INFO L290 TraceCheckUtils]: 68: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,674 INFO L290 TraceCheckUtils]: 69: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,674 INFO L290 TraceCheckUtils]: 70: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,674 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,674 INFO L272 TraceCheckUtils]: 72: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} 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-14 15:14:41,674 INFO L290 TraceCheckUtils]: 73: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,674 INFO L290 TraceCheckUtils]: 74: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,674 INFO L290 TraceCheckUtils]: 75: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,675 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #64#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,675 INFO L272 TraceCheckUtils]: 77: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-14 15:14:41,675 INFO L290 TraceCheckUtils]: 78: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,675 INFO L290 TraceCheckUtils]: 79: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,675 INFO L290 TraceCheckUtils]: 80: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,675 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #66#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,676 INFO L272 TraceCheckUtils]: 82: Hoare triple {8485#(and (<= main_~a~0 20) (<= 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)); {8447#true} is VALID [2022-04-14 15:14:41,676 INFO L290 TraceCheckUtils]: 83: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,676 INFO L290 TraceCheckUtils]: 84: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,676 INFO L290 TraceCheckUtils]: 85: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,676 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #68#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,676 INFO L272 TraceCheckUtils]: 87: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} 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-14 15:14:41,676 INFO L290 TraceCheckUtils]: 88: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,676 INFO L290 TraceCheckUtils]: 89: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,676 INFO L290 TraceCheckUtils]: 90: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,677 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {8447#true} {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #70#return; {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,678 INFO L290 TraceCheckUtils]: 92: Hoare triple {8485#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8732#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,678 INFO L290 TraceCheckUtils]: 93: Hoare triple {8732#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {8732#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,678 INFO L272 TraceCheckUtils]: 94: Hoare triple {8732#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-14 15:14:41,678 INFO L290 TraceCheckUtils]: 95: Hoare triple {8447#true} ~cond := #in~cond; {8742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:14:41,679 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-14 15:14:41,679 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-14 15:14:41,679 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {8746#(not (= |__VERIFIER_assert_#in~cond| 0))} {8732#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,679 INFO L272 TraceCheckUtils]: 99: Hoare triple {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} 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-14 15:14:41,680 INFO L290 TraceCheckUtils]: 100: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,680 INFO L290 TraceCheckUtils]: 101: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,680 INFO L290 TraceCheckUtils]: 102: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,680 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {8447#true} {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #64#return; {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,680 INFO L272 TraceCheckUtils]: 104: Hoare triple {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-14 15:14:41,680 INFO L290 TraceCheckUtils]: 105: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,680 INFO L290 TraceCheckUtils]: 106: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,680 INFO L290 TraceCheckUtils]: 107: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,681 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8447#true} {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #66#return; {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,681 INFO L272 TraceCheckUtils]: 109: Hoare triple {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 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)); {8447#true} is VALID [2022-04-14 15:14:41,681 INFO L290 TraceCheckUtils]: 110: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,681 INFO L290 TraceCheckUtils]: 111: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,681 INFO L290 TraceCheckUtils]: 112: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,682 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {8447#true} {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #68#return; {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,682 INFO L272 TraceCheckUtils]: 114: Hoare triple {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} 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-14 15:14:41,682 INFO L290 TraceCheckUtils]: 115: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,682 INFO L290 TraceCheckUtils]: 116: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,682 INFO L290 TraceCheckUtils]: 117: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,682 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {8447#true} {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #70#return; {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-14 15:14:41,683 INFO L290 TraceCheckUtils]: 119: Hoare triple {8753#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} assume !(~n~0 <= ~a~0); {8817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:14:41,683 INFO L272 TraceCheckUtils]: 120: Hoare triple {8817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-14 15:14:41,683 INFO L290 TraceCheckUtils]: 121: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-14 15:14:41,683 INFO L290 TraceCheckUtils]: 122: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-14 15:14:41,683 INFO L290 TraceCheckUtils]: 123: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-14 15:14:41,684 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {8447#true} {8817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (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)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:14:41,954 INFO L272 TraceCheckUtils]: 125: Hoare triple {8817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:14:41,954 INFO L290 TraceCheckUtils]: 126: Hoare triple {8836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:14:41,955 INFO L290 TraceCheckUtils]: 127: Hoare triple {8840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8448#false} is VALID [2022-04-14 15:14:41,955 INFO L290 TraceCheckUtils]: 128: Hoare triple {8448#false} assume !false; {8448#false} is VALID [2022-04-14 15:14:41,955 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-14 15:14:41,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:14:42,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:14:42,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016743386] [2022-04-14 15:14:42,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:14:42,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268634096] [2022-04-14 15:14:42,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268634096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:14:42,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:14:42,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-14 15:14:42,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226449711] [2022-04-14 15:14:42,264 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:14:42,264 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 129 [2022-04-14 15:14:42,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:14:42,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-14 15:14:42,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:14:42,361 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-14 15:14:42,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:14:42,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-14 15:14:42,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:14:42,361 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-14 15:14:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:43,443 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-04-14 15:14:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-14 15:14:43,443 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 129 [2022-04-14 15:14:43,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:14:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-14 15:14:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2022-04-14 15:14:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-14 15:14:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2022-04-14 15:14:43,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 40 transitions. [2022-04-14 15:14:43,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:14:43,561 INFO L225 Difference]: With dead ends: 119 [2022-04-14 15:14:43,561 INFO L226 Difference]: Without dead ends: 115 [2022-04-14 15:14:43,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-14 15:14:43,562 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-14 15:14:43,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 94 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-14 15:14:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-14 15:14:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-14 15:14:43,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:14:43,635 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-14 15:14:43,635 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-14 15:14:43,635 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-14 15:14:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:43,637 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-14 15:14:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-14 15:14:43,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:14:43,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:14:43,637 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-14 15:14:43,638 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-14 15:14:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:14:43,639 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-14 15:14:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-14 15:14:43,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:14:43,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:14:43,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:14:43,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:14:43,640 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-14 15:14:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2022-04-14 15:14:43,641 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 129 [2022-04-14 15:14:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:14:43,641 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2022-04-14 15:14:43,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-14 15:14:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-14 15:14:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-14 15:14:43,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:14:43,643 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:14:43,650 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-14 15:14:43,847 WARN L460 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-14 15:14:43,847 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:14:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:14:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 3 times [2022-04-14 15:14:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:14:43,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94033090] [2022-04-14 15:14:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:14:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:14:43,861 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:14:43,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990637481] [2022-04-14 15:14:43,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:14:43,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:14:43,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:14:43,862 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-14 15:14:43,863 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-14 15:14:44,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-14 15:14:44,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:14:44,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-14 15:14:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:14:44,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:15:29,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {9436#true} call ULTIMATE.init(); {9436#true} is VALID [2022-04-14 15:15:29,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {9436#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); {9436#true} is VALID [2022-04-14 15:15:29,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9436#true} {9436#true} #84#return; {9436#true} is VALID [2022-04-14 15:15:29,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {9436#true} call #t~ret5 := main(); {9436#true} is VALID [2022-04-14 15:15:29,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {9436#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; {9456#(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-14 15:15:29,148 INFO L272 TraceCheckUtils]: 6: Hoare triple {9456#(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 <= 20 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {9436#true} ~cond := #in~cond; {9463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:15:29,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {9463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:15:29,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {9467#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:15:29,149 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9467#(not (= |assume_abort_if_not_#in~cond| 0))} {9456#(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; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,150 INFO L272 TraceCheckUtils]: 13: Hoare triple {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:29,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:29,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,150 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9436#true} {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,150 INFO L272 TraceCheckUtils]: 18: Hoare triple {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:29,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:29,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,151 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9436#true} {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #64#return; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,151 INFO L272 TraceCheckUtils]: 23: Hoare triple {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:29,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:29,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,155 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9436#true} {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #66#return; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,155 INFO L272 TraceCheckUtils]: 28: Hoare triple {9474#(and (<= main_~a~0 20) (<= 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)); {9436#true} is VALID [2022-04-14 15:15:29,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:29,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:29,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,156 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9436#true} {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #68#return; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,156 INFO L272 TraceCheckUtils]: 33: Hoare triple {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:29,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:29,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,157 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9436#true} {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #70#return; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,157 INFO L272 TraceCheckUtils]: 40: Hoare triple {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:29,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:29,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,158 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9436#true} {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,158 INFO L272 TraceCheckUtils]: 45: Hoare triple {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:29,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:29,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,158 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9436#true} {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #64#return; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,159 INFO L272 TraceCheckUtils]: 50: Hoare triple {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:29,159 INFO L290 TraceCheckUtils]: 52: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:29,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,159 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9436#true} {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #66#return; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,159 INFO L272 TraceCheckUtils]: 55: Hoare triple {9474#(and (<= main_~a~0 20) (<= 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)); {9436#true} is VALID [2022-04-14 15:15:29,159 INFO L290 TraceCheckUtils]: 56: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:29,159 INFO L290 TraceCheckUtils]: 57: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:29,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,160 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9436#true} {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #68#return; {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,160 INFO L272 TraceCheckUtils]: 60: Hoare triple {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {9436#true} ~cond := #in~cond; {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:29,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:29,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:29,161 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9474#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #70#return; {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,163 INFO L290 TraceCheckUtils]: 66: Hoare triple {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} assume !false; {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,163 INFO L272 TraceCheckUtils]: 67: Hoare triple {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:29,164 INFO L290 TraceCheckUtils]: 69: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:29,164 INFO L290 TraceCheckUtils]: 70: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,164 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9436#true} {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #62#return; {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,164 INFO L272 TraceCheckUtils]: 72: Hoare triple {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:29,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:29,164 INFO L290 TraceCheckUtils]: 75: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,165 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9436#true} {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #64#return; {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,165 INFO L272 TraceCheckUtils]: 77: Hoare triple {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,165 INFO L290 TraceCheckUtils]: 78: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:29,165 INFO L290 TraceCheckUtils]: 79: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:29,165 INFO L290 TraceCheckUtils]: 80: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:29,165 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9436#true} {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #66#return; {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,165 INFO L272 TraceCheckUtils]: 82: Hoare triple {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 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)); {9436#true} is VALID [2022-04-14 15:15:29,166 INFO L290 TraceCheckUtils]: 83: Hoare triple {9436#true} ~cond := #in~cond; {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:29,166 INFO L290 TraceCheckUtils]: 84: Hoare triple {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:29,166 INFO L290 TraceCheckUtils]: 85: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:29,167 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9639#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #68#return; {9706#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:29,167 INFO L272 TraceCheckUtils]: 87: Hoare triple {9706#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:29,167 INFO L290 TraceCheckUtils]: 88: Hoare triple {9436#true} ~cond := #in~cond; {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:29,167 INFO L290 TraceCheckUtils]: 89: Hoare triple {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:29,167 INFO L290 TraceCheckUtils]: 90: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:29,168 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9706#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} #70#return; {9706#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:31,169 WARN L290 TraceCheckUtils]: 92: Hoare triple {9706#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9725#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0))} is UNKNOWN [2022-04-14 15:15:31,170 INFO L290 TraceCheckUtils]: 93: Hoare triple {9725#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0))} assume !false; {9725#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:31,170 INFO L272 TraceCheckUtils]: 94: Hoare triple {9725#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:31,170 INFO L290 TraceCheckUtils]: 95: Hoare triple {9436#true} ~cond := #in~cond; {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:31,171 INFO L290 TraceCheckUtils]: 96: Hoare triple {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:31,171 INFO L290 TraceCheckUtils]: 97: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:31,172 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9725#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0))} #62#return; {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:31,172 INFO L272 TraceCheckUtils]: 99: Hoare triple {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:31,172 INFO L290 TraceCheckUtils]: 100: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:31,172 INFO L290 TraceCheckUtils]: 101: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:31,172 INFO L290 TraceCheckUtils]: 102: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:31,172 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {9436#true} {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #64#return; {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:31,172 INFO L272 TraceCheckUtils]: 104: Hoare triple {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:31,172 INFO L290 TraceCheckUtils]: 105: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:31,173 INFO L290 TraceCheckUtils]: 106: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:31,173 INFO L290 TraceCheckUtils]: 107: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:31,173 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9436#true} {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #66#return; {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:31,173 INFO L272 TraceCheckUtils]: 109: Hoare triple {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 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)); {9436#true} is VALID [2022-04-14 15:15:31,173 INFO L290 TraceCheckUtils]: 110: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:31,173 INFO L290 TraceCheckUtils]: 111: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:31,173 INFO L290 TraceCheckUtils]: 112: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:31,174 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {9436#true} {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #68#return; {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:31,174 INFO L272 TraceCheckUtils]: 114: Hoare triple {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:31,174 INFO L290 TraceCheckUtils]: 115: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:31,174 INFO L290 TraceCheckUtils]: 116: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:31,174 INFO L290 TraceCheckUtils]: 117: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:31,174 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {9436#true} {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #70#return; {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-14 15:15:31,176 INFO L290 TraceCheckUtils]: 119: Hoare triple {9744#(and (= (mod (+ (* (- 1) main_~z~0 main_~z~0) (* main_~z~0 main_~y~0) (* main_~z~0 8)) 18) 0) (<= 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_~a~0 20) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} assume !(~n~0 <= ~a~0); {9808#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:15:31,176 INFO L272 TraceCheckUtils]: 120: Hoare triple {9808#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:15:31,176 INFO L290 TraceCheckUtils]: 121: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:15:31,176 INFO L290 TraceCheckUtils]: 122: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:15:31,176 INFO L290 TraceCheckUtils]: 123: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:15:31,176 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {9436#true} {9808#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} #72#return; {9808#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:15:31,176 INFO L272 TraceCheckUtils]: 125: Hoare triple {9808#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (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)); {9436#true} is VALID [2022-04-14 15:15:31,177 INFO L290 TraceCheckUtils]: 126: Hoare triple {9436#true} ~cond := #in~cond; {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:31,177 INFO L290 TraceCheckUtils]: 127: Hoare triple {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:31,177 INFO L290 TraceCheckUtils]: 128: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:15:31,178 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9808#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= (+ (div (+ (* (- 1) main_~z~0 main_~z~0) (- 126) (* main_~z~0 26) (* main_~z~0 main_~y~0)) 18) 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} #74#return; {9839#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-14 15:15:31,357 INFO L272 TraceCheckUtils]: 130: Hoare triple {9839#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {9843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:15:31,357 INFO L290 TraceCheckUtils]: 131: Hoare triple {9843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:15:31,358 INFO L290 TraceCheckUtils]: 132: Hoare triple {9847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9437#false} is VALID [2022-04-14 15:15:31,358 INFO L290 TraceCheckUtils]: 133: Hoare triple {9437#false} assume !false; {9437#false} is VALID [2022-04-14 15:15:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 259 proven. 76 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2022-04-14 15:15:31,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:16:26,613 INFO L290 TraceCheckUtils]: 133: Hoare triple {9437#false} assume !false; {9437#false} is VALID [2022-04-14 15:16:26,614 INFO L290 TraceCheckUtils]: 132: Hoare triple {9847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9437#false} is VALID [2022-04-14 15:16:26,614 INFO L290 TraceCheckUtils]: 131: Hoare triple {9843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:16:26,615 INFO L272 TraceCheckUtils]: 130: Hoare triple {9863#(= (+ (* 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)); {9843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:16:26,615 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9867#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} #74#return; {9863#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-14 15:16:26,616 INFO L290 TraceCheckUtils]: 128: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:16:26,616 INFO L290 TraceCheckUtils]: 127: Hoare triple {9877#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:16:26,616 INFO L290 TraceCheckUtils]: 126: Hoare triple {9436#true} ~cond := #in~cond; {9877#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:16:26,616 INFO L272 TraceCheckUtils]: 125: Hoare triple {9867#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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)); {9436#true} is VALID [2022-04-14 15:16:26,617 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {9436#true} {9867#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} #72#return; {9867#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} is VALID [2022-04-14 15:16:26,617 INFO L290 TraceCheckUtils]: 123: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:26,617 INFO L290 TraceCheckUtils]: 122: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:26,617 INFO L290 TraceCheckUtils]: 121: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:26,617 INFO L272 TraceCheckUtils]: 120: Hoare triple {9867#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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)); {9436#true} is VALID [2022-04-14 15:16:26,617 INFO L290 TraceCheckUtils]: 119: Hoare triple {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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); {9867#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} is VALID [2022-04-14 15:16:26,618 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {9436#true} {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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; {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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-14 15:16:26,618 INFO L290 TraceCheckUtils]: 117: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:26,618 INFO L290 TraceCheckUtils]: 116: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:26,618 INFO L290 TraceCheckUtils]: 115: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:26,618 INFO L272 TraceCheckUtils]: 114: Hoare triple {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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)); {9436#true} is VALID [2022-04-14 15:16:26,619 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {9436#true} {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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; {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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-14 15:16:26,619 INFO L290 TraceCheckUtils]: 112: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:26,619 INFO L290 TraceCheckUtils]: 111: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:26,619 INFO L290 TraceCheckUtils]: 110: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:26,619 INFO L272 TraceCheckUtils]: 109: Hoare triple {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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)); {9436#true} is VALID [2022-04-14 15:16:26,619 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9436#true} {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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; {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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-14 15:16:26,619 INFO L290 TraceCheckUtils]: 107: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:26,620 INFO L290 TraceCheckUtils]: 106: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:26,620 INFO L290 TraceCheckUtils]: 105: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:26,620 INFO L272 TraceCheckUtils]: 104: Hoare triple {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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)); {9436#true} is VALID [2022-04-14 15:16:26,620 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {9436#true} {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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; {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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-14 15:16:26,620 INFO L290 TraceCheckUtils]: 102: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:26,620 INFO L290 TraceCheckUtils]: 101: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:26,620 INFO L290 TraceCheckUtils]: 100: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:26,620 INFO L272 TraceCheckUtils]: 99: Hoare triple {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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)); {9436#true} is VALID [2022-04-14 15:16:26,621 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9963#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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; {9899#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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-14 15:16:26,621 INFO L290 TraceCheckUtils]: 97: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:16:26,622 INFO L290 TraceCheckUtils]: 96: Hoare triple {9877#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:16:26,622 INFO L290 TraceCheckUtils]: 95: Hoare triple {9436#true} ~cond := #in~cond; {9877#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:16:26,622 INFO L272 TraceCheckUtils]: 94: Hoare triple {9963#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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)); {9436#true} is VALID [2022-04-14 15:16:26,623 INFO L290 TraceCheckUtils]: 93: Hoare triple {9963#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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; {9963#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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-14 15:16:26,625 INFO L290 TraceCheckUtils]: 92: Hoare triple {9982#(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 main_~z~0) 2) (* main_~y~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; {9963#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* 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-14 15:16:27,654 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9436#true} #70#return; {9982#(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 main_~z~0) 2) (* main_~y~0 2)))} is VALID [2022-04-14 15:16:27,655 INFO L290 TraceCheckUtils]: 90: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:16:27,655 INFO L290 TraceCheckUtils]: 89: Hoare triple {9877#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:16:27,656 INFO L290 TraceCheckUtils]: 88: Hoare triple {9436#true} ~cond := #in~cond; {9877#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:16:27,656 INFO L272 TraceCheckUtils]: 87: Hoare triple {9436#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,656 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9436#true} {9436#true} #68#return; {9436#true} is VALID [2022-04-14 15:16:27,656 INFO L290 TraceCheckUtils]: 85: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,656 INFO L290 TraceCheckUtils]: 84: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,656 INFO L290 TraceCheckUtils]: 83: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,656 INFO L272 TraceCheckUtils]: 82: Hoare triple {9436#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,656 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9436#true} {9436#true} #66#return; {9436#true} is VALID [2022-04-14 15:16:27,656 INFO L290 TraceCheckUtils]: 80: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,656 INFO L290 TraceCheckUtils]: 79: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,656 INFO L290 TraceCheckUtils]: 78: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,656 INFO L272 TraceCheckUtils]: 77: Hoare triple {9436#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9436#true} {9436#true} #64#return; {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 75: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 74: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 73: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L272 TraceCheckUtils]: 72: Hoare triple {9436#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9436#true} {9436#true} #62#return; {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 70: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 69: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 68: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L272 TraceCheckUtils]: 67: Hoare triple {9436#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 66: Hoare triple {9436#true} assume !false; {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 65: Hoare triple {9436#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; {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9436#true} {9436#true} #70#return; {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 63: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 62: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 61: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,657 INFO L272 TraceCheckUtils]: 60: Hoare triple {9436#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9436#true} {9436#true} #68#return; {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L290 TraceCheckUtils]: 58: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L290 TraceCheckUtils]: 57: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L290 TraceCheckUtils]: 56: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L272 TraceCheckUtils]: 55: Hoare triple {9436#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9436#true} {9436#true} #66#return; {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L290 TraceCheckUtils]: 51: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L272 TraceCheckUtils]: 50: Hoare triple {9436#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9436#true} {9436#true} #64#return; {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L290 TraceCheckUtils]: 47: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L290 TraceCheckUtils]: 46: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L272 TraceCheckUtils]: 45: Hoare triple {9436#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,658 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9436#true} {9436#true} #62#return; {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L290 TraceCheckUtils]: 43: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L272 TraceCheckUtils]: 40: Hoare triple {9436#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L290 TraceCheckUtils]: 39: Hoare triple {9436#true} assume !false; {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {9436#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; {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9436#true} {9436#true} #70#return; {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L272 TraceCheckUtils]: 33: Hoare triple {9436#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9436#true} {9436#true} #68#return; {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,659 INFO L272 TraceCheckUtils]: 28: Hoare triple {9436#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9436#true} {9436#true} #66#return; {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L272 TraceCheckUtils]: 23: Hoare triple {9436#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9436#true} {9436#true} #64#return; {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L272 TraceCheckUtils]: 18: Hoare triple {9436#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9436#true} {9436#true} #62#return; {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L272 TraceCheckUtils]: 13: Hoare triple {9436#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {9436#true} assume !false; {9436#true} is VALID [2022-04-14 15:16:27,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {9436#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9436#true} is VALID [2022-04-14 15:16:27,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9436#true} {9436#true} #60#return; {9436#true} is VALID [2022-04-14 15:16:27,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {9436#true} assume !(0 == ~cond); {9436#true} is VALID [2022-04-14 15:16:27,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {9436#true} ~cond := #in~cond; {9436#true} is VALID [2022-04-14 15:16:27,661 INFO L272 TraceCheckUtils]: 6: Hoare triple {9436#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {9436#true} is VALID [2022-04-14 15:16:27,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {9436#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; {9436#true} is VALID [2022-04-14 15:16:27,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {9436#true} call #t~ret5 := main(); {9436#true} is VALID [2022-04-14 15:16:27,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9436#true} {9436#true} #84#return; {9436#true} is VALID [2022-04-14 15:16:27,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {9436#true} assume true; {9436#true} is VALID [2022-04-14 15:16:27,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {9436#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); {9436#true} is VALID [2022-04-14 15:16:27,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {9436#true} call ULTIMATE.init(); {9436#true} is VALID [2022-04-14 15:16:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 204 proven. 34 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2022-04-14 15:16:27,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:27,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94033090] [2022-04-14 15:16:27,662 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:27,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990637481] [2022-04-14 15:16:27,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990637481] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:16:27,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:16:27,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-14 15:16:27,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924240658] [2022-04-14 15:16:27,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:16:27,663 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Word has length 134 [2022-04-14 15:16:27,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:27,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-04-14 15:16:30,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 103 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:30,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-14 15:16:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:30,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-14 15:16:30,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-04-14 15:16:30,310 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-04-14 15:16:36,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:47,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:55,399 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2022-04-14 15:16:55,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-14 15:16:55,399 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Word has length 134 [2022-04-14 15:16:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-04-14 15:16:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-14 15:16:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-04-14 15:16:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-14 15:16:55,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 53 transitions. [2022-04-14 15:16:56,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:56,097 INFO L225 Difference]: With dead ends: 119 [2022-04-14 15:16:56,097 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 15:16:56,098 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2022-04-14 15:16:56,098 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 85 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:56,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 121 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 246 Invalid, 1 Unknown, 0 Unchecked, 12.9s Time] [2022-04-14 15:16:56,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 15:16:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 15:16:56,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:56,099 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-14 15:16:56,099 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-14 15:16:56,099 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-14 15:16:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:56,099 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 15:16:56,099 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 15:16:56,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:56,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:56,100 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-14 15:16:56,100 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-14 15:16:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:56,100 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 15:16:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 15:16:56,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:56,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:56,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:56,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:56,100 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-14 15:16:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 15:16:56,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2022-04-14 15:16:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:56,100 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 15:16:56,101 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-04-14 15:16:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 15:16:56,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:56,103 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 15:16:56,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-14 15:16:56,307 WARN L460 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-14 15:16:56,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-14 15:16:59,848 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-14 15:16:59,848 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-14 15:16:59,848 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-14 15:16:59,848 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-14 15:16:59,849 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-14 15:16:59,849 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-14 15:16:59,849 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-14 15:16:59,849 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* 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_~n~0 main_~n~0 main_~n~0) main_~x~0)) [2022-04-14 15:16:59,849 INFO L878 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (<= main_~a~0 20) (= (+ (* 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) (<= .cse1 (+ main_~a~0 1)) (< main_~a~0 .cse1))) (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)))) [2022-04-14 15:16:59,849 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 22 56) no Hoare annotation was computed. [2022-04-14 15:16:59,849 INFO L878 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-14 15:16:59,849 INFO L878 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-14 15:16:59,850 INFO L878 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (<= main_~a~0 20) (= (+ (* 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) (<= .cse1 (+ main_~a~0 1)) (< main_~a~0 .cse1))) (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)))) [2022-04-14 15:16:59,850 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 22 56) no Hoare annotation was computed. [2022-04-14 15:16:59,850 INFO L882 garLoopResultBuilder]: For program point L38(lines 33 46) no Hoare annotation was computed. [2022-04-14 15:16:59,850 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (* main_~y~0 12))) (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ .cse0 (* main_~z~0 6))) (= (+ (* main_~x~0 18) .cse0 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))) [2022-04-14 15:16:59,850 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* 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_~n~0 main_~n~0 main_~n~0) main_~x~0)) [2022-04-14 15:16:59,850 INFO L878 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* 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_~n~0 main_~n~0 main_~n~0) main_~x~0)) [2022-04-14 15:16:59,850 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 56) the Hoare annotation is: true [2022-04-14 15:16:59,850 INFO L878 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-14 15:16:59,851 INFO L882 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-04-14 15:16:59,851 INFO L882 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-04-14 15:16:59,851 INFO L878 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-14 15:16:59,851 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (or (and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* main_~n~0 6) 6) main_~z~0) (= main_~z~0 6)) (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)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= .cse2 (+ main_~a~0 1)) (= .cse1 main_~x~0) (< main_~a~0 .cse2)))) [2022-04-14 15:16:59,851 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (* main_~y~0 12))) (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ .cse0 (* main_~z~0 6))) (= (+ (* main_~x~0 18) .cse0 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))) [2022-04-14 15:16:59,851 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* main_~y~0 12))) (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ .cse0 (* main_~z~0 6))) (= (+ (* main_~x~0 18) .cse0 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))) [2022-04-14 15:16:59,852 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-14 15:16:59,852 INFO L878 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-14 15:16:59,852 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-14 15:16:59,852 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-14 15:16:59,852 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-14 15:16:59,852 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-14 15:16:59,852 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-14 15:16:59,852 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-14 15:16:59,852 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-14 15:16:59,852 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-14 15:16:59,852 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-14 15:16:59,852 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-14 15:16:59,852 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-14 15:16:59,854 INFO L719 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1] [2022-04-14 15:16:59,856 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 15:16:59,859 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 15:16:59,859 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 15:16:59,875 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-14 15:16:59,877 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 15:16:59,880 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:16:59,880 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:16:59,880 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:16:59,880 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:16:59,880 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:16:59,880 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:16:59,880 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:16:59,880 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:16:59,880 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:16:59,880 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:16:59,880 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:16:59,880 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 15:16:59,881 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 15:16:59,881 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 15:16:59,881 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-14 15:16:59,881 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-14 15:16:59,881 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 15:16:59,881 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 15:16:59,881 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-14 15:16:59,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 03:16:59 BoogieIcfgContainer [2022-04-14 15:16:59,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 15:16:59,894 INFO L158 Benchmark]: Toolchain (without parser) took 210537.62ms. Allocated memory was 202.4MB in the beginning and 351.3MB in the end (delta: 148.9MB). Free memory was 151.3MB in the beginning and 186.8MB in the end (delta: -35.5MB). Peak memory consumption was 185.6MB. Max. memory is 8.0GB. [2022-04-14 15:16:59,895 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 202.4MB. Free memory was 167.7MB in the beginning and 167.6MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 15:16:59,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.14ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 151.1MB in the beginning and 217.7MB in the end (delta: -66.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 15:16:59,896 INFO L158 Benchmark]: Boogie Preprocessor took 43.01ms. Allocated memory is still 243.3MB. Free memory was 217.7MB in the beginning and 216.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 15:16:59,896 INFO L158 Benchmark]: RCFGBuilder took 215.82ms. Allocated memory is still 243.3MB. Free memory was 216.3MB in the beginning and 204.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 15:16:59,896 INFO L158 Benchmark]: TraceAbstraction took 210002.10ms. Allocated memory was 243.3MB in the beginning and 351.3MB in the end (delta: 108.0MB). Free memory was 204.1MB in the beginning and 186.8MB in the end (delta: 17.3MB). Peak memory consumption was 197.4MB. Max. memory is 8.0GB. [2022-04-14 15:16:59,899 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.08ms. Allocated memory is still 202.4MB. Free memory was 167.7MB in the beginning and 167.6MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.14ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 151.1MB in the beginning and 217.7MB in the end (delta: -66.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.01ms. Allocated memory is still 243.3MB. Free memory was 217.7MB in the beginning and 216.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 215.82ms. Allocated memory is still 243.3MB. Free memory was 216.3MB in the beginning and 204.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 210002.10ms. Allocated memory was 243.3MB in the beginning and 351.3MB in the end (delta: 108.0MB). Free memory was 204.1MB in the beginning and 186.8MB in the end (delta: 17.3MB). Peak memory consumption was 197.4MB. 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: 209.9s, OverallIterations: 15, TraceHistogramMax: 23, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 35.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 16.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 181 mSDsluCounter, 2025 SdHoareTripleChecker+Invalid, 16.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1423 mSDsCounter, 384 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2296 IncrementalHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 384 mSolverCounterUnsat, 602 mSDtfsCounter, 2296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1536 GetRequests, 1370 SyntacticMatches, 11 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 27.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=12, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 54 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 70 PreInvPairs, 115 NumberOfFragments, 656 HoareAnnotationTreeSize, 70 FomulaSimplifications, 2216 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 19 FomulaSimplificationsInter, 28968 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 162.8s InterpolantComputationTime, 985 NumberOfCodeBlocks, 796 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1342 ConstructedInterpolants, 0 QuantifiedInterpolants, 5769 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1921 ConjunctsInSsa, 259 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 5633/5874 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 && a <= 20) && n * 6 + 6 == z) && 0 <= a) && 3 * (n * n) + n * 3 + 1 == y) && n * n * n == x RESULT: Ultimate proved your program to be correct! [2022-04-14 15:16:59,948 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...