/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:54:39,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:54:39,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:54:39,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:54:39,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:54:39,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:54:39,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:54:39,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:54:39,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:54:39,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:54:39,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:54:39,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:54:39,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:54:39,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:54:39,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:54:39,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:54:39,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:54:39,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:54:39,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:54:39,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:54:39,358 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:54:39,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:54:39,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:54:39,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:54:39,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:54:39,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:54:39,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:54:39,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:54:39,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:54:39,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:54:39,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:54:39,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:54:39,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:54:39,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:54:39,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:54:39,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:54:39,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:54:39,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:54:39,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:54:39,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:54:39,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:54:39,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:54:39,373 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-07 12:54:39,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:54:39,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:54:39,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:54:39,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:54:39,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:54:39,396 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:54:39,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:54:39,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:54:39,397 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:54:39,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:54:39,397 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:54:39,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:54:39,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:54:39,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:54:39,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:54:39,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:54:39,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:54:39,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:54:39,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:54:39,399 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:54:39,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:54:39,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:54:39,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:54:39,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:54:39,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:54:39,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:54:39,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:54:39,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:54:39,400 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:54:39,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:54:39,400 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:54:39,400 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:54:39,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:54:39,400 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-07 12:54:39,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:54:39,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:54:39,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:54:39,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:54:39,591 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:54:39,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-04-07 12:54:39,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e44655e/b13ecd33c4f2462eb6ff29d4a7a12398/FLAG3a092d353 [2022-04-07 12:54:40,006 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:54:40,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-04-07 12:54:40,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e44655e/b13ecd33c4f2462eb6ff29d4a7a12398/FLAG3a092d353 [2022-04-07 12:54:40,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e44655e/b13ecd33c4f2462eb6ff29d4a7a12398 [2022-04-07 12:54:40,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:54:40,025 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:54:40,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:54:40,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:54:40,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:54:40,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:54:40" (1/1) ... [2022-04-07 12:54:40,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c22704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:54:40, skipping insertion in model container [2022-04-07 12:54:40,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:54:40" (1/1) ... [2022-04-07 12:54:40,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:54:40,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:54:40,189 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_unwindbound10.c[588,601] [2022-04-07 12:54:40,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:54:40,227 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:54:40,241 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_unwindbound10.c[588,601] [2022-04-07 12:54:40,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:54:40,259 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:54:40,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:54:40 WrapperNode [2022-04-07 12:54:40,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:54:40,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:54:40,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:54:40,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:54:40,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:54:40" (1/1) ... [2022-04-07 12:54:40,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:54:40" (1/1) ... [2022-04-07 12:54:40,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:54:40" (1/1) ... [2022-04-07 12:54:40,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:54:40" (1/1) ... [2022-04-07 12:54:40,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:54:40" (1/1) ... [2022-04-07 12:54:40,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:54:40" (1/1) ... [2022-04-07 12:54:40,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:54:40" (1/1) ... [2022-04-07 12:54:40,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:54:40,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:54:40,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:54:40,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:54:40,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:54:40" (1/1) ... [2022-04-07 12:54:40,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:54:40,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:54:40,327 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-07 12:54:40,329 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-07 12:54:40,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:54:40,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:54:40,359 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:54:40,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 12:54:40,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:54:40,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:54:40,359 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 12:54:40,359 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:54:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:54:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:54:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-07 12:54:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 12:54:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:54:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:54:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:54:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:54:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:54:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:54:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:54:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:54:40,402 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:54:40,403 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:54:40,525 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:54:40,529 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:54:40,529 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:54:40,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:54:40 BoogieIcfgContainer [2022-04-07 12:54:40,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:54:40,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:54:40,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:54:40,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:54:40,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:54:40" (1/3) ... [2022-04-07 12:54:40,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ef67c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:54:40, skipping insertion in model container [2022-04-07 12:54:40,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:54:40" (2/3) ... [2022-04-07 12:54:40,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ef67c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:54:40, skipping insertion in model container [2022-04-07 12:54:40,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:54:40" (3/3) ... [2022-04-07 12:54:40,536 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound10.c [2022-04-07 12:54:40,539 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:54:40,539 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:54:40,582 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:54:40,586 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-07 12:54:40,587 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:54:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:54:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 12:54:40,622 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:54:40,623 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:54:40,623 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:54:40,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:54:40,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-07 12:54:40,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:54:40,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549927848] [2022-04-07 12:54:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:40,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:54:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:40,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:54:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:40,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-07 12:54:40,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-07 12:54:40,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-07 12:54:40,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:54:40,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-07 12:54:40,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-07 12:54:40,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-07 12:54:40,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-07 12:54:40,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-07 12:54:40,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-07 12:54:40,794 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-07 12:54:40,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-07 12:54:40,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-07 12:54:40,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-07 12:54:40,795 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-07 12:54:40,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:54:40,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549927848] [2022-04-07 12:54:40,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549927848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:54:40,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:54:40,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 12:54:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288137633] [2022-04-07 12:54:40,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:54:40,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 12:54:40,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:54:40,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:40,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:40,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 12:54:40,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:54:40,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 12:54:40,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:54:40,847 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:41,047 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-07 12:54:41,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 12:54:41,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 12:54:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:54:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-07 12:54:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-07 12:54:41,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-07 12:54:41,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:41,184 INFO L225 Difference]: With dead ends: 57 [2022-04-07 12:54:41,185 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 12:54:41,189 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:54:41,192 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:54:41,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:54:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 12:54:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-07 12:54:41,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:54:41,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:54:41,219 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:54:41,219 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:54:41,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:41,226 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-07 12:54:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-07 12:54:41,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:41,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:41,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-07 12:54:41,229 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-07 12:54:41,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:41,232 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-07 12:54:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-07 12:54:41,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:41,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:41,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:54:41,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:54:41,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:54:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-07 12:54:41,238 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-07 12:54:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:54:41,238 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-07 12:54:41,239 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-07 12:54:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 12:54:41,243 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:54:41,243 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:54:41,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:54:41,246 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:54:41,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:54:41,247 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-07 12:54:41,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:54:41,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568515541] [2022-04-07 12:54:41,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:41,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:54:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:54:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:41,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:54:41,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:54:41,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:54:41,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:54:41,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:54:41,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:54:41,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:54:41,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#(= ~counter~0 0)} call #t~ret6 := main(); {232#(= ~counter~0 0)} is VALID [2022-04-07 12:54:41,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:54:41,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {233#(= |main_#t~post5| 0)} is VALID [2022-04-07 12:54:41,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {228#false} is VALID [2022-04-07 12:54:41,315 INFO L272 TraceCheckUtils]: 8: Hoare triple {228#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {228#false} is VALID [2022-04-07 12:54:41,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-07 12:54:41,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-07 12:54:41,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-07 12:54:41,315 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-07 12:54:41,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:54:41,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568515541] [2022-04-07 12:54:41,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568515541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:54:41,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:54:41,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 12:54:41,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986145393] [2022-04-07 12:54:41,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:54:41,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 12:54:41,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:54:41,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:41,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:54:41,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:54:41,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:54:41,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:54:41,326 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:41,486 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-07 12:54:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:54:41,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 12:54:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:54:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-07 12:54:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-07 12:54:41,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-07 12:54:41,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:41,534 INFO L225 Difference]: With dead ends: 40 [2022-04-07 12:54:41,534 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 12:54:41,534 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:54:41,535 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:54:41,536 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:54:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 12:54:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-07 12:54:41,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:54:41,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:54:41,540 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:54:41,540 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:54:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:41,542 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 12:54:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 12:54:41,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:41,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:41,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-07 12:54:41,543 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-07 12:54:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:41,545 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 12:54:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 12:54:41,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:41,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:41,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:54:41,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:54:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:54:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-07 12:54:41,547 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-07 12:54:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:54:41,547 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-07 12:54:41,548 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,548 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 12:54:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 12:54:41,548 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:54:41,548 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:54:41,548 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 12:54:41,548 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:54:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:54:41,549 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-07 12:54:41,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:54:41,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818294267] [2022-04-07 12:54:41,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:41,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:54:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:41,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:54:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:41,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {406#true} is VALID [2022-04-07 12:54:41,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-07 12:54:41,621 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-07 12:54:41,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:54:41,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {406#true} is VALID [2022-04-07 12:54:41,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-07 12:54:41,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-07 12:54:41,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret6 := main(); {406#true} is VALID [2022-04-07 12:54:41,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 12:54:41,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 12:54:41,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 10);havoc #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 12:54:41,624 INFO L272 TraceCheckUtils]: 8: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:54:41,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {413#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:54:41,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {407#false} is VALID [2022-04-07 12:54:41,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} assume !false; {407#false} is VALID [2022-04-07 12:54:41,625 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-07 12:54:41,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:54:41,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818294267] [2022-04-07 12:54:41,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818294267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:54:41,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:54:41,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 12:54:41,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677633933] [2022-04-07 12:54:41,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:54:41,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 12:54:41,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:54:41,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:41,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:54:41,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:54:41,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:54:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:54:41,636 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:41,938 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-07 12:54:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 12:54:41,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 12:54:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:54:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 12:54:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 12:54:41,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-07 12:54:41,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:41,978 INFO L225 Difference]: With dead ends: 34 [2022-04-07 12:54:41,978 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 12:54:41,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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-07 12:54:41,979 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:54:41,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:54:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 12:54:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 12:54:41,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:54:41,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:54:41,984 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:54:41,985 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:54:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:41,986 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 12:54:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:54:41,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:41,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:41,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-07 12:54:41,987 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-07 12:54:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:41,989 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 12:54:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:54:41,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:41,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:41,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:54:41,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:54:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:54:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-07 12:54:41,991 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-07 12:54:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:54:41,991 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-07 12:54:41,991 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:54:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:54:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:54:41,992 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:54:41,992 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:54:41,992 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 12:54:41,992 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:54:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:54:41,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-07 12:54:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:54:41,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551327766] [2022-04-07 12:54:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:54:42,002 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:54:42,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297383808] [2022-04-07 12:54:42,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:42,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:42,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:54:42,004 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-07 12:54:42,005 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-07 12:54:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:42,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:54:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:42,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:54:42,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-07 12:54:42,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {593#true} is VALID [2022-04-07 12:54:42,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-07 12:54:42,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #81#return; {593#true} is VALID [2022-04-07 12:54:42,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret6 := main(); {593#true} is VALID [2022-04-07 12:54:42,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:54:42,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:54:42,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:54:42,141 INFO L272 TraceCheckUtils]: 8: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {593#true} is VALID [2022-04-07 12:54:42,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#true} ~cond := #in~cond; {593#true} is VALID [2022-04-07 12:54:42,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#true} assume !(0 == ~cond); {593#true} is VALID [2022-04-07 12:54:42,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-07 12:54:42,142 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {593#true} {613#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:54:42,143 INFO L272 TraceCheckUtils]: 13: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:54:42,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:54:42,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {594#false} is VALID [2022-04-07 12:54:42,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-07 12:54:42,144 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-07 12:54:42,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:54:42,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:54:42,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551327766] [2022-04-07 12:54:42,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:54:42,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297383808] [2022-04-07 12:54:42,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297383808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:54:42,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:54:42,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:54:42,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542832417] [2022-04-07 12:54:42,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:54:42,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-07 12:54:42,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:54:42,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:54:42,158 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-07 12:54:42,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:54:42,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:54:42,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:54:42,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:54:42,159 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:54:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:51,585 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-07 12:54:51,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:54:51,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-07 12:54:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:54:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:54:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:54:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:54:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:54:51,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 12:54:51,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:51,641 INFO L225 Difference]: With dead ends: 50 [2022-04-07 12:54:51,642 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 12:54:51,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:54:51,643 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:54:51,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 139 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:54:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 12:54:51,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-07 12:54:51,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:54:51,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:54:51,649 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:54:51,650 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:54:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:51,652 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 12:54:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-07 12:54:51,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:51,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:51,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-07 12:54:51,653 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-07 12:54:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:51,655 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 12:54:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-07 12:54:51,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:51,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:51,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:54:51,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:54:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:54:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-07 12:54:51,657 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-07 12:54:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:54:51,657 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-07 12:54:51,657 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:54:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-07 12:54:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 12:54:51,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:54:51,658 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:54:51,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 12:54:51,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:51,859 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:54:51,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:54:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-07 12:54:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:54:51,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031016270] [2022-04-07 12:54:51,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:51,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:54:51,869 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:54:51,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1183872914] [2022-04-07 12:54:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:51,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:51,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:54:51,871 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-07 12:54:51,880 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-07 12:54:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:51,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:54:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:51,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:54:52,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2022-04-07 12:54:52,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {887#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {887#true} is VALID [2022-04-07 12:54:52,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-07 12:54:52,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #81#return; {887#true} is VALID [2022-04-07 12:54:52,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret6 := main(); {887#true} is VALID [2022-04-07 12:54:52,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {887#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:54:52,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:54:52,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:54:52,011 INFO L272 TraceCheckUtils]: 8: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {887#true} is VALID [2022-04-07 12:54:52,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-07 12:54:52,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-07 12:54:52,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-07 12:54:52,012 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:54:52,012 INFO L272 TraceCheckUtils]: 13: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {887#true} is VALID [2022-04-07 12:54:52,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-07 12:54:52,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-07 12:54:52,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-07 12:54:52,013 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:54:52,014 INFO L272 TraceCheckUtils]: 18: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {947#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:54:52,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {947#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:54:52,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {888#false} is VALID [2022-04-07 12:54:52,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {888#false} assume !false; {888#false} is VALID [2022-04-07 12:54:52,015 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-07 12:54:52,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:54:52,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:54:52,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031016270] [2022-04-07 12:54:52,015 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:54:52,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183872914] [2022-04-07 12:54:52,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183872914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:54:52,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:54:52,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:54:52,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144712230] [2022-04-07 12:54:52,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:54:52,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 12:54:52,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:54:52,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:54:52,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:52,028 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:54:52,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:54:52,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:54:52,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:54:52,029 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:54:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:52,261 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-07 12:54:52,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:54:52,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 12:54:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:54:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:54:52,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:54:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:54:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:54:52,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 12:54:52,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:52,318 INFO L225 Difference]: With dead ends: 54 [2022-04-07 12:54:52,318 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 12:54:52,318 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-07 12:54:52,318 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:54:52,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:54:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 12:54:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-07 12:54:52,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:54:52,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 12:54:52,326 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 12:54:52,326 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 12:54:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:52,328 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 12:54:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 12:54:52,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:52,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:52,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-07 12:54:52,329 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-07 12:54:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:52,331 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 12:54:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 12:54:52,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:52,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:52,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:54:52,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:54:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 12:54:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-07 12:54:52,334 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-07 12:54:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:54:52,334 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-07 12:54:52,334 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:54:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-07 12:54:52,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 12:54:52,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:54:52,334 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] [2022-04-07 12:54:52,351 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-07 12:54:52,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:52,551 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:54:52,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:54:52,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-07 12:54:52,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:54:52,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050683031] [2022-04-07 12:54:52,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:52,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:54:52,562 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:54:52,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939557002] [2022-04-07 12:54:52,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:52,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:52,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:54:52,566 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-07 12:54:52,610 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-07 12:54:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:52,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 12:54:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:52,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:54:52,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1225#true} is VALID [2022-04-07 12:54:52,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1225#true} is VALID [2022-04-07 12:54:52,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:54:52,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #81#return; {1225#true} is VALID [2022-04-07 12:54:52,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret6 := main(); {1225#true} is VALID [2022-04-07 12:54:52,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:52,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:52,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:52,761 INFO L272 TraceCheckUtils]: 8: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-07 12:54:52,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-07 12:54:52,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-07 12:54:52,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:54:52,762 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:52,762 INFO L272 TraceCheckUtils]: 13: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1225#true} is VALID [2022-04-07 12:54:52,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-07 12:54:52,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-07 12:54:52,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:54:52,763 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:52,763 INFO L272 TraceCheckUtils]: 18: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-07 12:54:52,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-07 12:54:52,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-07 12:54:52,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:54:52,766 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:52,766 INFO L272 TraceCheckUtils]: 23: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:54:52,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:54:52,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {1304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1226#false} is VALID [2022-04-07 12:54:52,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-07 12:54:52,768 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-07 12:54:52,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:54:52,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:54:52,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050683031] [2022-04-07 12:54:52,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:54:52,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939557002] [2022-04-07 12:54:52,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939557002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:54:52,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:54:52,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:54:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682465460] [2022-04-07 12:54:52,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:54:52,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-07 12:54:52,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:54:52,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:54:52,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:52,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:54:52,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:54:52,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:54:52,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:54:52,786 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:54:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:53,088 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-07 12:54:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:54:53,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-07 12:54:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:54:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:54:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:54:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:54:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:54:53,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 12:54:53,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:53,167 INFO L225 Difference]: With dead ends: 62 [2022-04-07 12:54:53,167 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 12:54:53,168 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-07 12:54:53,168 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:54:53,169 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:54:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 12:54:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-07 12:54:53,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:54:53,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 12:54:53,175 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 12:54:53,176 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 12:54:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:53,177 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 12:54:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 12:54:53,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:53,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:53,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-07 12:54:53,178 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-07 12:54:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:53,180 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 12:54:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 12:54:53,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:53,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:53,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:54:53,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:54:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 12:54:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-07 12:54:53,182 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-07 12:54:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:54:53,182 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-07 12:54:53,182 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:54:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 12:54:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 12:54:53,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:54:53,183 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:54:53,201 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-07 12:54:53,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:53,401 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:54:53,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:54:53,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-07 12:54:53,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:54:53,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252910767] [2022-04-07 12:54:53,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:53,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:54:53,412 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:54:53,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717743398] [2022-04-07 12:54:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:53,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:53,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:54:53,419 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-07 12:54:53,419 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-07 12:54:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:53,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:54:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:53,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:54:53,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-07 12:54:53,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:54:53,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#(<= ~counter~0 0)} assume true; {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:54:53,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1593#(<= ~counter~0 0)} {1585#true} #81#return; {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:54:53,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {1593#(<= ~counter~0 0)} call #t~ret6 := main(); {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:54:53,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {1593#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:54:53,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {1593#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {1609#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,670 INFO L272 TraceCheckUtils]: 8: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,680 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #59#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,681 INFO L272 TraceCheckUtils]: 13: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,682 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #61#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,682 INFO L272 TraceCheckUtils]: 18: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,683 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #63#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,684 INFO L272 TraceCheckUtils]: 23: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,685 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #65#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,685 INFO L272 TraceCheckUtils]: 28: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,687 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #67#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {1609#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:54:53,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {1609#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1694#(<= |main_#t~post5| 1)} is VALID [2022-04-07 12:54:53,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {1586#false} is VALID [2022-04-07 12:54:53,688 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1586#false} is VALID [2022-04-07 12:54:53,688 INFO L290 TraceCheckUtils]: 37: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-07 12:54:53,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {1586#false} assume !(0 == ~cond); {1586#false} is VALID [2022-04-07 12:54:53,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {1586#false} assume true; {1586#false} is VALID [2022-04-07 12:54:53,688 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1586#false} {1586#false} #69#return; {1586#false} is VALID [2022-04-07 12:54:53,688 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-07 12:54:53,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-07 12:54:53,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-07 12:54:53,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-07 12:54:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-07 12:54:53,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:54:53,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-07 12:54:53,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-07 12:54:53,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-07 12:54:53,886 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-07 12:54:53,886 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1585#true} {1586#false} #69#return; {1586#false} is VALID [2022-04-07 12:54:53,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:54:53,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:54:53,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:54:53,886 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-07 12:54:53,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {1752#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1586#false} is VALID [2022-04-07 12:54:53,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {1756#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1752#(< |main_#t~post5| 10)} is VALID [2022-04-07 12:54:53,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {1756#(< ~counter~0 10)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1756#(< ~counter~0 10)} is VALID [2022-04-07 12:54:53,888 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1585#true} {1756#(< ~counter~0 10)} #67#return; {1756#(< ~counter~0 10)} is VALID [2022-04-07 12:54:53,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:54:53,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:54:53,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:54:53,888 INFO L272 TraceCheckUtils]: 28: Hoare triple {1756#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1585#true} is VALID [2022-04-07 12:54:53,888 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1585#true} {1756#(< ~counter~0 10)} #65#return; {1756#(< ~counter~0 10)} is VALID [2022-04-07 12:54:53,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:54:53,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:54:53,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:54:53,889 INFO L272 TraceCheckUtils]: 23: Hoare triple {1756#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1585#true} is VALID [2022-04-07 12:54:53,889 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1585#true} {1756#(< ~counter~0 10)} #63#return; {1756#(< ~counter~0 10)} is VALID [2022-04-07 12:54:53,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:54:53,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:54:53,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:54:53,890 INFO L272 TraceCheckUtils]: 18: Hoare triple {1756#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-07 12:54:53,890 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1585#true} {1756#(< ~counter~0 10)} #61#return; {1756#(< ~counter~0 10)} is VALID [2022-04-07 12:54:53,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:54:53,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:54:53,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:54:53,893 INFO L272 TraceCheckUtils]: 13: Hoare triple {1756#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1585#true} is VALID [2022-04-07 12:54:53,898 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1585#true} {1756#(< ~counter~0 10)} #59#return; {1756#(< ~counter~0 10)} is VALID [2022-04-07 12:54:53,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:54:53,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:54:53,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:54:53,899 INFO L272 TraceCheckUtils]: 8: Hoare triple {1756#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-07 12:54:53,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {1756#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {1756#(< ~counter~0 10)} is VALID [2022-04-07 12:54:53,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1756#(< ~counter~0 10)} is VALID [2022-04-07 12:54:53,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#(< ~counter~0 9)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1841#(< ~counter~0 9)} is VALID [2022-04-07 12:54:53,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#(< ~counter~0 9)} call #t~ret6 := main(); {1841#(< ~counter~0 9)} is VALID [2022-04-07 12:54:53,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#(< ~counter~0 9)} {1585#true} #81#return; {1841#(< ~counter~0 9)} is VALID [2022-04-07 12:54:53,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#(< ~counter~0 9)} assume true; {1841#(< ~counter~0 9)} is VALID [2022-04-07 12:54:53,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1841#(< ~counter~0 9)} is VALID [2022-04-07 12:54:53,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-07 12:54:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 12:54:53,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:54:53,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252910767] [2022-04-07 12:54:53,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:54:53,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717743398] [2022-04-07 12:54:53,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717743398] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:54:53,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:54:53,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 12:54:53,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638392209] [2022-04-07 12:54:53,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:54:53,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-07 12:54:53,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:54:53,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-07 12:54:53,952 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-07 12:54:53,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:54:53,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:54:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:54:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:54:53,953 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-07 12:54:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:54,467 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-04-07 12:54:54,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 12:54:54,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-07 12:54:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:54:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-07 12:54:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-07 12:54:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-07 12:54:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-07 12:54:54,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 134 transitions. [2022-04-07 12:54:54,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:54,570 INFO L225 Difference]: With dead ends: 120 [2022-04-07 12:54:54,571 INFO L226 Difference]: Without dead ends: 104 [2022-04-07 12:54:54,571 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:54:54,571 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 65 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:54:54,571 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 194 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:54:54,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-07 12:54:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-07 12:54:54,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:54:54,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:54:54,601 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:54:54,601 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:54:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:54,604 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-07 12:54:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-07 12:54:54,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:54,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:54,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 104 states. [2022-04-07 12:54:54,605 INFO L87 Difference]: Start difference. First operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 104 states. [2022-04-07 12:54:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:54,609 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-07 12:54:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-07 12:54:54,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:54,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:54,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:54:54,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:54:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:54:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-04-07 12:54:54,612 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-04-07 12:54:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:54:54,613 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-04-07 12:54:54,613 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-07 12:54:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-04-07 12:54:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 12:54:54,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:54:54,614 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:54:54,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 12:54:54,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:54,827 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:54:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:54:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-07 12:54:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:54:54,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249152117] [2022-04-07 12:54:54,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:54:54,849 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:54:54,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2144536770] [2022-04-07 12:54:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:54,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:54,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:54:54,850 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-07 12:54:54,851 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-07 12:54:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:54,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:54:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:54,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:54:55,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-07 12:54:55,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2418#true} is VALID [2022-04-07 12:54:55,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-07 12:54:55,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-07 12:54:55,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:55,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:55,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:55,049 INFO L272 TraceCheckUtils]: 8: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:54:55,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:54:55,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:54:55,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,050 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:55,050 INFO L272 TraceCheckUtils]: 13: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2418#true} is VALID [2022-04-07 12:54:55,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:54:55,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:54:55,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,051 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:55,051 INFO L272 TraceCheckUtils]: 18: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:54:55,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:54:55,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:54:55,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,052 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:55,052 INFO L272 TraceCheckUtils]: 23: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:54:55,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:54:55,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:54:55,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,052 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:55,052 INFO L272 TraceCheckUtils]: 28: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2418#true} is VALID [2022-04-07 12:54:55,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:54:55,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:54:55,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,053 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:55,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:54:55,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:54:55,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:54:55,054 INFO L272 TraceCheckUtils]: 36: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:54:55,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:54:55,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:54:55,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,055 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2418#true} {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #59#return; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:54:55,055 INFO L272 TraceCheckUtils]: 41: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:54:55,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:54:55,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-07 12:54:55,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-07 12:54:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 12:54:55,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:54:55,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-07 12:54:55,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-07 12:54:55,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:54:55,202 INFO L272 TraceCheckUtils]: 41: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:54:55,202 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2418#true} {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:54:55,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:54:55,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:54:55,202 INFO L272 TraceCheckUtils]: 36: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:54:55,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 10);havoc #t~post5; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:54:55,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:54:55,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:54:55,207 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #67#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:54:55,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:54:55,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:54:55,207 INFO L272 TraceCheckUtils]: 28: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2418#true} is VALID [2022-04-07 12:54:55,208 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #65#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:54:55,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:54:55,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:54:55,208 INFO L272 TraceCheckUtils]: 23: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:54:55,209 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #63#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:54:55,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:54:55,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:54:55,209 INFO L272 TraceCheckUtils]: 18: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:54:55,209 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #61#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:54:55,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:54:55,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:54:55,210 INFO L272 TraceCheckUtils]: 13: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2418#true} is VALID [2022-04-07 12:54:55,210 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #59#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:54:55,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:54:55,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:54:55,210 INFO L272 TraceCheckUtils]: 8: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:54:55,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:54:55,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:54:55,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:54:55,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-07 12:54:55,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-07 12:54:55,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:54:55,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2418#true} is VALID [2022-04-07 12:54:55,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-07 12:54:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 12:54:55,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:54:55,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249152117] [2022-04-07 12:54:55,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:54:55,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144536770] [2022-04-07 12:54:55,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144536770] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:54:55,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:54:55,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:54:55,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276918155] [2022-04-07 12:54:55,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:54:55,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-07 12:54:55,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:54:55,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:54:55,257 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-07 12:54:55,257 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:54:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:54:55,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:54:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:54:55,257 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:54:55,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:55,885 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-07 12:54:55,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:54:55,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-07 12:54:55,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:54:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:54:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:54:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:54:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:54:55,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-07 12:54:55,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:55,974 INFO L225 Difference]: With dead ends: 118 [2022-04-07 12:54:55,974 INFO L226 Difference]: Without dead ends: 116 [2022-04-07 12:54:55,975 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 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-07 12:54:55,975 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:54:55,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 12:54:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-07 12:54:56,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-07 12:54:56,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:54:56,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:54:56,013 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:54:56,013 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:54:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:56,016 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-07 12:54:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-07 12:54:56,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:56,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:56,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 116 states. [2022-04-07 12:54:56,017 INFO L87 Difference]: Start difference. First operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 116 states. [2022-04-07 12:54:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:56,020 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-07 12:54:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-07 12:54:56,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:56,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:56,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:54:56,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:54:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:54:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-04-07 12:54:56,025 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-04-07 12:54:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:54:56,025 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-04-07 12:54:56,025 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:54:56,025 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-07 12:54:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-07 12:54:56,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:54:56,026 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:54:56,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 12:54:56,242 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:56,242 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:54:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:54:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 2 times [2022-04-07 12:54:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:54:56,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189938319] [2022-04-07 12:54:56,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:54:56,274 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:54:56,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [720155679] [2022-04-07 12:54:56,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:54:56,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:56,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:54:56,275 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-07 12:54:56,276 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-07 12:54:56,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:54:56,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:54:56,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:54:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:56,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:54:56,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-07 12:54:56,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3289#true} is VALID [2022-04-07 12:54:56,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-07 12:54:56,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-07 12:54:56,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:54:56,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:54:56,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:54:56,499 INFO L272 TraceCheckUtils]: 8: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,500 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #59#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:54:56,500 INFO L272 TraceCheckUtils]: 13: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,500 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #61#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:54:56,500 INFO L272 TraceCheckUtils]: 18: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,501 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #63#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:54:56,501 INFO L272 TraceCheckUtils]: 23: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,502 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #65#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:54:56,502 INFO L272 TraceCheckUtils]: 28: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,503 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #67#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:54:56,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 12:54:56,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 12:54:56,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 12:54:56,504 INFO L272 TraceCheckUtils]: 36: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,505 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3289#true} {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #59#return; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 12:54:56,505 INFO L272 TraceCheckUtils]: 41: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,505 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3289#true} {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #61#return; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 12:54:56,506 INFO L272 TraceCheckUtils]: 46: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:54:56,506 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:54:56,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-07 12:54:56,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-07 12:54:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-07 12:54:56,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:54:56,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-07 12:54:56,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-07 12:54:56,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:54:56,683 INFO L272 TraceCheckUtils]: 46: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:54:56,684 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3289#true} {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #61#return; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:54:56,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,684 INFO L272 TraceCheckUtils]: 41: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,684 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3289#true} {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #59#return; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:54:56,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,685 INFO L272 TraceCheckUtils]: 36: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !!(#t~post5 < 10);havoc #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:54:56,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:54:56,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:54:56,688 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #67#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:54:56,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,688 INFO L272 TraceCheckUtils]: 28: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,689 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #65#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:54:56,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,689 INFO L272 TraceCheckUtils]: 23: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,689 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #63#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:54:56,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,690 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,690 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #61#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:54:56,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,690 INFO L272 TraceCheckUtils]: 13: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,691 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #59#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:54:56,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:54:56,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:54:56,691 INFO L272 TraceCheckUtils]: 8: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:54:56,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(#t~post5 < 10);havoc #t~post5; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:54:56,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:54:56,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:54:56,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-07 12:54:56,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-07 12:54:56,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:54:56,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3289#true} is VALID [2022-04-07 12:54:56,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-07 12:54:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-07 12:54:56,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:54:56,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189938319] [2022-04-07 12:54:56,693 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:54:56,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720155679] [2022-04-07 12:54:56,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720155679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:54:56,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:54:56,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:54:56,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090025409] [2022-04-07 12:54:56,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:54:56,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-07 12:54:56,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:54:56,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 12:54:56,739 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-07 12:54:56,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:54:56,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:54:56,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:54:56,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:54:56,739 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 12:54:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:57,240 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-04-07 12:54:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:54:57,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-07 12:54:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:54:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 12:54:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-07 12:54:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 12:54:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-07 12:54:57,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-07 12:54:57,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:57,304 INFO L225 Difference]: With dead ends: 122 [2022-04-07 12:54:57,304 INFO L226 Difference]: Without dead ends: 120 [2022-04-07 12:54:57,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-07 12:54:57,304 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:54:57,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 232 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:54:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-07 12:54:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-07 12:54:57,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:54:57,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:54:57,338 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:54:57,338 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:54:57,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:57,341 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-07 12:54:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-07 12:54:57,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:57,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:57,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 120 states. [2022-04-07 12:54:57,342 INFO L87 Difference]: Start difference. First operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 120 states. [2022-04-07 12:54:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:57,345 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-07 12:54:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-07 12:54:57,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:57,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:57,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:54:57,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:54:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:54:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-07 12:54:57,348 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-04-07 12:54:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:54:57,348 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-07 12:54:57,348 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 12:54:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-07 12:54:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 12:54:57,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:54:57,348 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:54:57,367 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-07 12:54:57,565 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:57,565 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:54:57,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:54:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1909341660, now seen corresponding path program 3 times [2022-04-07 12:54:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:54:57,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420370986] [2022-04-07 12:54:57,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:54:57,575 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:54:57,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [95745839] [2022-04-07 12:54:57,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:54:57,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:57,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:54:57,586 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-07 12:54:57,586 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-07 12:54:57,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-07 12:54:57,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:54:57,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 12:54:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:57,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:54:57,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-07 12:54:57,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {4204#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4204#true} is VALID [2022-04-07 12:54:57,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:57,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-07 12:54:57,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-07 12:54:57,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {4204#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:57,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:57,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:57,892 INFO L272 TraceCheckUtils]: 8: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:57,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:57,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:57,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:57,893 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:57,893 INFO L272 TraceCheckUtils]: 13: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:57,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:57,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:57,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:57,894 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:57,894 INFO L272 TraceCheckUtils]: 18: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:57,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:57,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:57,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:57,895 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:57,895 INFO L272 TraceCheckUtils]: 23: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:57,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:57,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:57,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:57,895 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:57,895 INFO L272 TraceCheckUtils]: 28: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:57,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:57,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:57,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:57,896 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:54:57,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 12:54:57,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 12:54:57,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} assume !!(#t~post5 < 10);havoc #t~post5; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 12:54:57,897 INFO L272 TraceCheckUtils]: 36: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:57,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:57,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:57,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:57,898 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #59#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 12:54:57,898 INFO L272 TraceCheckUtils]: 41: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:57,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:57,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:57,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:57,899 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #61#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 12:54:57,899 INFO L272 TraceCheckUtils]: 46: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:57,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:57,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:57,899 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:57,900 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #63#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 12:54:57,900 INFO L272 TraceCheckUtils]: 51: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:54:57,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:54:57,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-07 12:54:57,901 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-07 12:54:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-07 12:54:57,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:54:58,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-07 12:54:58,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-07 12:54:58,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:54:58,230 INFO L272 TraceCheckUtils]: 51: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:54:58,230 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #63#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:54:58,231 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:58,231 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:58,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:58,231 INFO L272 TraceCheckUtils]: 46: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:58,231 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #61#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:54:58,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:58,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:58,231 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:58,231 INFO L272 TraceCheckUtils]: 41: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:58,232 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #59#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:54:58,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:58,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:58,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:58,232 INFO L272 TraceCheckUtils]: 36: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:58,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:54:58,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:54:58,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:54:58,236 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #67#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:54:58,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:58,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:58,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:58,236 INFO L272 TraceCheckUtils]: 28: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:58,237 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #65#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:54:58,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:58,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:58,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:58,237 INFO L272 TraceCheckUtils]: 23: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:58,237 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #63#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:54:58,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:58,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:58,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:58,238 INFO L272 TraceCheckUtils]: 18: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:58,238 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #61#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:54:58,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:58,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:58,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:58,238 INFO L272 TraceCheckUtils]: 13: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:58,239 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #59#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:54:58,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:58,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:54:58,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:54:58,239 INFO L272 TraceCheckUtils]: 8: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:54:58,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(#t~post5 < 10);havoc #t~post5; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:54:58,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:54:58,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {4204#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:54:58,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-07 12:54:58,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-07 12:54:58,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:54:58,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {4204#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4204#true} is VALID [2022-04-07 12:54:58,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-07 12:54:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-07 12:54:58,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:54:58,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420370986] [2022-04-07 12:54:58,241 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:54:58,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95745839] [2022-04-07 12:54:58,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95745839] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:54:58,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:54:58,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:54:58,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993418387] [2022-04-07 12:54:58,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:54:58,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-07 12:54:58,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:54:58,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 12:54:58,291 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-07 12:54:58,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:54:58,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:54:58,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:54:58,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:54:58,292 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 12:54:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:59,145 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-04-07 12:54:59,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:54:59,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-07 12:54:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:54:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 12:54:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:54:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 12:54:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:54:59,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-07 12:54:59,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:54:59,237 INFO L225 Difference]: With dead ends: 146 [2022-04-07 12:54:59,237 INFO L226 Difference]: Without dead ends: 135 [2022-04-07 12:54:59,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 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-07 12:54:59,238 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:54:59,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 12:54:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-07 12:54:59,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-07 12:54:59,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:54:59,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:54:59,273 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:54:59,273 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:54:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:59,275 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-07 12:54:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-07 12:54:59,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:59,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:59,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 135 states. [2022-04-07 12:54:59,276 INFO L87 Difference]: Start difference. First operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 135 states. [2022-04-07 12:54:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:54:59,278 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-07 12:54:59,278 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-07 12:54:59,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:54:59,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:54:59,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:54:59,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:54:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:54:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-04-07 12:54:59,281 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-04-07 12:54:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:54:59,281 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-04-07 12:54:59,281 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 12:54:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-07 12:54:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-07 12:54:59,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:54:59,282 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:54:59,298 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-07 12:54:59,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:59,498 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:54:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:54:59,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-07 12:54:59,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:54:59,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406169994] [2022-04-07 12:54:59,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:59,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:54:59,507 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:54:59,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454628439] [2022-04-07 12:54:59,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:54:59,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:54:59,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:54:59,508 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-07 12:54:59,508 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-07 12:54:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:59,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 12:54:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:54:59,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:55:06,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-07 12:55:06,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {5223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5223#true} is VALID [2022-04-07 12:55:06,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:06,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-07 12:55:06,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-07 12:55:06,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:55:06,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:55:06,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:55:06,626 INFO L272 TraceCheckUtils]: 8: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:06,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:06,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:06,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:06,629 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #59#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:55:06,629 INFO L272 TraceCheckUtils]: 13: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:06,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:06,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:06,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:06,630 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #61#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:55:06,630 INFO L272 TraceCheckUtils]: 18: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:06,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:06,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:06,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:06,630 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #63#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:55:06,630 INFO L272 TraceCheckUtils]: 23: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:06,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:06,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:06,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:06,631 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #65#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:55:06,631 INFO L272 TraceCheckUtils]: 28: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:06,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:06,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:06,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:06,632 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #67#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:55:06,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:06,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:06,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:06,633 INFO L272 TraceCheckUtils]: 36: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:06,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:06,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:06,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:06,634 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #59#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:06,634 INFO L272 TraceCheckUtils]: 41: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:06,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:06,634 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:06,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:06,635 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #61#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:06,635 INFO L272 TraceCheckUtils]: 46: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:06,635 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:06,635 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:06,635 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:06,636 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #63#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:06,636 INFO L272 TraceCheckUtils]: 51: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:06,636 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:06,636 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:06,636 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:06,636 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #65#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:06,636 INFO L272 TraceCheckUtils]: 56: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:06,636 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:06,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:06,637 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:06,637 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #67#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:06,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-07 12:55:06,638 INFO L272 TraceCheckUtils]: 62: Hoare triple {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:06,638 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:06,638 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:06,638 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:06,639 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5223#true} {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-07 12:55:06,640 INFO L272 TraceCheckUtils]: 67: Hoare triple {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:55:06,640 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:06,640 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-07 12:55:06,641 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-07 12:55:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-07 12:55:06,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:55:07,256 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-07 12:55:07,257 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-07 12:55:07,257 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:07,258 INFO L272 TraceCheckUtils]: 67: Hoare triple {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:55:07,258 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5223#true} {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} #69#return; {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-07 12:55:07,258 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:07,258 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:07,258 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:07,258 INFO L272 TraceCheckUtils]: 62: Hoare triple {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:07,259 INFO L290 TraceCheckUtils]: 61: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !(~n~0 <= ~a~0); {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-07 12:55:07,259 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #67#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:55:07,259 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:07,259 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:07,259 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:07,259 INFO L272 TraceCheckUtils]: 56: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:07,260 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #65#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:55:07,260 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:07,260 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:07,260 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:07,260 INFO L272 TraceCheckUtils]: 51: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:07,260 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #63#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:55:07,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:07,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:07,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:07,283 INFO L272 TraceCheckUtils]: 46: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:07,291 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #61#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:55:07,291 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:07,292 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:07,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:07,292 INFO L272 TraceCheckUtils]: 41: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:07,292 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #59#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:55:07,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:07,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:07,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:07,292 INFO L272 TraceCheckUtils]: 36: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:07,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !!(#t~post5 < 10);havoc #t~post5; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:55:07,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:55:07,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:55:07,296 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #67#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:55:07,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:07,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:07,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:07,296 INFO L272 TraceCheckUtils]: 28: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:07,297 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #65#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:55:07,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:07,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:07,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:07,297 INFO L272 TraceCheckUtils]: 23: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:07,298 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #63#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:55:07,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:07,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:07,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:07,298 INFO L272 TraceCheckUtils]: 18: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:07,299 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #61#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:55:07,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:07,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:07,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:07,300 INFO L272 TraceCheckUtils]: 13: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:07,311 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #59#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:55:07,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:07,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:55:07,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:55:07,311 INFO L272 TraceCheckUtils]: 8: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:55:07,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(#t~post5 < 10);havoc #t~post5; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:55:07,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:55:07,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:55:07,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-07 12:55:07,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-07 12:55:07,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:55:07,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {5223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5223#true} is VALID [2022-04-07 12:55:07,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-07 12:55:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-07 12:55:07,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:55:07,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406169994] [2022-04-07 12:55:07,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:55:07,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454628439] [2022-04-07 12:55:07,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454628439] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:55:07,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:55:07,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-07 12:55:07,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426924894] [2022-04-07 12:55:07,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:55:07,317 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-07 12:55:07,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:55:07,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 12:55:07,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:07,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 12:55:07,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:55:07,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 12:55:07,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:55:07,400 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 12:55:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:08,388 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-04-07 12:55:08,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 12:55:08,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-07 12:55:08,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:55:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 12:55:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-07 12:55:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 12:55:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-07 12:55:08,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-07 12:55:08,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:08,486 INFO L225 Difference]: With dead ends: 148 [2022-04-07 12:55:08,486 INFO L226 Difference]: Without dead ends: 144 [2022-04-07 12:55:08,487 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:55:08,487 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:55:08,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 189 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 12:55:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-07 12:55:08,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-07 12:55:08,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:55:08,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:55:08,566 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:55:08,567 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:55:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:08,571 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-07 12:55:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-07 12:55:08,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:55:08,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:55:08,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 144 states. [2022-04-07 12:55:08,574 INFO L87 Difference]: Start difference. First operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 144 states. [2022-04-07 12:55:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:08,576 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-07 12:55:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-07 12:55:08,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:55:08,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:55:08,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:55:08,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:55:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:55:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-04-07 12:55:08,579 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-04-07 12:55:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:55:08,579 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-04-07 12:55:08,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 12:55:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-04-07 12:55:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-07 12:55:08,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:55:08,584 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:55:08,601 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-07 12:55:08,799 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,SelfDestructingSolverStorable10 [2022-04-07 12:55:08,799 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:55:08,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:55:08,800 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-07 12:55:08,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:55:08,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115226577] [2022-04-07 12:55:08,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:55:08,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:55:08,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:55:08,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110040478] [2022-04-07 12:55:08,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:55:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:55:08,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:55:08,817 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-07 12:55:08,825 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-07 12:55:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:55:08,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 12:55:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:55:08,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:55:09,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {6368#true} call ULTIMATE.init(); {6368#true} is VALID [2022-04-07 12:55:09,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {6368#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6368#true} is VALID [2022-04-07 12:55:09,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6368#true} {6368#true} #81#return; {6368#true} is VALID [2022-04-07 12:55:09,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {6368#true} call #t~ret6 := main(); {6368#true} is VALID [2022-04-07 12:55:09,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {6368#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:55:09,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:55:09,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 10);havoc #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:55:09,432 INFO L272 TraceCheckUtils]: 8: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:55:09,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:55:09,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:55:09,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,432 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:55:09,433 INFO L272 TraceCheckUtils]: 13: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6368#true} is VALID [2022-04-07 12:55:09,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:55:09,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:55:09,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,435 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:55:09,435 INFO L272 TraceCheckUtils]: 18: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:55:09,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:55:09,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:55:09,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,436 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:55:09,437 INFO L272 TraceCheckUtils]: 23: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:55:09,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:55:09,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:55:09,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,437 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:55:09,437 INFO L272 TraceCheckUtils]: 28: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6368#true} is VALID [2022-04-07 12:55:09,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:55:09,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:55:09,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,438 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:55:09,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:09,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:09,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:09,440 INFO L272 TraceCheckUtils]: 36: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:55:09,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:55:09,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:55:09,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,440 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:09,440 INFO L272 TraceCheckUtils]: 41: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6368#true} is VALID [2022-04-07 12:55:09,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:55:09,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:55:09,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,441 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:09,441 INFO L272 TraceCheckUtils]: 46: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:55:09,441 INFO L290 TraceCheckUtils]: 47: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:55:09,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:55:09,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,442 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:09,442 INFO L272 TraceCheckUtils]: 51: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:55:09,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:55:09,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:55:09,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,443 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:09,443 INFO L272 TraceCheckUtils]: 56: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6368#true} is VALID [2022-04-07 12:55:09,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:55:09,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:55:09,443 INFO L290 TraceCheckUtils]: 59: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,443 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:55:09,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-07 12:55:09,444 INFO L272 TraceCheckUtils]: 62: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:55:09,444 INFO L290 TraceCheckUtils]: 63: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:55:09,444 INFO L290 TraceCheckUtils]: 64: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:55:09,444 INFO L290 TraceCheckUtils]: 65: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,445 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6368#true} {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-07 12:55:09,445 INFO L272 TraceCheckUtils]: 67: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:55:09,445 INFO L290 TraceCheckUtils]: 68: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:55:09,445 INFO L290 TraceCheckUtils]: 69: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:55:09,445 INFO L290 TraceCheckUtils]: 70: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:55:09,445 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6368#true} {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-07 12:55:09,446 INFO L272 TraceCheckUtils]: 72: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:55:09,447 INFO L290 TraceCheckUtils]: 73: Hoare triple {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:09,447 INFO L290 TraceCheckUtils]: 74: Hoare triple {6596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6369#false} is VALID [2022-04-07 12:55:09,447 INFO L290 TraceCheckUtils]: 75: Hoare triple {6369#false} assume !false; {6369#false} is VALID [2022-04-07 12:55:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-07 12:55:09,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:55:19,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:55:19,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115226577] [2022-04-07 12:55:19,231 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:55:19,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110040478] [2022-04-07 12:55:19,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110040478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:55:19,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:55:19,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-07 12:55:19,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287577279] [2022-04-07 12:55:19,231 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:55:19,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-07 12:55:19,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:55:19,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:55:19,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:19,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 12:55:19,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:55:19,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 12:55:19,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:55:19,270 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:55:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:19,836 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-04-07 12:55:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:55:19,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-07 12:55:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:55:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:55:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-07 12:55:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:55:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-07 12:55:19,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-07 12:55:19,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:19,896 INFO L225 Difference]: With dead ends: 143 [2022-04-07 12:55:19,896 INFO L226 Difference]: Without dead ends: 132 [2022-04-07 12:55:19,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:55:19,897 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:55:19,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:55:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-07 12:55:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-07 12:55:19,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:55:19,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:55:19,973 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:55:19,973 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:55:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:19,975 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-07 12:55:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-07 12:55:19,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:55:19,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:55:19,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-07 12:55:19,976 INFO L87 Difference]: Start difference. First operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-07 12:55:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:19,978 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-07 12:55:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-07 12:55:19,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:55:19,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:55:19,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:55:19,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:55:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:55:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-07 12:55:19,980 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-04-07 12:55:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:55:19,980 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-07 12:55:19,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:55:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-07 12:55:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-07 12:55:19,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:55:19,981 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:55:19,997 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-07 12:55:20,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:55:20,182 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:55:20,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:55:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1454229731, now seen corresponding path program 4 times [2022-04-07 12:55:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:55:20,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969229196] [2022-04-07 12:55:20,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:55:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:55:20,196 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:55:20,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294317095] [2022-04-07 12:55:20,196 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 12:55:20,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:55:20,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:55:20,198 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-07 12:55:20,199 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-07 12:55:21,226 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 12:55:21,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:55:21,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-07 12:55:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:55:21,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:55:22,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-07 12:55:22,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7397#true} is VALID [2022-04-07 12:55:22,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:22,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-07 12:55:22,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-07 12:55:22,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7397#true} is VALID [2022-04-07 12:55:22,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-07 12:55:22,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 10);havoc #t~post5; {7397#true} is VALID [2022-04-07 12:55:22,216 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:22,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:22,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:22,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:22,217 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-07 12:55:22,217 INFO L272 TraceCheckUtils]: 13: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:22,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:22,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:22,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:22,218 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #61#return; {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:55:22,218 INFO L272 TraceCheckUtils]: 18: Hoare triple {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:22,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:22,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:22,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:22,219 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:22,220 INFO L272 TraceCheckUtils]: 23: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:22,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:22,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:22,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:22,221 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:22,221 INFO L272 TraceCheckUtils]: 28: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:22,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:22,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:22,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:22,222 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:24,231 WARN L290 TraceCheckUtils]: 33: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is UNKNOWN [2022-04-07 12:55:24,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:24,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 10);havoc #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:24,233 INFO L272 TraceCheckUtils]: 36: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:24,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:24,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:24,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:24,233 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:24,233 INFO L272 TraceCheckUtils]: 41: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:24,234 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:24,234 INFO L290 TraceCheckUtils]: 43: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:24,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:24,235 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:24,235 INFO L272 TraceCheckUtils]: 46: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:24,235 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:24,235 INFO L290 TraceCheckUtils]: 48: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:24,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:24,236 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #63#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:24,236 INFO L272 TraceCheckUtils]: 51: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:24,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:24,237 INFO L290 TraceCheckUtils]: 53: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:24,237 INFO L290 TraceCheckUtils]: 54: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:24,237 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:24,238 INFO L272 TraceCheckUtils]: 56: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:24,238 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:24,238 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:24,238 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:24,238 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:26,239 WARN L290 TraceCheckUtils]: 61: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is UNKNOWN [2022-04-07 12:55:26,240 INFO L290 TraceCheckUtils]: 62: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:26,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 10);havoc #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:26,241 INFO L272 TraceCheckUtils]: 64: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:26,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:26,241 INFO L290 TraceCheckUtils]: 66: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:26,241 INFO L290 TraceCheckUtils]: 67: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:26,242 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:26,242 INFO L272 TraceCheckUtils]: 69: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:26,243 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:26,243 INFO L290 TraceCheckUtils]: 71: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:26,243 INFO L290 TraceCheckUtils]: 72: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:26,244 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:55:26,244 INFO L272 TraceCheckUtils]: 74: Hoare triple {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:55:26,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:26,245 INFO L290 TraceCheckUtils]: 76: Hoare triple {7634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-07 12:55:26,245 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-07 12:55:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 86 proven. 47 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-04-07 12:55:26,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:55:27,380 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-07 12:55:27,380 INFO L290 TraceCheckUtils]: 76: Hoare triple {7634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-07 12:55:27,381 INFO L290 TraceCheckUtils]: 75: Hoare triple {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:27,381 INFO L272 TraceCheckUtils]: 74: Hoare triple {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:55:27,382 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7653#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:55:27,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:27,382 INFO L290 TraceCheckUtils]: 71: Hoare triple {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:27,383 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:55:27,383 INFO L272 TraceCheckUtils]: 69: Hoare triple {7653#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:27,383 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7653#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:27,384 INFO L290 TraceCheckUtils]: 67: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:27,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:27,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:55:27,384 INFO L272 TraceCheckUtils]: 64: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:27,385 INFO L290 TraceCheckUtils]: 63: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 10);havoc #t~post5; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:27,385 INFO L290 TraceCheckUtils]: 62: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:27,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:27,394 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:27,394 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:27,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:27,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:27,394 INFO L272 TraceCheckUtils]: 56: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:27,398 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #65#return; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:55:27,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:27,399 INFO L290 TraceCheckUtils]: 53: Hoare triple {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:55:27,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:55:27,399 INFO L272 TraceCheckUtils]: 51: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:27,399 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-07 12:55:27,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:27,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:27,399 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:27,399 INFO L272 TraceCheckUtils]: 46: Hoare triple {7397#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:27,399 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L272 TraceCheckUtils]: 41: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L272 TraceCheckUtils]: 36: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {7397#true} assume !!(#t~post5 < 10);havoc #t~post5; {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {7397#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7397#true} #67#return; {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:27,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L272 TraceCheckUtils]: 28: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7397#true} {7397#true} #65#return; {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L272 TraceCheckUtils]: 23: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L272 TraceCheckUtils]: 18: Hoare triple {7397#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:27,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:27,402 INFO L272 TraceCheckUtils]: 13: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:27,402 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-07 12:55:27,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:27,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:55:27,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:55:27,415 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:55:27,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 10);havoc #t~post5; {7397#true} is VALID [2022-04-07 12:55:27,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-07 12:55:27,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7397#true} is VALID [2022-04-07 12:55:27,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-07 12:55:27,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-07 12:55:27,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:55:27,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7397#true} is VALID [2022-04-07 12:55:27,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-07 12:55:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-07 12:55:27,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:55:27,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969229196] [2022-04-07 12:55:27,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:55:27,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294317095] [2022-04-07 12:55:27,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294317095] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:55:27,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:55:27,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-07 12:55:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177613282] [2022-04-07 12:55:27,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:55:27,417 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 78 [2022-04-07 12:55:27,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:55:27,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-07 12:55:29,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:29,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 12:55:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:55:29,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 12:55:29,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-07 12:55:29,495 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-07 12:55:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:32,055 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-04-07 12:55:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:55:32,055 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 78 [2022-04-07 12:55:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:55:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-07 12:55:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-07 12:55:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-07 12:55:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-07 12:55:32,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-07 12:55:34,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:34,120 INFO L225 Difference]: With dead ends: 142 [2022-04-07 12:55:34,120 INFO L226 Difference]: Without dead ends: 138 [2022-04-07 12:55:34,121 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:55:34,121 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-07 12:55:34,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-07 12:55:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-07 12:55:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-07 12:55:34,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:55:34,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:55:34,201 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:55:34,201 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:55:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:34,212 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-07 12:55:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-07 12:55:34,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:55:34,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:55:34,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 138 states. [2022-04-07 12:55:34,214 INFO L87 Difference]: Start difference. First operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 138 states. [2022-04-07 12:55:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:34,217 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-07 12:55:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-07 12:55:34,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:55:34,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:55:34,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:55:34,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:55:34,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:55:34,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-07 12:55:34,220 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-04-07 12:55:34,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:55:34,220 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-07 12:55:34,223 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-07 12:55:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-07 12:55:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-07 12:55:34,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:55:34,227 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:55:34,239 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-07 12:55:34,433 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,SelfDestructingSolverStorable12 [2022-04-07 12:55:34,433 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:55:34,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:55:34,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 2 times [2022-04-07 12:55:34,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:55:34,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122968988] [2022-04-07 12:55:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:55:34,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:55:34,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:55:34,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1578315439] [2022-04-07 12:55:34,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:55:34,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:55:34,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:55:34,460 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-07 12:55:34,461 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-07 12:55:34,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:55:34,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:55:34,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 12:55:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:55:34,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:55:35,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {8553#true} call ULTIMATE.init(); {8553#true} is VALID [2022-04-07 12:55:35,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {8553#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8553#true} is VALID [2022-04-07 12:55:35,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8553#true} {8553#true} #81#return; {8553#true} is VALID [2022-04-07 12:55:35,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {8553#true} call #t~ret6 := main(); {8553#true} is VALID [2022-04-07 12:55:35,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {8553#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:35,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:35,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:35,154 INFO L272 TraceCheckUtils]: 8: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,155 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:35,155 INFO L272 TraceCheckUtils]: 13: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,156 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:35,156 INFO L272 TraceCheckUtils]: 18: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,156 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:35,157 INFO L272 TraceCheckUtils]: 23: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,157 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:35,157 INFO L272 TraceCheckUtils]: 28: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,158 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:35,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:55:35,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:55:35,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:55:35,159 INFO L272 TraceCheckUtils]: 36: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,160 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #59#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:55:35,160 INFO L272 TraceCheckUtils]: 41: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,160 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #61#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:55:35,161 INFO L272 TraceCheckUtils]: 46: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,161 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #63#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:55:35,161 INFO L272 TraceCheckUtils]: 51: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,161 INFO L290 TraceCheckUtils]: 52: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,161 INFO L290 TraceCheckUtils]: 53: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,161 INFO L290 TraceCheckUtils]: 54: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,162 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #65#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:55:35,162 INFO L272 TraceCheckUtils]: 56: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,162 INFO L290 TraceCheckUtils]: 57: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,162 INFO L290 TraceCheckUtils]: 59: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,163 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #67#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:55:35,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:55:35,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:55:35,164 INFO L290 TraceCheckUtils]: 63: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:55:35,164 INFO L272 TraceCheckUtils]: 64: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,164 INFO L290 TraceCheckUtils]: 65: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,164 INFO L290 TraceCheckUtils]: 66: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,164 INFO L290 TraceCheckUtils]: 67: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,165 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #59#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:55:35,165 INFO L272 TraceCheckUtils]: 69: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,165 INFO L290 TraceCheckUtils]: 70: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,165 INFO L290 TraceCheckUtils]: 71: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,165 INFO L290 TraceCheckUtils]: 72: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,165 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #61#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:55:35,165 INFO L272 TraceCheckUtils]: 74: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,165 INFO L290 TraceCheckUtils]: 75: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,166 INFO L290 TraceCheckUtils]: 76: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,166 INFO L290 TraceCheckUtils]: 77: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,166 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #63#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:55:35,166 INFO L272 TraceCheckUtils]: 79: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,166 INFO L290 TraceCheckUtils]: 80: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,166 INFO L290 TraceCheckUtils]: 81: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,166 INFO L290 TraceCheckUtils]: 82: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,167 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #65#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:55:35,167 INFO L272 TraceCheckUtils]: 84: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,167 INFO L290 TraceCheckUtils]: 85: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,167 INFO L290 TraceCheckUtils]: 86: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,167 INFO L290 TraceCheckUtils]: 87: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,168 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #67#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:55:35,168 INFO L290 TraceCheckUtils]: 89: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} assume !(~n~0 <= ~a~0); {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:55:35,168 INFO L272 TraceCheckUtils]: 90: Hoare triple {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,168 INFO L290 TraceCheckUtils]: 91: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,168 INFO L290 TraceCheckUtils]: 92: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,168 INFO L290 TraceCheckUtils]: 93: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,169 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8553#true} {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #69#return; {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:55:35,169 INFO L272 TraceCheckUtils]: 95: Hoare triple {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:55:35,169 INFO L290 TraceCheckUtils]: 96: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:55:35,169 INFO L290 TraceCheckUtils]: 97: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:55:35,169 INFO L290 TraceCheckUtils]: 98: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:55:35,169 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {8553#true} {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #71#return; {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:55:35,170 INFO L272 TraceCheckUtils]: 100: Hoare triple {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {8862#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:55:35,170 INFO L290 TraceCheckUtils]: 101: Hoare triple {8862#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8866#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:35,171 INFO L290 TraceCheckUtils]: 102: Hoare triple {8866#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8554#false} is VALID [2022-04-07 12:55:35,171 INFO L290 TraceCheckUtils]: 103: Hoare triple {8554#false} assume !false; {8554#false} is VALID [2022-04-07 12:55:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-07 12:55:35,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:55:40,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:55:40,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122968988] [2022-04-07 12:55:40,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:55:40,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578315439] [2022-04-07 12:55:40,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578315439] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:55:40,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:55:40,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-07 12:55:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646497778] [2022-04-07 12:55:40,826 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:55:40,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-07 12:55:40,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:55:40,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:55:40,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:40,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:55:40,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:55:40,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:55:40,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:55:40,877 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:55:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:41,645 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-07 12:55:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 12:55:41,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-07 12:55:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:55:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:55:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-07 12:55:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:55:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-07 12:55:41,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-07 12:55:41,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:41,729 INFO L225 Difference]: With dead ends: 140 [2022-04-07 12:55:41,729 INFO L226 Difference]: Without dead ends: 129 [2022-04-07 12:55:41,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-07 12:55:41,730 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:55:41,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 12:55:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-07 12:55:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-07 12:55:41,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:55:41,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 12:55:41,817 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 12:55:41,817 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 12:55:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:41,819 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-07 12:55:41,819 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-07 12:55:41,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:55:41,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:55:41,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-07 12:55:41,820 INFO L87 Difference]: Start difference. First operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-07 12:55:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:41,821 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-07 12:55:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-07 12:55:41,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:55:41,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:55:41,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:55:41,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:55:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 12:55:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-07 12:55:41,823 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-04-07 12:55:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:55:41,824 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-07 12:55:41,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:55:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-07 12:55:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-07 12:55:41,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:55:41,825 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:55:41,841 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-07 12:55:42,039 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,SelfDestructingSolverStorable13 [2022-04-07 12:55:42,039 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:55:42,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:55:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 2 times [2022-04-07 12:55:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:55:42,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850469165] [2022-04-07 12:55:42,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:55:42,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:55:42,050 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:55:42,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226751023] [2022-04-07 12:55:42,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:55:42,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:55:42,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:55:42,051 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-07 12:55:42,052 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-07 12:55:42,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:55:42,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:55:42,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-07 12:55:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:55:42,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:55:42,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {9649#true} call ULTIMATE.init(); {9649#true} is VALID [2022-04-07 12:55:42,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {9649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9649#true} is VALID [2022-04-07 12:55:42,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9649#true} {9649#true} #81#return; {9649#true} is VALID [2022-04-07 12:55:42,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {9649#true} call #t~ret6 := main(); {9649#true} is VALID [2022-04-07 12:55:42,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {9649#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:42,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:42,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:42,923 INFO L272 TraceCheckUtils]: 8: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,924 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:42,924 INFO L272 TraceCheckUtils]: 13: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,924 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:42,924 INFO L272 TraceCheckUtils]: 18: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,925 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:42,925 INFO L272 TraceCheckUtils]: 23: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,926 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:42,926 INFO L272 TraceCheckUtils]: 28: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,927 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:42,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:55:42,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:55:42,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:55:42,928 INFO L272 TraceCheckUtils]: 36: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,929 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #59#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:55:42,929 INFO L272 TraceCheckUtils]: 41: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,930 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #61#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:55:42,930 INFO L272 TraceCheckUtils]: 46: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,930 INFO L290 TraceCheckUtils]: 47: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,930 INFO L290 TraceCheckUtils]: 48: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,930 INFO L290 TraceCheckUtils]: 49: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,930 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #63#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:55:42,930 INFO L272 TraceCheckUtils]: 51: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,931 INFO L290 TraceCheckUtils]: 52: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,931 INFO L290 TraceCheckUtils]: 53: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,931 INFO L290 TraceCheckUtils]: 54: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,931 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #65#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:55:42,931 INFO L272 TraceCheckUtils]: 56: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,931 INFO L290 TraceCheckUtils]: 57: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,931 INFO L290 TraceCheckUtils]: 58: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,931 INFO L290 TraceCheckUtils]: 59: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,932 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #67#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:55:42,933 INFO L290 TraceCheckUtils]: 61: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:55:42,933 INFO L290 TraceCheckUtils]: 62: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:55:42,933 INFO L290 TraceCheckUtils]: 63: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:55:42,934 INFO L272 TraceCheckUtils]: 64: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,934 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #59#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:55:42,934 INFO L272 TraceCheckUtils]: 69: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,934 INFO L290 TraceCheckUtils]: 70: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,935 INFO L290 TraceCheckUtils]: 71: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,935 INFO L290 TraceCheckUtils]: 72: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,935 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #61#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:55:42,935 INFO L272 TraceCheckUtils]: 74: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,935 INFO L290 TraceCheckUtils]: 75: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,935 INFO L290 TraceCheckUtils]: 76: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,935 INFO L290 TraceCheckUtils]: 77: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,936 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #63#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:55:42,936 INFO L272 TraceCheckUtils]: 79: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,936 INFO L290 TraceCheckUtils]: 80: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,936 INFO L290 TraceCheckUtils]: 81: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,936 INFO L290 TraceCheckUtils]: 82: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,937 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #65#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:55:42,937 INFO L272 TraceCheckUtils]: 84: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,937 INFO L290 TraceCheckUtils]: 85: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,937 INFO L290 TraceCheckUtils]: 86: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,937 INFO L290 TraceCheckUtils]: 87: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,937 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #67#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:55:42,938 INFO L290 TraceCheckUtils]: 89: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:55:42,938 INFO L290 TraceCheckUtils]: 90: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:55:42,939 INFO L290 TraceCheckUtils]: 91: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} assume !!(#t~post5 < 10);havoc #t~post5; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:55:42,939 INFO L272 TraceCheckUtils]: 92: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,939 INFO L290 TraceCheckUtils]: 93: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,939 INFO L290 TraceCheckUtils]: 94: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,939 INFO L290 TraceCheckUtils]: 95: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,940 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #59#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:55:42,940 INFO L272 TraceCheckUtils]: 97: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,940 INFO L290 TraceCheckUtils]: 98: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,940 INFO L290 TraceCheckUtils]: 99: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,940 INFO L290 TraceCheckUtils]: 100: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,940 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #61#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:55:42,940 INFO L272 TraceCheckUtils]: 102: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,940 INFO L290 TraceCheckUtils]: 103: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,941 INFO L290 TraceCheckUtils]: 104: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,941 INFO L290 TraceCheckUtils]: 105: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,941 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #63#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:55:42,941 INFO L272 TraceCheckUtils]: 107: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,941 INFO L290 TraceCheckUtils]: 108: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,941 INFO L290 TraceCheckUtils]: 109: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,941 INFO L290 TraceCheckUtils]: 110: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,942 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #65#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:55:42,942 INFO L272 TraceCheckUtils]: 112: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,942 INFO L290 TraceCheckUtils]: 113: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,942 INFO L290 TraceCheckUtils]: 114: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,942 INFO L290 TraceCheckUtils]: 115: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,943 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #67#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:55:42,943 INFO L290 TraceCheckUtils]: 117: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} assume !(~n~0 <= ~a~0); {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} is VALID [2022-04-07 12:55:42,943 INFO L272 TraceCheckUtils]: 118: Hoare triple {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:55:42,943 INFO L290 TraceCheckUtils]: 119: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:55:42,943 INFO L290 TraceCheckUtils]: 120: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:55:42,943 INFO L290 TraceCheckUtils]: 121: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:55:42,944 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9649#true} {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} #69#return; {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} is VALID [2022-04-07 12:55:42,944 INFO L272 TraceCheckUtils]: 123: Hoare triple {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10028#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:55:42,945 INFO L290 TraceCheckUtils]: 124: Hoare triple {10028#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10032#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:42,945 INFO L290 TraceCheckUtils]: 125: Hoare triple {10032#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9650#false} is VALID [2022-04-07 12:55:42,945 INFO L290 TraceCheckUtils]: 126: Hoare triple {9650#false} assume !false; {9650#false} is VALID [2022-04-07 12:55:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-07 12:55:42,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:55:43,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:55:43,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850469165] [2022-04-07 12:55:43,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:55:43,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226751023] [2022-04-07 12:55:43,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226751023] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:55:43,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:55:43,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 12:55:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755977650] [2022-04-07 12:55:43,404 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:55:43,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-07 12:55:43,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:55:43,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-07 12:55:43,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:43,471 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 12:55:43,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:55:43,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 12:55:43,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:55:43,471 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-07 12:55:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:44,563 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-04-07 12:55:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:55:44,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-07 12:55:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:55:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-07 12:55:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:55:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-07 12:55:44,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:55:44,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-07 12:55:44,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:44,698 INFO L225 Difference]: With dead ends: 152 [2022-04-07 12:55:44,698 INFO L226 Difference]: Without dead ends: 150 [2022-04-07 12:55:44,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:55:44,699 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:55:44,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 12:55:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-07 12:55:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-07 12:55:44,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:55:44,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:55:44,780 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:55:44,780 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:55:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:44,783 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-07 12:55:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-07 12:55:44,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:55:44,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:55:44,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 150 states. [2022-04-07 12:55:44,783 INFO L87 Difference]: Start difference. First operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 150 states. [2022-04-07 12:55:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:44,787 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-07 12:55:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-07 12:55:44,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:55:44,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:55:44,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:55:44,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:55:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:55:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-04-07 12:55:44,789 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-04-07 12:55:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:55:44,790 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-04-07 12:55:44,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-07 12:55:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-04-07 12:55:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-07 12:55:44,791 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:55:44,791 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:55:44,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-07 12:55:45,007 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,SelfDestructingSolverStorable14 [2022-04-07 12:55:45,008 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:55:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:55:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 2 times [2022-04-07 12:55:45,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:55:45,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002586904] [2022-04-07 12:55:45,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:55:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:55:45,032 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:55:45,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836874464] [2022-04-07 12:55:45,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:55:45,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:55:45,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:55:45,033 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-07 12:55:45,034 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-07 12:55:45,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:55:45,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:55:45,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:55:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:55:45,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:55:45,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {10890#true} call ULTIMATE.init(); {10890#true} is VALID [2022-04-07 12:55:45,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {10890#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:55:45,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {10898#(<= ~counter~0 0)} assume true; {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:55:45,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10898#(<= ~counter~0 0)} {10890#true} #81#return; {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:55:45,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {10898#(<= ~counter~0 0)} call #t~ret6 := main(); {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:55:45,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {10898#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:55:45,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {10898#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {10914#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,388 INFO L272 TraceCheckUtils]: 8: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,388 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #59#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,389 INFO L272 TraceCheckUtils]: 13: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,389 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #61#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,390 INFO L272 TraceCheckUtils]: 18: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,390 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #63#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,391 INFO L272 TraceCheckUtils]: 23: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,392 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #65#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,392 INFO L272 TraceCheckUtils]: 28: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,393 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #67#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {10914#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:55:45,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {10914#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,394 INFO L272 TraceCheckUtils]: 36: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,394 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #59#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,395 INFO L272 TraceCheckUtils]: 41: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,395 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #61#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,396 INFO L272 TraceCheckUtils]: 46: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,396 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #63#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,397 INFO L272 TraceCheckUtils]: 51: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,397 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,397 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #65#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,398 INFO L272 TraceCheckUtils]: 56: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,399 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #67#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,399 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:55:45,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {10999#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,399 INFO L290 TraceCheckUtils]: 63: Hoare triple {11084#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,400 INFO L272 TraceCheckUtils]: 64: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,400 INFO L290 TraceCheckUtils]: 65: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,400 INFO L290 TraceCheckUtils]: 66: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,400 INFO L290 TraceCheckUtils]: 67: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,400 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #59#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,401 INFO L272 TraceCheckUtils]: 69: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,401 INFO L290 TraceCheckUtils]: 71: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,401 INFO L290 TraceCheckUtils]: 72: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,401 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #61#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,402 INFO L272 TraceCheckUtils]: 74: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,402 INFO L290 TraceCheckUtils]: 75: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,402 INFO L290 TraceCheckUtils]: 76: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,402 INFO L290 TraceCheckUtils]: 77: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,402 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #63#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,403 INFO L272 TraceCheckUtils]: 79: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,403 INFO L290 TraceCheckUtils]: 80: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,403 INFO L290 TraceCheckUtils]: 81: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,403 INFO L290 TraceCheckUtils]: 82: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,404 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #65#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,404 INFO L272 TraceCheckUtils]: 84: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,404 INFO L290 TraceCheckUtils]: 85: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,404 INFO L290 TraceCheckUtils]: 86: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,404 INFO L290 TraceCheckUtils]: 87: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,405 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #67#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,405 INFO L290 TraceCheckUtils]: 89: Hoare triple {11084#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:55:45,405 INFO L290 TraceCheckUtils]: 90: Hoare triple {11084#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,405 INFO L290 TraceCheckUtils]: 91: Hoare triple {11169#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,406 INFO L272 TraceCheckUtils]: 92: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,406 INFO L290 TraceCheckUtils]: 93: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,406 INFO L290 TraceCheckUtils]: 94: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,406 INFO L290 TraceCheckUtils]: 95: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,406 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #59#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,407 INFO L272 TraceCheckUtils]: 97: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,411 INFO L290 TraceCheckUtils]: 98: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,411 INFO L290 TraceCheckUtils]: 99: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,411 INFO L290 TraceCheckUtils]: 100: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,411 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #61#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,412 INFO L272 TraceCheckUtils]: 102: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,412 INFO L290 TraceCheckUtils]: 103: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,416 INFO L290 TraceCheckUtils]: 104: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,416 INFO L290 TraceCheckUtils]: 105: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,416 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #63#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,417 INFO L272 TraceCheckUtils]: 107: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,417 INFO L290 TraceCheckUtils]: 108: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,417 INFO L290 TraceCheckUtils]: 109: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,417 INFO L290 TraceCheckUtils]: 110: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,417 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #65#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,418 INFO L272 TraceCheckUtils]: 112: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,418 INFO L290 TraceCheckUtils]: 113: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,418 INFO L290 TraceCheckUtils]: 114: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,418 INFO L290 TraceCheckUtils]: 115: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,418 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #67#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,419 INFO L290 TraceCheckUtils]: 117: Hoare triple {11169#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:55:45,419 INFO L290 TraceCheckUtils]: 118: Hoare triple {11169#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11254#(<= |main_#t~post5| 4)} is VALID [2022-04-07 12:55:45,419 INFO L290 TraceCheckUtils]: 119: Hoare triple {11254#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {10891#false} is VALID [2022-04-07 12:55:45,419 INFO L272 TraceCheckUtils]: 120: Hoare triple {10891#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#false} is VALID [2022-04-07 12:55:45,419 INFO L290 TraceCheckUtils]: 121: Hoare triple {10891#false} ~cond := #in~cond; {10891#false} is VALID [2022-04-07 12:55:45,419 INFO L290 TraceCheckUtils]: 122: Hoare triple {10891#false} assume !(0 == ~cond); {10891#false} is VALID [2022-04-07 12:55:45,419 INFO L290 TraceCheckUtils]: 123: Hoare triple {10891#false} assume true; {10891#false} is VALID [2022-04-07 12:55:45,420 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10891#false} {10891#false} #69#return; {10891#false} is VALID [2022-04-07 12:55:45,420 INFO L272 TraceCheckUtils]: 125: Hoare triple {10891#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10891#false} is VALID [2022-04-07 12:55:45,420 INFO L290 TraceCheckUtils]: 126: Hoare triple {10891#false} ~cond := #in~cond; {10891#false} is VALID [2022-04-07 12:55:45,420 INFO L290 TraceCheckUtils]: 127: Hoare triple {10891#false} assume 0 == ~cond; {10891#false} is VALID [2022-04-07 12:55:45,420 INFO L290 TraceCheckUtils]: 128: Hoare triple {10891#false} assume !false; {10891#false} is VALID [2022-04-07 12:55:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-07 12:55:45,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:55:45,706 INFO L290 TraceCheckUtils]: 128: Hoare triple {10891#false} assume !false; {10891#false} is VALID [2022-04-07 12:55:45,707 INFO L290 TraceCheckUtils]: 127: Hoare triple {10891#false} assume 0 == ~cond; {10891#false} is VALID [2022-04-07 12:55:45,707 INFO L290 TraceCheckUtils]: 126: Hoare triple {10891#false} ~cond := #in~cond; {10891#false} is VALID [2022-04-07 12:55:45,707 INFO L272 TraceCheckUtils]: 125: Hoare triple {10891#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10891#false} is VALID [2022-04-07 12:55:45,707 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10890#true} {10891#false} #69#return; {10891#false} is VALID [2022-04-07 12:55:45,707 INFO L290 TraceCheckUtils]: 123: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,707 INFO L290 TraceCheckUtils]: 122: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,707 INFO L290 TraceCheckUtils]: 121: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,707 INFO L272 TraceCheckUtils]: 120: Hoare triple {10891#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,707 INFO L290 TraceCheckUtils]: 119: Hoare triple {11312#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {10891#false} is VALID [2022-04-07 12:55:45,708 INFO L290 TraceCheckUtils]: 118: Hoare triple {11316#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11312#(< |main_#t~post5| 10)} is VALID [2022-04-07 12:55:45,708 INFO L290 TraceCheckUtils]: 117: Hoare triple {11316#(< ~counter~0 10)} 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; {11316#(< ~counter~0 10)} is VALID [2022-04-07 12:55:45,708 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10890#true} {11316#(< ~counter~0 10)} #67#return; {11316#(< ~counter~0 10)} is VALID [2022-04-07 12:55:45,708 INFO L290 TraceCheckUtils]: 115: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,708 INFO L290 TraceCheckUtils]: 114: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,708 INFO L290 TraceCheckUtils]: 113: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,708 INFO L272 TraceCheckUtils]: 112: Hoare triple {11316#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,709 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10890#true} {11316#(< ~counter~0 10)} #65#return; {11316#(< ~counter~0 10)} is VALID [2022-04-07 12:55:45,709 INFO L290 TraceCheckUtils]: 110: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,709 INFO L290 TraceCheckUtils]: 109: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,709 INFO L290 TraceCheckUtils]: 108: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,709 INFO L272 TraceCheckUtils]: 107: Hoare triple {11316#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,709 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10890#true} {11316#(< ~counter~0 10)} #63#return; {11316#(< ~counter~0 10)} is VALID [2022-04-07 12:55:45,709 INFO L290 TraceCheckUtils]: 105: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,709 INFO L290 TraceCheckUtils]: 104: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,709 INFO L290 TraceCheckUtils]: 103: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,709 INFO L272 TraceCheckUtils]: 102: Hoare triple {11316#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,710 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10890#true} {11316#(< ~counter~0 10)} #61#return; {11316#(< ~counter~0 10)} is VALID [2022-04-07 12:55:45,710 INFO L290 TraceCheckUtils]: 100: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,710 INFO L290 TraceCheckUtils]: 99: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,710 INFO L290 TraceCheckUtils]: 98: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,710 INFO L272 TraceCheckUtils]: 97: Hoare triple {11316#(< ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,710 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10890#true} {11316#(< ~counter~0 10)} #59#return; {11316#(< ~counter~0 10)} is VALID [2022-04-07 12:55:45,714 INFO L290 TraceCheckUtils]: 95: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,714 INFO L290 TraceCheckUtils]: 94: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,714 INFO L290 TraceCheckUtils]: 93: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,714 INFO L272 TraceCheckUtils]: 92: Hoare triple {11316#(< ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,719 INFO L290 TraceCheckUtils]: 91: Hoare triple {11316#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {11316#(< ~counter~0 10)} is VALID [2022-04-07 12:55:45,720 INFO L290 TraceCheckUtils]: 90: Hoare triple {11401#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11316#(< ~counter~0 10)} is VALID [2022-04-07 12:55:45,720 INFO L290 TraceCheckUtils]: 89: Hoare triple {11401#(< ~counter~0 9)} 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; {11401#(< ~counter~0 9)} is VALID [2022-04-07 12:55:45,720 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10890#true} {11401#(< ~counter~0 9)} #67#return; {11401#(< ~counter~0 9)} is VALID [2022-04-07 12:55:45,721 INFO L290 TraceCheckUtils]: 87: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,721 INFO L290 TraceCheckUtils]: 86: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,721 INFO L290 TraceCheckUtils]: 85: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,721 INFO L272 TraceCheckUtils]: 84: Hoare triple {11401#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,721 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10890#true} {11401#(< ~counter~0 9)} #65#return; {11401#(< ~counter~0 9)} is VALID [2022-04-07 12:55:45,721 INFO L290 TraceCheckUtils]: 82: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,721 INFO L290 TraceCheckUtils]: 81: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,721 INFO L290 TraceCheckUtils]: 80: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,721 INFO L272 TraceCheckUtils]: 79: Hoare triple {11401#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,722 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10890#true} {11401#(< ~counter~0 9)} #63#return; {11401#(< ~counter~0 9)} is VALID [2022-04-07 12:55:45,722 INFO L290 TraceCheckUtils]: 77: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,722 INFO L290 TraceCheckUtils]: 76: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,722 INFO L290 TraceCheckUtils]: 75: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,722 INFO L272 TraceCheckUtils]: 74: Hoare triple {11401#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,722 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10890#true} {11401#(< ~counter~0 9)} #61#return; {11401#(< ~counter~0 9)} is VALID [2022-04-07 12:55:45,722 INFO L290 TraceCheckUtils]: 72: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,722 INFO L290 TraceCheckUtils]: 71: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,722 INFO L290 TraceCheckUtils]: 70: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,722 INFO L272 TraceCheckUtils]: 69: Hoare triple {11401#(< ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,723 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10890#true} {11401#(< ~counter~0 9)} #59#return; {11401#(< ~counter~0 9)} is VALID [2022-04-07 12:55:45,723 INFO L290 TraceCheckUtils]: 67: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,723 INFO L290 TraceCheckUtils]: 66: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,723 INFO L272 TraceCheckUtils]: 64: Hoare triple {11401#(< ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {11401#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {11401#(< ~counter~0 9)} is VALID [2022-04-07 12:55:45,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {11486#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11401#(< ~counter~0 9)} is VALID [2022-04-07 12:55:45,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {11486#(< ~counter~0 8)} 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; {11486#(< ~counter~0 8)} is VALID [2022-04-07 12:55:45,724 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10890#true} {11486#(< ~counter~0 8)} #67#return; {11486#(< ~counter~0 8)} is VALID [2022-04-07 12:55:45,724 INFO L290 TraceCheckUtils]: 59: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,725 INFO L272 TraceCheckUtils]: 56: Hoare triple {11486#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,725 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10890#true} {11486#(< ~counter~0 8)} #65#return; {11486#(< ~counter~0 8)} is VALID [2022-04-07 12:55:45,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,735 INFO L272 TraceCheckUtils]: 51: Hoare triple {11486#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,736 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10890#true} {11486#(< ~counter~0 8)} #63#return; {11486#(< ~counter~0 8)} is VALID [2022-04-07 12:55:45,736 INFO L290 TraceCheckUtils]: 49: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,736 INFO L290 TraceCheckUtils]: 48: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,736 INFO L290 TraceCheckUtils]: 47: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,736 INFO L272 TraceCheckUtils]: 46: Hoare triple {11486#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,736 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10890#true} {11486#(< ~counter~0 8)} #61#return; {11486#(< ~counter~0 8)} is VALID [2022-04-07 12:55:45,736 INFO L290 TraceCheckUtils]: 44: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,736 INFO L290 TraceCheckUtils]: 43: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,736 INFO L290 TraceCheckUtils]: 42: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,737 INFO L272 TraceCheckUtils]: 41: Hoare triple {11486#(< ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,751 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10890#true} {11486#(< ~counter~0 8)} #59#return; {11486#(< ~counter~0 8)} is VALID [2022-04-07 12:55:45,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,752 INFO L272 TraceCheckUtils]: 36: Hoare triple {11486#(< ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {11486#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {11486#(< ~counter~0 8)} is VALID [2022-04-07 12:55:45,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {11571#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11486#(< ~counter~0 8)} is VALID [2022-04-07 12:55:45,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {11571#(< ~counter~0 7)} 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; {11571#(< ~counter~0 7)} is VALID [2022-04-07 12:55:45,753 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10890#true} {11571#(< ~counter~0 7)} #67#return; {11571#(< ~counter~0 7)} is VALID [2022-04-07 12:55:45,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,753 INFO L272 TraceCheckUtils]: 28: Hoare triple {11571#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,753 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10890#true} {11571#(< ~counter~0 7)} #65#return; {11571#(< ~counter~0 7)} is VALID [2022-04-07 12:55:45,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,754 INFO L272 TraceCheckUtils]: 23: Hoare triple {11571#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,754 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10890#true} {11571#(< ~counter~0 7)} #63#return; {11571#(< ~counter~0 7)} is VALID [2022-04-07 12:55:45,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,754 INFO L272 TraceCheckUtils]: 18: Hoare triple {11571#(< ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,754 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10890#true} {11571#(< ~counter~0 7)} #61#return; {11571#(< ~counter~0 7)} is VALID [2022-04-07 12:55:45,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,769 INFO L272 TraceCheckUtils]: 13: Hoare triple {11571#(< ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,770 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10890#true} {11571#(< ~counter~0 7)} #59#return; {11571#(< ~counter~0 7)} is VALID [2022-04-07 12:55:45,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:55:45,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:55:45,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:55:45,770 INFO L272 TraceCheckUtils]: 8: Hoare triple {11571#(< ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:55:45,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {11571#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {11571#(< ~counter~0 7)} is VALID [2022-04-07 12:55:45,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {11656#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11571#(< ~counter~0 7)} is VALID [2022-04-07 12:55:45,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {11656#(< ~counter~0 6)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {11656#(< ~counter~0 6)} is VALID [2022-04-07 12:55:45,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {11656#(< ~counter~0 6)} call #t~ret6 := main(); {11656#(< ~counter~0 6)} is VALID [2022-04-07 12:55:45,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11656#(< ~counter~0 6)} {10890#true} #81#return; {11656#(< ~counter~0 6)} is VALID [2022-04-07 12:55:45,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {11656#(< ~counter~0 6)} assume true; {11656#(< ~counter~0 6)} is VALID [2022-04-07 12:55:45,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {10890#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11656#(< ~counter~0 6)} is VALID [2022-04-07 12:55:45,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {10890#true} call ULTIMATE.init(); {10890#true} is VALID [2022-04-07 12:55:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-07 12:55:45,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:55:45,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002586904] [2022-04-07 12:55:45,773 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:55:45,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836874464] [2022-04-07 12:55:45,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836874464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:55:45,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:55:45,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-07 12:55:45,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030913006] [2022-04-07 12:55:45,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:55:45,774 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-04-07 12:55:45,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:55:45,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-07 12:55:45,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:45,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 12:55:45,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:55:45,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 12:55:45,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:55:45,846 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-07 12:55:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:47,226 INFO L93 Difference]: Finished difference Result 368 states and 388 transitions. [2022-04-07 12:55:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-07 12:55:47,226 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-04-07 12:55:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:55:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-07 12:55:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-04-07 12:55:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-07 12:55:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-04-07 12:55:47,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 241 transitions. [2022-04-07 12:55:47,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:47,481 INFO L225 Difference]: With dead ends: 368 [2022-04-07 12:55:47,481 INFO L226 Difference]: Without dead ends: 353 [2022-04-07 12:55:47,483 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-07 12:55:47,483 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 125 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:55:47,483 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 279 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 12:55:47,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-07 12:55:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-04-07 12:55:47,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:55:47,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-07 12:55:47,623 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-07 12:55:47,623 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-07 12:55:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:47,629 INFO L93 Difference]: Finished difference Result 353 states and 367 transitions. [2022-04-07 12:55:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2022-04-07 12:55:47,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:55:47,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:55:47,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) Second operand 353 states. [2022-04-07 12:55:47,631 INFO L87 Difference]: Start difference. First operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) Second operand 353 states. [2022-04-07 12:55:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:55:47,636 INFO L93 Difference]: Finished difference Result 353 states and 367 transitions. [2022-04-07 12:55:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2022-04-07 12:55:47,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:55:47,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:55:47,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:55:47,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:55:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-07 12:55:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-04-07 12:55:47,643 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-04-07 12:55:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:55:47,643 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-04-07 12:55:47,643 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-07 12:55:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-04-07 12:55:47,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-07 12:55:47,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:55:47,645 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:55:47,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-07 12:55:47,860 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,SelfDestructingSolverStorable15 [2022-04-07 12:55:47,860 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:55:47,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:55:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-04-07 12:55:47,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:55:47,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281271650] [2022-04-07 12:55:47,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:55:47,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:55:47,897 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:55:47,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [904544063] [2022-04-07 12:55:47,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:55:47,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:55:47,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:55:47,908 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:55:47,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-07 12:55:48,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 12:55:48,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:55:48,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:55:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:55:48,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:55:48,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {13358#true} call ULTIMATE.init(); {13358#true} is VALID [2022-04-07 12:55:48,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {13358#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13358#true} is VALID [2022-04-07 12:55:48,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13358#true} {13358#true} #81#return; {13358#true} is VALID [2022-04-07 12:55:48,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {13358#true} call #t~ret6 := main(); {13358#true} is VALID [2022-04-07 12:55:48,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {13358#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:48,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:48,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:48,951 INFO L272 TraceCheckUtils]: 8: Hoare triple {13378#(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)); {13358#true} is VALID [2022-04-07 12:55:48,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,952 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13358#true} {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:48,952 INFO L272 TraceCheckUtils]: 13: Hoare triple {13378#(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)); {13358#true} is VALID [2022-04-07 12:55:48,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,952 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13358#true} {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:48,952 INFO L272 TraceCheckUtils]: 18: Hoare triple {13378#(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)); {13358#true} is VALID [2022-04-07 12:55:48,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,953 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13358#true} {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:48,953 INFO L272 TraceCheckUtils]: 23: Hoare triple {13378#(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)); {13358#true} is VALID [2022-04-07 12:55:48,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,954 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13358#true} {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:48,954 INFO L272 TraceCheckUtils]: 28: Hoare triple {13378#(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)); {13358#true} is VALID [2022-04-07 12:55:48,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,954 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13358#true} {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {13378#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:55:48,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {13378#(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; {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:55:48,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:55:48,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:55:48,956 INFO L272 TraceCheckUtils]: 36: Hoare triple {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,956 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13358#true} {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #59#return; {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:55:48,956 INFO L272 TraceCheckUtils]: 41: Hoare triple {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,956 INFO L290 TraceCheckUtils]: 42: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,957 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13358#true} {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #61#return; {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:55:48,957 INFO L272 TraceCheckUtils]: 46: Hoare triple {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,958 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13358#true} {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #63#return; {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:55:48,958 INFO L272 TraceCheckUtils]: 51: Hoare triple {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,958 INFO L290 TraceCheckUtils]: 52: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,958 INFO L290 TraceCheckUtils]: 53: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,958 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13358#true} {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #65#return; {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:55:48,958 INFO L272 TraceCheckUtils]: 56: Hoare triple {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,959 INFO L290 TraceCheckUtils]: 59: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,959 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13358#true} {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #67#return; {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:55:48,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {13463#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:55:48,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:55:48,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:55:48,960 INFO L272 TraceCheckUtils]: 64: Hoare triple {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,961 INFO L290 TraceCheckUtils]: 65: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,961 INFO L290 TraceCheckUtils]: 66: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,961 INFO L290 TraceCheckUtils]: 67: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,961 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13358#true} {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #59#return; {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:55:48,961 INFO L272 TraceCheckUtils]: 69: Hoare triple {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,961 INFO L290 TraceCheckUtils]: 70: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,961 INFO L290 TraceCheckUtils]: 71: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,961 INFO L290 TraceCheckUtils]: 72: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,962 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13358#true} {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #61#return; {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:55:48,962 INFO L272 TraceCheckUtils]: 74: Hoare triple {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,962 INFO L290 TraceCheckUtils]: 75: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,962 INFO L290 TraceCheckUtils]: 76: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,962 INFO L290 TraceCheckUtils]: 77: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,963 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13358#true} {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #63#return; {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:55:48,963 INFO L272 TraceCheckUtils]: 79: Hoare triple {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,963 INFO L290 TraceCheckUtils]: 80: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,963 INFO L290 TraceCheckUtils]: 81: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,963 INFO L290 TraceCheckUtils]: 82: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,963 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13358#true} {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #65#return; {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:55:48,964 INFO L272 TraceCheckUtils]: 84: Hoare triple {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,964 INFO L290 TraceCheckUtils]: 85: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,964 INFO L290 TraceCheckUtils]: 86: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,964 INFO L290 TraceCheckUtils]: 87: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,964 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13358#true} {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #67#return; {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:55:48,965 INFO L290 TraceCheckUtils]: 89: Hoare triple {13548#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:55:48,965 INFO L290 TraceCheckUtils]: 90: Hoare triple {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:55:48,966 INFO L290 TraceCheckUtils]: 91: Hoare triple {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:55:48,966 INFO L272 TraceCheckUtils]: 92: Hoare triple {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,966 INFO L290 TraceCheckUtils]: 93: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,966 INFO L290 TraceCheckUtils]: 94: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,966 INFO L290 TraceCheckUtils]: 95: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,966 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13358#true} {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #59#return; {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:55:48,966 INFO L272 TraceCheckUtils]: 97: Hoare triple {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,967 INFO L290 TraceCheckUtils]: 98: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,967 INFO L290 TraceCheckUtils]: 99: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,967 INFO L290 TraceCheckUtils]: 100: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,967 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13358#true} {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #61#return; {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:55:48,967 INFO L272 TraceCheckUtils]: 102: Hoare triple {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,967 INFO L290 TraceCheckUtils]: 103: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,967 INFO L290 TraceCheckUtils]: 104: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,967 INFO L290 TraceCheckUtils]: 105: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,968 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13358#true} {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #63#return; {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:55:48,968 INFO L272 TraceCheckUtils]: 107: Hoare triple {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,968 INFO L290 TraceCheckUtils]: 108: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,968 INFO L290 TraceCheckUtils]: 109: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,968 INFO L290 TraceCheckUtils]: 110: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,969 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13358#true} {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #65#return; {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:55:48,969 INFO L272 TraceCheckUtils]: 112: Hoare triple {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,969 INFO L290 TraceCheckUtils]: 113: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,969 INFO L290 TraceCheckUtils]: 114: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,969 INFO L290 TraceCheckUtils]: 115: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,970 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13358#true} {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #67#return; {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:55:48,970 INFO L290 TraceCheckUtils]: 117: Hoare triple {13633#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} assume !(~n~0 <= ~a~0); {13718#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:55:48,970 INFO L272 TraceCheckUtils]: 118: Hoare triple {13718#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,970 INFO L290 TraceCheckUtils]: 119: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,970 INFO L290 TraceCheckUtils]: 120: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,970 INFO L290 TraceCheckUtils]: 121: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,971 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13358#true} {13718#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} #69#return; {13718#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:55:48,971 INFO L272 TraceCheckUtils]: 123: Hoare triple {13718#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {13358#true} is VALID [2022-04-07 12:55:48,971 INFO L290 TraceCheckUtils]: 124: Hoare triple {13358#true} ~cond := #in~cond; {13358#true} is VALID [2022-04-07 12:55:48,971 INFO L290 TraceCheckUtils]: 125: Hoare triple {13358#true} assume !(0 == ~cond); {13358#true} is VALID [2022-04-07 12:55:48,971 INFO L290 TraceCheckUtils]: 126: Hoare triple {13358#true} assume true; {13358#true} is VALID [2022-04-07 12:55:48,971 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {13358#true} {13718#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} #71#return; {13718#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:55:48,972 INFO L272 TraceCheckUtils]: 128: Hoare triple {13718#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {13752#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:55:48,972 INFO L290 TraceCheckUtils]: 129: Hoare triple {13752#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13756#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:55:48,973 INFO L290 TraceCheckUtils]: 130: Hoare triple {13756#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13359#false} is VALID [2022-04-07 12:55:48,973 INFO L290 TraceCheckUtils]: 131: Hoare triple {13359#false} assume !false; {13359#false} is VALID [2022-04-07 12:55:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-07 12:55:48,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:55:59,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:55:59,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281271650] [2022-04-07 12:55:59,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:55:59,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904544063] [2022-04-07 12:55:59,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904544063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:55:59,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:55:59,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 12:55:59,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827587789] [2022-04-07 12:55:59,074 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:55:59,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-07 12:55:59,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:55:59,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-07 12:55:59,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:55:59,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 12:55:59,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:55:59,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 12:55:59,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:55:59,137 INFO L87 Difference]: Start difference. First operand 311 states and 326 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-07 12:56:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:00,148 INFO L93 Difference]: Finished difference Result 313 states and 327 transitions. [2022-04-07 12:56:00,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:56:00,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-07 12:56:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-07 12:56:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:56:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-07 12:56:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:56:00,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-07 12:56:00,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:00,309 INFO L225 Difference]: With dead ends: 313 [2022-04-07 12:56:00,309 INFO L226 Difference]: Without dead ends: 302 [2022-04-07 12:56:00,309 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:56:00,310 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:00,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 12:56:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-07 12:56:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-04-07 12:56:00,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:00,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-07 12:56:00,474 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-07 12:56:00,474 INFO L87 Difference]: Start difference. First operand 302 states. Second operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-07 12:56:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:00,478 INFO L93 Difference]: Finished difference Result 302 states and 315 transitions. [2022-04-07 12:56:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-07 12:56:00,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:00,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:00,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) Second operand 302 states. [2022-04-07 12:56:00,480 INFO L87 Difference]: Start difference. First operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) Second operand 302 states. [2022-04-07 12:56:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:00,487 INFO L93 Difference]: Finished difference Result 302 states and 315 transitions. [2022-04-07 12:56:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-07 12:56:00,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:00,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:00,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:00,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-07 12:56:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-04-07 12:56:00,493 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-04-07 12:56:00,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:00,493 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-04-07 12:56:00,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-07 12:56:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-07 12:56:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-07 12:56:00,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:00,494 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:00,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-07 12:56:00,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:00,699 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:00,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1020857049, now seen corresponding path program 3 times [2022-04-07 12:56:00,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:00,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629862705] [2022-04-07 12:56:00,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:00,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:00,724 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:00,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394807106] [2022-04-07 12:56:00,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:56:00,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:00,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:00,725 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:56:00,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-07 12:56:01,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-07 12:56:01,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:56:01,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:56:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:01,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:03,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {15373#true} call ULTIMATE.init(); {15373#true} is VALID [2022-04-07 12:56:03,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {15373#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15373#true} is VALID [2022-04-07 12:56:03,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15373#true} {15373#true} #81#return; {15373#true} is VALID [2022-04-07 12:56:03,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {15373#true} call #t~ret6 := main(); {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {15373#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {15373#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {15373#true} assume !!(#t~post5 < 10);havoc #t~post5; {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L272 TraceCheckUtils]: 8: Hoare triple {15373#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15373#true} {15373#true} #59#return; {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L272 TraceCheckUtils]: 13: Hoare triple {15373#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15373#true} {15373#true} #61#return; {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L272 TraceCheckUtils]: 18: Hoare triple {15373#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15373#true} {15373#true} #63#return; {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L272 TraceCheckUtils]: 23: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15373#true} {15373#true} #65#return; {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L272 TraceCheckUtils]: 28: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15373#true} {15373#true} #67#return; {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {15373#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; {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {15373#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {15373#true} assume !!(#t~post5 < 10);havoc #t~post5; {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L272 TraceCheckUtils]: 36: Hoare triple {15373#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15373#true} {15373#true} #59#return; {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L272 TraceCheckUtils]: 41: Hoare triple {15373#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L290 TraceCheckUtils]: 44: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15373#true} {15373#true} #61#return; {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L272 TraceCheckUtils]: 46: Hoare triple {15373#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15373#true} {15373#true} #63#return; {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L272 TraceCheckUtils]: 51: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L290 TraceCheckUtils]: 52: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15373#true} {15373#true} #65#return; {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L272 TraceCheckUtils]: 56: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L290 TraceCheckUtils]: 58: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L290 TraceCheckUtils]: 59: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15373#true} {15373#true} #67#return; {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L290 TraceCheckUtils]: 61: Hoare triple {15373#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; {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L290 TraceCheckUtils]: 62: Hoare triple {15373#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L290 TraceCheckUtils]: 63: Hoare triple {15373#true} assume !!(#t~post5 < 10);havoc #t~post5; {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L272 TraceCheckUtils]: 64: Hoare triple {15373#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L290 TraceCheckUtils]: 65: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L290 TraceCheckUtils]: 66: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L290 TraceCheckUtils]: 67: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15373#true} {15373#true} #59#return; {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L272 TraceCheckUtils]: 69: Hoare triple {15373#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,090 INFO L290 TraceCheckUtils]: 70: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L290 TraceCheckUtils]: 71: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L290 TraceCheckUtils]: 72: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15373#true} {15373#true} #61#return; {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L272 TraceCheckUtils]: 74: Hoare triple {15373#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L290 TraceCheckUtils]: 75: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L290 TraceCheckUtils]: 77: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {15373#true} {15373#true} #63#return; {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L272 TraceCheckUtils]: 79: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L290 TraceCheckUtils]: 80: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L290 TraceCheckUtils]: 81: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L290 TraceCheckUtils]: 82: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {15373#true} {15373#true} #65#return; {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L272 TraceCheckUtils]: 84: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L290 TraceCheckUtils]: 85: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L290 TraceCheckUtils]: 86: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,091 INFO L290 TraceCheckUtils]: 87: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15373#true} {15373#true} #67#return; {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L290 TraceCheckUtils]: 89: Hoare triple {15373#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; {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L290 TraceCheckUtils]: 90: Hoare triple {15373#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L290 TraceCheckUtils]: 91: Hoare triple {15373#true} assume !!(#t~post5 < 10);havoc #t~post5; {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L272 TraceCheckUtils]: 92: Hoare triple {15373#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L290 TraceCheckUtils]: 93: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L290 TraceCheckUtils]: 94: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L290 TraceCheckUtils]: 95: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15373#true} {15373#true} #59#return; {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L272 TraceCheckUtils]: 97: Hoare triple {15373#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L290 TraceCheckUtils]: 98: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L290 TraceCheckUtils]: 99: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L290 TraceCheckUtils]: 100: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15373#true} {15373#true} #61#return; {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L272 TraceCheckUtils]: 102: Hoare triple {15373#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,092 INFO L290 TraceCheckUtils]: 103: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L290 TraceCheckUtils]: 104: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L290 TraceCheckUtils]: 105: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {15373#true} {15373#true} #63#return; {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L272 TraceCheckUtils]: 107: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L290 TraceCheckUtils]: 108: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L290 TraceCheckUtils]: 109: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L290 TraceCheckUtils]: 110: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {15373#true} {15373#true} #65#return; {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L272 TraceCheckUtils]: 112: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L290 TraceCheckUtils]: 113: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L290 TraceCheckUtils]: 114: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L290 TraceCheckUtils]: 115: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,093 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15373#true} {15373#true} #67#return; {15373#true} is VALID [2022-04-07 12:56:03,094 INFO L290 TraceCheckUtils]: 117: Hoare triple {15373#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; {15729#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-07 12:56:03,095 INFO L290 TraceCheckUtils]: 118: Hoare triple {15729#(<= main_~n~0 (+ main_~a~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15729#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-07 12:56:03,095 INFO L290 TraceCheckUtils]: 119: Hoare triple {15729#(<= main_~n~0 (+ main_~a~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {15729#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-07 12:56:03,095 INFO L272 TraceCheckUtils]: 120: Hoare triple {15729#(<= main_~n~0 (+ main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,095 INFO L290 TraceCheckUtils]: 121: Hoare triple {15373#true} ~cond := #in~cond; {15742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:03,096 INFO L290 TraceCheckUtils]: 122: Hoare triple {15742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:03,096 INFO L290 TraceCheckUtils]: 123: Hoare triple {15746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:03,096 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {15746#(not (= |__VERIFIER_assert_#in~cond| 0))} {15729#(<= main_~n~0 (+ main_~a~0 1))} #59#return; {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-07 12:56:03,097 INFO L272 TraceCheckUtils]: 125: Hoare triple {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,097 INFO L290 TraceCheckUtils]: 126: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,097 INFO L290 TraceCheckUtils]: 127: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,097 INFO L290 TraceCheckUtils]: 128: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,097 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15373#true} {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #61#return; {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-07 12:56:03,097 INFO L272 TraceCheckUtils]: 130: Hoare triple {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,097 INFO L290 TraceCheckUtils]: 131: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,097 INFO L290 TraceCheckUtils]: 132: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,097 INFO L290 TraceCheckUtils]: 133: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,098 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {15373#true} {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #63#return; {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-07 12:56:03,098 INFO L272 TraceCheckUtils]: 135: Hoare triple {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,098 INFO L290 TraceCheckUtils]: 136: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,098 INFO L290 TraceCheckUtils]: 137: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,098 INFO L290 TraceCheckUtils]: 138: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,098 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {15373#true} {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #65#return; {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-07 12:56:03,099 INFO L272 TraceCheckUtils]: 140: Hoare triple {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,099 INFO L290 TraceCheckUtils]: 141: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,099 INFO L290 TraceCheckUtils]: 142: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,099 INFO L290 TraceCheckUtils]: 143: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,099 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {15373#true} {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #67#return; {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-07 12:56:03,100 INFO L290 TraceCheckUtils]: 145: Hoare triple {15753#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} assume !(~n~0 <= ~a~0); {15817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-07 12:56:03,100 INFO L272 TraceCheckUtils]: 146: Hoare triple {15817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:03,100 INFO L290 TraceCheckUtils]: 147: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:03,100 INFO L290 TraceCheckUtils]: 148: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:03,101 INFO L290 TraceCheckUtils]: 149: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:03,101 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15373#true} {15817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #69#return; {15817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-07 12:56:03,526 INFO L272 TraceCheckUtils]: 151: Hoare triple {15817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {15836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:56:03,528 INFO L290 TraceCheckUtils]: 152: Hoare triple {15836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:03,528 INFO L290 TraceCheckUtils]: 153: Hoare triple {15840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15374#false} is VALID [2022-04-07 12:56:03,528 INFO L290 TraceCheckUtils]: 154: Hoare triple {15374#false} assume !false; {15374#false} is VALID [2022-04-07 12:56:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-07 12:56:03,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:56:04,678 INFO L290 TraceCheckUtils]: 154: Hoare triple {15374#false} assume !false; {15374#false} is VALID [2022-04-07 12:56:04,678 INFO L290 TraceCheckUtils]: 153: Hoare triple {15840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15374#false} is VALID [2022-04-07 12:56:04,679 INFO L290 TraceCheckUtils]: 152: Hoare triple {15836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:05,284 INFO L272 TraceCheckUtils]: 151: Hoare triple {15817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {15836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:56:05,285 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15373#true} {15817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #69#return; {15817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-07 12:56:05,285 INFO L290 TraceCheckUtils]: 149: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,285 INFO L290 TraceCheckUtils]: 148: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,285 INFO L290 TraceCheckUtils]: 147: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,285 INFO L272 TraceCheckUtils]: 146: Hoare triple {15817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,286 INFO L290 TraceCheckUtils]: 145: Hoare triple {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {15817#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-07 12:56:05,286 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {15373#true} {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #67#return; {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:56:05,286 INFO L290 TraceCheckUtils]: 143: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,286 INFO L290 TraceCheckUtils]: 142: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,286 INFO L290 TraceCheckUtils]: 141: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,286 INFO L272 TraceCheckUtils]: 140: Hoare triple {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= 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)); {15373#true} is VALID [2022-04-07 12:56:05,287 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {15373#true} {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #65#return; {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:56:05,287 INFO L290 TraceCheckUtils]: 138: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,287 INFO L290 TraceCheckUtils]: 137: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,287 INFO L290 TraceCheckUtils]: 136: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,287 INFO L272 TraceCheckUtils]: 135: Hoare triple {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= 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)); {15373#true} is VALID [2022-04-07 12:56:05,287 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {15373#true} {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #63#return; {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:56:05,288 INFO L290 TraceCheckUtils]: 133: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,288 INFO L290 TraceCheckUtils]: 132: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,288 INFO L290 TraceCheckUtils]: 131: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,288 INFO L272 TraceCheckUtils]: 130: Hoare triple {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,288 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15373#true} {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #61#return; {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:56:05,288 INFO L290 TraceCheckUtils]: 128: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,288 INFO L290 TraceCheckUtils]: 127: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,288 INFO L290 TraceCheckUtils]: 126: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,288 INFO L272 TraceCheckUtils]: 125: Hoare triple {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= 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)); {15373#true} is VALID [2022-04-07 12:56:05,290 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {15746#(not (= |__VERIFIER_assert_#in~cond| 0))} {15938#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} #59#return; {15874#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:56:05,290 INFO L290 TraceCheckUtils]: 123: Hoare triple {15746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:05,291 INFO L290 TraceCheckUtils]: 122: Hoare triple {15948#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:05,291 INFO L290 TraceCheckUtils]: 121: Hoare triple {15373#true} ~cond := #in~cond; {15948#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:56:05,291 INFO L272 TraceCheckUtils]: 120: Hoare triple {15938#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,291 INFO L290 TraceCheckUtils]: 119: Hoare triple {15938#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {15938#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-07 12:56:05,292 INFO L290 TraceCheckUtils]: 118: Hoare triple {15938#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15938#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-07 12:56:05,293 INFO L290 TraceCheckUtils]: 117: Hoare triple {15373#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; {15938#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-07 12:56:05,293 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15373#true} {15373#true} #67#return; {15373#true} is VALID [2022-04-07 12:56:05,293 INFO L290 TraceCheckUtils]: 115: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,293 INFO L290 TraceCheckUtils]: 114: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,293 INFO L290 TraceCheckUtils]: 113: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,293 INFO L272 TraceCheckUtils]: 112: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,293 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {15373#true} {15373#true} #65#return; {15373#true} is VALID [2022-04-07 12:56:05,293 INFO L290 TraceCheckUtils]: 110: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,293 INFO L290 TraceCheckUtils]: 109: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,293 INFO L290 TraceCheckUtils]: 108: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,293 INFO L272 TraceCheckUtils]: 107: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,293 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {15373#true} {15373#true} #63#return; {15373#true} is VALID [2022-04-07 12:56:05,293 INFO L290 TraceCheckUtils]: 105: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L290 TraceCheckUtils]: 104: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L290 TraceCheckUtils]: 103: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L272 TraceCheckUtils]: 102: Hoare triple {15373#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15373#true} {15373#true} #61#return; {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L290 TraceCheckUtils]: 100: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L290 TraceCheckUtils]: 99: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L290 TraceCheckUtils]: 98: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L272 TraceCheckUtils]: 97: Hoare triple {15373#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15373#true} {15373#true} #59#return; {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L290 TraceCheckUtils]: 95: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L290 TraceCheckUtils]: 94: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L290 TraceCheckUtils]: 93: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L272 TraceCheckUtils]: 92: Hoare triple {15373#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L290 TraceCheckUtils]: 91: Hoare triple {15373#true} assume !!(#t~post5 < 10);havoc #t~post5; {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L290 TraceCheckUtils]: 90: Hoare triple {15373#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15373#true} is VALID [2022-04-07 12:56:05,294 INFO L290 TraceCheckUtils]: 89: Hoare triple {15373#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; {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15373#true} {15373#true} #67#return; {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L290 TraceCheckUtils]: 87: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L290 TraceCheckUtils]: 86: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L290 TraceCheckUtils]: 85: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L272 TraceCheckUtils]: 84: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {15373#true} {15373#true} #65#return; {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L290 TraceCheckUtils]: 82: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L290 TraceCheckUtils]: 81: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L290 TraceCheckUtils]: 80: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L272 TraceCheckUtils]: 79: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {15373#true} {15373#true} #63#return; {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L290 TraceCheckUtils]: 77: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L290 TraceCheckUtils]: 76: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L290 TraceCheckUtils]: 75: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L272 TraceCheckUtils]: 74: Hoare triple {15373#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,295 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15373#true} {15373#true} #61#return; {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L290 TraceCheckUtils]: 72: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L290 TraceCheckUtils]: 71: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L272 TraceCheckUtils]: 69: Hoare triple {15373#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15373#true} {15373#true} #59#return; {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L290 TraceCheckUtils]: 66: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L290 TraceCheckUtils]: 65: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L272 TraceCheckUtils]: 64: Hoare triple {15373#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {15373#true} assume !!(#t~post5 < 10);havoc #t~post5; {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L290 TraceCheckUtils]: 62: Hoare triple {15373#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L290 TraceCheckUtils]: 61: Hoare triple {15373#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; {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15373#true} {15373#true} #67#return; {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L290 TraceCheckUtils]: 59: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L290 TraceCheckUtils]: 58: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L290 TraceCheckUtils]: 57: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,296 INFO L272 TraceCheckUtils]: 56: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15373#true} {15373#true} #65#return; {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L290 TraceCheckUtils]: 52: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L272 TraceCheckUtils]: 51: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15373#true} {15373#true} #63#return; {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L272 TraceCheckUtils]: 46: Hoare triple {15373#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15373#true} {15373#true} #61#return; {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L272 TraceCheckUtils]: 41: Hoare triple {15373#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15373#true} {15373#true} #59#return; {15373#true} is VALID [2022-04-07 12:56:05,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L272 TraceCheckUtils]: 36: Hoare triple {15373#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {15373#true} assume !!(#t~post5 < 10);havoc #t~post5; {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {15373#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {15373#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; {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15373#true} {15373#true} #67#return; {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L272 TraceCheckUtils]: 28: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15373#true} {15373#true} #65#return; {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L272 TraceCheckUtils]: 23: Hoare triple {15373#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,298 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15373#true} {15373#true} #63#return; {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L272 TraceCheckUtils]: 18: Hoare triple {15373#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15373#true} {15373#true} #61#return; {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L272 TraceCheckUtils]: 13: Hoare triple {15373#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15373#true} {15373#true} #59#return; {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {15373#true} assume !(0 == ~cond); {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {15373#true} ~cond := #in~cond; {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L272 TraceCheckUtils]: 8: Hoare triple {15373#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {15373#true} assume !!(#t~post5 < 10);havoc #t~post5; {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {15373#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15373#true} is VALID [2022-04-07 12:56:05,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {15373#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {15373#true} is VALID [2022-04-07 12:56:05,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {15373#true} call #t~ret6 := main(); {15373#true} is VALID [2022-04-07 12:56:05,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15373#true} {15373#true} #81#return; {15373#true} is VALID [2022-04-07 12:56:05,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {15373#true} assume true; {15373#true} is VALID [2022-04-07 12:56:05,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {15373#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15373#true} is VALID [2022-04-07 12:56:05,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {15373#true} call ULTIMATE.init(); {15373#true} is VALID [2022-04-07 12:56:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-07 12:56:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:05,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629862705] [2022-04-07 12:56:05,301 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:05,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394807106] [2022-04-07 12:56:05,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394807106] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:56:05,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:56:05,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-04-07 12:56:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792996921] [2022-04-07 12:56:05,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:56:05,301 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-04-07 12:56:05,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:05,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:56:07,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:07,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 12:56:07,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:07,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 12:56:07,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:56:07,141 INFO L87 Difference]: Start difference. First operand 302 states and 315 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:56:13,817 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-07 12:56:15,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:56:17,826 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-07 12:56:21,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:56:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:23,819 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-04-07 12:56:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:56:23,819 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-04-07 12:56:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:56:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-07 12:56:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:56:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-07 12:56:23,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-07 12:56:25,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:25,885 INFO L225 Difference]: With dead ends: 311 [2022-04-07 12:56:25,885 INFO L226 Difference]: Without dead ends: 309 [2022-04-07 12:56:25,886 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:56:25,886 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:25,886 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 142 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 225 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2022-04-07 12:56:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-07 12:56:26,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-04-07 12:56:26,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:26,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-07 12:56:26,087 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-07 12:56:26,087 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-07 12:56:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:26,092 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-07 12:56:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 323 transitions. [2022-04-07 12:56:26,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:26,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:26,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) Second operand 309 states. [2022-04-07 12:56:26,094 INFO L87 Difference]: Start difference. First operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) Second operand 309 states. [2022-04-07 12:56:26,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:26,099 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-07 12:56:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 323 transitions. [2022-04-07 12:56:26,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:26,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:26,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:26,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-07 12:56:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-04-07 12:56:26,105 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-04-07 12:56:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:26,105 INFO L478 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-04-07 12:56:26,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:56:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-04-07 12:56:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-07 12:56:26,106 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:26,106 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:26,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-07 12:56:26,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-07 12:56:26,311 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:26,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2056924759, now seen corresponding path program 4 times [2022-04-07 12:56:26,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:26,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432435703] [2022-04-07 12:56:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:26,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:26,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:26,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582929550] [2022-04-07 12:56:26,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 12:56:26,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:26,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:26,328 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:56:26,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-07 12:56:28,107 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 12:56:28,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:56:28,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-07 12:56:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:28,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:29,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {17812#true} call ULTIMATE.init(); {17812#true} is VALID [2022-04-07 12:56:29,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {17812#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17812#true} is VALID [2022-04-07 12:56:29,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17812#true} {17812#true} #81#return; {17812#true} is VALID [2022-04-07 12:56:29,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {17812#true} call #t~ret6 := main(); {17812#true} is VALID [2022-04-07 12:56:29,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {17812#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17812#true} is VALID [2022-04-07 12:56:29,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {17812#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17812#true} is VALID [2022-04-07 12:56:29,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {17812#true} assume !!(#t~post5 < 10);havoc #t~post5; {17812#true} is VALID [2022-04-07 12:56:29,531 INFO L272 TraceCheckUtils]: 8: Hoare triple {17812#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,532 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17812#true} {17812#true} #59#return; {17812#true} is VALID [2022-04-07 12:56:29,532 INFO L272 TraceCheckUtils]: 13: Hoare triple {17812#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {17812#true} ~cond := #in~cond; {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:29,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,533 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} {17812#true} #61#return; {17870#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:56:29,533 INFO L272 TraceCheckUtils]: 18: Hoare triple {17870#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {17812#true} ~cond := #in~cond; {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:29,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,534 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} {17870#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {17886#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:56:29,534 INFO L272 TraceCheckUtils]: 23: Hoare triple {17886#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,534 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17812#true} {17886#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {17886#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:56:29,534 INFO L272 TraceCheckUtils]: 28: Hoare triple {17886#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,535 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17812#true} {17886#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {17886#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:56:29,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {17886#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} 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; {17920#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {17920#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17920#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {17920#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} assume !!(#t~post5 < 10);havoc #t~post5; {17920#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,541 INFO L272 TraceCheckUtils]: 36: Hoare triple {17920#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,541 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {17812#true} {17920#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #59#return; {17920#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,541 INFO L272 TraceCheckUtils]: 41: Hoare triple {17920#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,541 INFO L290 TraceCheckUtils]: 42: Hoare triple {17812#true} ~cond := #in~cond; {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:29,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,542 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} {17920#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #61#return; {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,542 INFO L272 TraceCheckUtils]: 46: Hoare triple {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,542 INFO L290 TraceCheckUtils]: 47: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,543 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17812#true} {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #63#return; {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,543 INFO L272 TraceCheckUtils]: 51: Hoare triple {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,543 INFO L290 TraceCheckUtils]: 52: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,543 INFO L290 TraceCheckUtils]: 53: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,543 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17812#true} {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #65#return; {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,543 INFO L272 TraceCheckUtils]: 56: Hoare triple {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,543 INFO L290 TraceCheckUtils]: 57: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,543 INFO L290 TraceCheckUtils]: 58: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,543 INFO L290 TraceCheckUtils]: 59: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,544 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17812#true} {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #67#return; {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,551 INFO L290 TraceCheckUtils]: 61: Hoare triple {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} 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; {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} assume !!(#t~post5 < 10);havoc #t~post5; {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,552 INFO L272 TraceCheckUtils]: 64: Hoare triple {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,552 INFO L290 TraceCheckUtils]: 65: Hoare triple {17812#true} ~cond := #in~cond; {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:29,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,553 INFO L290 TraceCheckUtils]: 67: Hoare triple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,553 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #59#return; {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,553 INFO L272 TraceCheckUtils]: 69: Hoare triple {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {17812#true} ~cond := #in~cond; {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:29,553 INFO L290 TraceCheckUtils]: 71: Hoare triple {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,573 INFO L290 TraceCheckUtils]: 72: Hoare triple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,574 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #61#return; {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-07 12:56:29,574 INFO L272 TraceCheckUtils]: 74: Hoare triple {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,574 INFO L290 TraceCheckUtils]: 75: Hoare triple {17812#true} ~cond := #in~cond; {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:29,574 INFO L290 TraceCheckUtils]: 76: Hoare triple {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,574 INFO L290 TraceCheckUtils]: 77: Hoare triple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,575 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} {17957#(and (<= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #63#return; {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-07 12:56:29,575 INFO L272 TraceCheckUtils]: 79: Hoare triple {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,575 INFO L290 TraceCheckUtils]: 80: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,575 INFO L290 TraceCheckUtils]: 81: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,575 INFO L290 TraceCheckUtils]: 82: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,575 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {17812#true} {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #65#return; {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-07 12:56:29,575 INFO L272 TraceCheckUtils]: 84: Hoare triple {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,575 INFO L290 TraceCheckUtils]: 85: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,575 INFO L290 TraceCheckUtils]: 86: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,576 INFO L290 TraceCheckUtils]: 87: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,576 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17812#true} {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #67#return; {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-07 12:56:29,580 INFO L290 TraceCheckUtils]: 89: Hoare triple {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-07 12:56:29,580 INFO L290 TraceCheckUtils]: 90: Hoare triple {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-07 12:56:29,581 INFO L290 TraceCheckUtils]: 91: Hoare triple {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-07 12:56:29,581 INFO L272 TraceCheckUtils]: 92: Hoare triple {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 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)); {17812#true} is VALID [2022-04-07 12:56:29,581 INFO L290 TraceCheckUtils]: 93: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,581 INFO L290 TraceCheckUtils]: 94: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,581 INFO L290 TraceCheckUtils]: 95: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,581 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17812#true} {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #59#return; {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-07 12:56:29,581 INFO L272 TraceCheckUtils]: 97: Hoare triple {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 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)); {17812#true} is VALID [2022-04-07 12:56:29,581 INFO L290 TraceCheckUtils]: 98: Hoare triple {17812#true} ~cond := #in~cond; {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:29,582 INFO L290 TraceCheckUtils]: 99: Hoare triple {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,582 INFO L290 TraceCheckUtils]: 100: Hoare triple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,582 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #61#return; {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-07 12:56:29,582 INFO L272 TraceCheckUtils]: 102: Hoare triple {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,582 INFO L290 TraceCheckUtils]: 103: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,582 INFO L290 TraceCheckUtils]: 104: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,582 INFO L290 TraceCheckUtils]: 105: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,583 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17812#true} {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #63#return; {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-07 12:56:29,583 INFO L272 TraceCheckUtils]: 107: Hoare triple {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,583 INFO L290 TraceCheckUtils]: 108: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,583 INFO L290 TraceCheckUtils]: 109: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,583 INFO L290 TraceCheckUtils]: 110: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,583 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {17812#true} {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #65#return; {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-07 12:56:29,583 INFO L272 TraceCheckUtils]: 112: Hoare triple {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,583 INFO L290 TraceCheckUtils]: 113: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,583 INFO L290 TraceCheckUtils]: 114: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,583 INFO L290 TraceCheckUtils]: 115: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,584 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17812#true} {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #67#return; {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-07 12:56:29,589 INFO L290 TraceCheckUtils]: 117: Hoare triple {18057#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} is VALID [2022-04-07 12:56:29,589 INFO L290 TraceCheckUtils]: 118: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} is VALID [2022-04-07 12:56:29,590 INFO L290 TraceCheckUtils]: 119: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} assume !!(#t~post5 < 10);havoc #t~post5; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} is VALID [2022-04-07 12:56:29,590 INFO L272 TraceCheckUtils]: 120: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,590 INFO L290 TraceCheckUtils]: 121: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,590 INFO L290 TraceCheckUtils]: 122: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,590 INFO L290 TraceCheckUtils]: 123: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,590 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17812#true} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} #59#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} is VALID [2022-04-07 12:56:29,590 INFO L272 TraceCheckUtils]: 125: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,591 INFO L290 TraceCheckUtils]: 126: Hoare triple {17812#true} ~cond := #in~cond; {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:29,591 INFO L290 TraceCheckUtils]: 127: Hoare triple {17859#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,591 INFO L290 TraceCheckUtils]: 128: Hoare triple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:29,591 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17863#(not (= |__VERIFIER_assert_#in~cond| 0))} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} #61#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} is VALID [2022-04-07 12:56:29,591 INFO L272 TraceCheckUtils]: 130: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,591 INFO L290 TraceCheckUtils]: 131: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,591 INFO L290 TraceCheckUtils]: 132: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,591 INFO L290 TraceCheckUtils]: 133: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,592 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {17812#true} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} #63#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} is VALID [2022-04-07 12:56:29,592 INFO L272 TraceCheckUtils]: 135: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,592 INFO L290 TraceCheckUtils]: 136: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,592 INFO L290 TraceCheckUtils]: 137: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,592 INFO L290 TraceCheckUtils]: 138: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,592 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {17812#true} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} #65#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} is VALID [2022-04-07 12:56:29,592 INFO L272 TraceCheckUtils]: 140: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,592 INFO L290 TraceCheckUtils]: 141: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,592 INFO L290 TraceCheckUtils]: 142: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,593 INFO L290 TraceCheckUtils]: 143: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,593 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17812#true} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} #67#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} is VALID [2022-04-07 12:56:29,594 INFO L290 TraceCheckUtils]: 145: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3))))} assume !(~n~0 <= ~a~0); {18260#(exists ((main_~n~0 Int)) (and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)))))} is VALID [2022-04-07 12:56:29,594 INFO L272 TraceCheckUtils]: 146: Hoare triple {18260#(exists ((main_~n~0 Int)) (and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,595 INFO L290 TraceCheckUtils]: 147: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,595 INFO L290 TraceCheckUtils]: 148: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,595 INFO L290 TraceCheckUtils]: 149: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,595 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17812#true} {18260#(exists ((main_~n~0 Int)) (and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)))))} #69#return; {18260#(exists ((main_~n~0 Int)) (and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)))))} is VALID [2022-04-07 12:56:29,595 INFO L272 TraceCheckUtils]: 151: Hoare triple {18260#(exists ((main_~n~0 Int)) (and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)))))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {17812#true} is VALID [2022-04-07 12:56:29,595 INFO L290 TraceCheckUtils]: 152: Hoare triple {17812#true} ~cond := #in~cond; {17812#true} is VALID [2022-04-07 12:56:29,595 INFO L290 TraceCheckUtils]: 153: Hoare triple {17812#true} assume !(0 == ~cond); {17812#true} is VALID [2022-04-07 12:56:29,595 INFO L290 TraceCheckUtils]: 154: Hoare triple {17812#true} assume true; {17812#true} is VALID [2022-04-07 12:56:29,596 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {17812#true} {18260#(exists ((main_~n~0 Int)) (and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)))))} #71#return; {18260#(exists ((main_~n~0 Int)) (and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)))))} is VALID [2022-04-07 12:56:29,600 INFO L272 TraceCheckUtils]: 156: Hoare triple {18260#(exists ((main_~n~0 Int)) (and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0) (= (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 6)) (+ (- 1) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)))))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {18294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:56:29,601 INFO L290 TraceCheckUtils]: 157: Hoare triple {18294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:29,601 INFO L290 TraceCheckUtils]: 158: Hoare triple {18298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17813#false} is VALID [2022-04-07 12:56:29,601 INFO L290 TraceCheckUtils]: 159: Hoare triple {17813#false} assume !false; {17813#false} is VALID [2022-04-07 12:56:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 234 proven. 352 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2022-04-07 12:56:29,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:56:43,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:43,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432435703] [2022-04-07 12:56:43,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:43,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582929550] [2022-04-07 12:56:43,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582929550] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:56:43,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:56:43,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-07 12:56:43,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481826542] [2022-04-07 12:56:43,686 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:56:43,687 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Word has length 160 [2022-04-07 12:56:43,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:43,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-04-07 12:56:43,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:43,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 12:56:43,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:43,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 12:56:43,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-07 12:56:43,794 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-04-07 12:56:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:45,139 INFO L93 Difference]: Finished difference Result 339 states and 346 transitions. [2022-04-07 12:56:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 12:56:45,140 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Word has length 160 [2022-04-07 12:56:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-04-07 12:56:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-07 12:56:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-04-07 12:56:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-07 12:56:45,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-07 12:56:45,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:45,249 INFO L225 Difference]: With dead ends: 339 [2022-04-07 12:56:45,249 INFO L226 Difference]: Without dead ends: 301 [2022-04-07 12:56:45,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 183 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-04-07 12:56:45,251 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:45,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 108 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 161 Invalid, 0 Unknown, 56 Unchecked, 0.4s Time] [2022-04-07 12:56:45,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-07 12:56:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2022-04-07 12:56:45,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:45,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 301 states, 192 states have (on average 1.0104166666666667) internal successors, (194), 193 states have internal predecessors, (194), 55 states have call successors, (55), 54 states have call predecessors, (55), 53 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-07 12:56:45,399 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 301 states, 192 states have (on average 1.0104166666666667) internal successors, (194), 193 states have internal predecessors, (194), 55 states have call successors, (55), 54 states have call predecessors, (55), 53 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-07 12:56:45,400 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 301 states, 192 states have (on average 1.0104166666666667) internal successors, (194), 193 states have internal predecessors, (194), 55 states have call successors, (55), 54 states have call predecessors, (55), 53 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-07 12:56:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:45,404 INFO L93 Difference]: Finished difference Result 301 states and 302 transitions. [2022-04-07 12:56:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2022-04-07 12:56:45,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:45,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:45,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 192 states have (on average 1.0104166666666667) internal successors, (194), 193 states have internal predecessors, (194), 55 states have call successors, (55), 54 states have call predecessors, (55), 53 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand 301 states. [2022-04-07 12:56:45,405 INFO L87 Difference]: Start difference. First operand has 301 states, 192 states have (on average 1.0104166666666667) internal successors, (194), 193 states have internal predecessors, (194), 55 states have call successors, (55), 54 states have call predecessors, (55), 53 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand 301 states. [2022-04-07 12:56:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:45,409 INFO L93 Difference]: Finished difference Result 301 states and 302 transitions. [2022-04-07 12:56:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2022-04-07 12:56:45,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:45,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:45,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:45,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 192 states have (on average 1.0104166666666667) internal successors, (194), 193 states have internal predecessors, (194), 55 states have call successors, (55), 54 states have call predecessors, (55), 53 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-07 12:56:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2022-04-07 12:56:45,416 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 160 [2022-04-07 12:56:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:45,416 INFO L478 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2022-04-07 12:56:45,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-04-07 12:56:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2022-04-07 12:56:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-04-07 12:56:45,419 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:45,419 INFO L499 BasicCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:45,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-07 12:56:45,625 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:45,626 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:45,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1533533153, now seen corresponding path program 3 times [2022-04-07 12:56:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:45,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901987977] [2022-04-07 12:56:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:45,649 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:45,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1044251798] [2022-04-07 12:56:45,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:56:45,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:45,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:45,650 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:56:45,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-07 12:56:46,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2022-04-07 12:56:46,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-07 12:56:46,041 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 12:56:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 12:56:46,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 12:56:46,199 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 12:56:46,199 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 12:56:46,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-07 12:56:46,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:46,418 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:46,420 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 12:56:46,519 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 12:56:46,519 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 12:56:46,519 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 12:56:46,519 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 12:56:46,519 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-07 12:56:46,519 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 12:56:46,519 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-07 12:56:46,519 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:56:46,520 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 12:56:46,521 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 12:56:46,521 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 12:56:46,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:56:46 BoogieIcfgContainer [2022-04-07 12:56:46,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 12:56:46,523 INFO L158 Benchmark]: Toolchain (without parser) took 126497.96ms. Allocated memory was 184.5MB in the beginning and 248.5MB in the end (delta: 64.0MB). Free memory was 130.8MB in the beginning and 217.1MB in the end (delta: -86.3MB). Peak memory consumption was 121.1MB. Max. memory is 8.0GB. [2022-04-07 12:56:46,523 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory was 147.6MB in the beginning and 147.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 12:56:46,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.29ms. Allocated memory was 184.5MB in the beginning and 248.5MB in the end (delta: 64.0MB). Free memory was 130.5MB in the beginning and 223.7MB in the end (delta: -93.2MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-07 12:56:46,523 INFO L158 Benchmark]: Boogie Preprocessor took 29.08ms. Allocated memory is still 248.5MB. Free memory was 223.7MB in the beginning and 222.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 12:56:46,523 INFO L158 Benchmark]: RCFGBuilder took 241.30ms. Allocated memory is still 248.5MB. Free memory was 222.1MB in the beginning and 209.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 12:56:46,523 INFO L158 Benchmark]: TraceAbstraction took 125990.49ms. Allocated memory is still 248.5MB. Free memory was 209.0MB in the beginning and 217.1MB in the end (delta: -8.1MB). Peak memory consumption was 135.9MB. Max. memory is 8.0GB. [2022-04-07 12:56:46,524 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.09ms. Allocated memory is still 184.5MB. Free memory was 147.6MB in the beginning and 147.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.29ms. Allocated memory was 184.5MB in the beginning and 248.5MB in the end (delta: 64.0MB). Free memory was 130.5MB in the beginning and 223.7MB in the end (delta: -93.2MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.08ms. Allocated memory is still 248.5MB. Free memory was 223.7MB in the beginning and 222.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 241.30ms. Allocated memory is still 248.5MB. Free memory was 222.1MB in the beginning and 209.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 125990.49ms. Allocated memory is still 248.5MB. Free memory was 209.0MB in the beginning and 217.1MB in the end (delta: -8.1MB). Peak memory consumption was 135.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=15, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=10, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND FALSE !(counter++<10) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=10, counter=11, n=10, x=1000, y=331, z=66] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 125.8s, OverallIterations: 20, TraceHistogramMax: 52, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 45.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 431 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 2842 SdHoareTripleChecker+Invalid, 13.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 56 IncrementalHoareTripleChecker+Unchecked, 1978 mSDsCounter, 440 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2801 IncrementalHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 440 mSolverCounterUnsat, 864 mSDtfsCounter, 2801 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2187 GetRequests, 1983 SyntacticMatches, 21 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=311occurred in iteration=16, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 65.3s InterpolantComputationTime, 1625 NumberOfCodeBlocks, 1407 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1929 ConstructedInterpolants, 3 QuantifiedInterpolants, 8771 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2863 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 9709/11036 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-07 12:56:46,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...