/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_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:13:23,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:13:23,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:13:23,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:13:23,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:13:23,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:13:23,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:13:23,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:13:23,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:13:23,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:13:23,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:13:23,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:13:23,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:13:23,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:13:23,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:13:23,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:13:23,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:13:23,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:13:23,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:13:23,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:13:23,234 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:13:23,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:13:23,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:13:23,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:13:23,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:13:23,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:13:23,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:13:23,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:13:23,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:13:23,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:13:23,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:13:23,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:13:23,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:13:23,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:13:23,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:13:23,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:13:23,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:13:23,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:13:23,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:13:23,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:13:23,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:13:23,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:13:23,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:13:23,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:13:23,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:13:23,301 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:13:23,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:13:23,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:13:23,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:13:23,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:13:23,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:13:23,302 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:13:23,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:13:23,303 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:13:23,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:13:23,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:13:23,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:13:23,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:13:23,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:13:23,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:13:23,304 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:13:23,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:13:23,304 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:13:23,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:13:23,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:13:23,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:13:23,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:13:23,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:13:23,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:13:23,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:13:23,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:13:23,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:13:23,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:13:23,305 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:13:23,305 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:13:23,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:13:23,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:13:23,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:13:23,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:13:23,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:13:23,642 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:13:23,659 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:13:23,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound100.c [2022-04-27 12:13:23,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a026fe05b/81c8225d381a4415b394d5c4452d4dd7/FLAGd10f569e2 [2022-04-27 12:13:24,260 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:13:24,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound100.c [2022-04-27 12:13:24,266 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a026fe05b/81c8225d381a4415b394d5c4452d4dd7/FLAGd10f569e2 [2022-04-27 12:13:24,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a026fe05b/81c8225d381a4415b394d5c4452d4dd7 [2022-04-27 12:13:24,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:13:24,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:13:24,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:13:24,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:13:24,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:13:24,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:13:24" (1/1) ... [2022-04-27 12:13:24,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0683f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:24, skipping insertion in model container [2022-04-27 12:13:24,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:13:24" (1/1) ... [2022-04-27 12:13:24,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:13:24,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:13:24,911 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_valuebound100.c[588,601] [2022-04-27 12:13:24,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:13:24,959 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:13:24,986 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_valuebound100.c[588,601] [2022-04-27 12:13:25,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:13:25,010 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:13:25,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:25 WrapperNode [2022-04-27 12:13:25,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:13:25,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:13:25,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:13:25,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:13:25,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:25" (1/1) ... [2022-04-27 12:13:25,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:25" (1/1) ... [2022-04-27 12:13:25,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:25" (1/1) ... [2022-04-27 12:13:25,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:25" (1/1) ... [2022-04-27 12:13:25,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:25" (1/1) ... [2022-04-27 12:13:25,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:25" (1/1) ... [2022-04-27 12:13:25,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:25" (1/1) ... [2022-04-27 12:13:25,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:13:25,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:13:25,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:13:25,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:13:25,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:25" (1/1) ... [2022-04-27 12:13:25,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:13:25,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:25,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:13:25,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:13:25,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:13:25,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:13:25,199 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:13:25,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:13:25,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:13:25,199 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:13:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:13:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:13:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:13:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:13:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-27 12:13:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:13:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:13:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:13:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:13:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:13:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:13:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:13:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:13:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:13:25,276 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:13:25,278 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:13:25,488 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:13:25,522 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:13:25,523 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 12:13:25,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:13:25 BoogieIcfgContainer [2022-04-27 12:13:25,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:13:25,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:13:25,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:13:25,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:13:25,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:13:24" (1/3) ... [2022-04-27 12:13:25,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e98839f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:13:25, skipping insertion in model container [2022-04-27 12:13:25,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:13:25" (2/3) ... [2022-04-27 12:13:25,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e98839f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:13:25, skipping insertion in model container [2022-04-27 12:13:25,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:13:25" (3/3) ... [2022-04-27 12:13:25,540 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound100.c [2022-04-27 12:13:25,548 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:13:25,549 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:13:25,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:13:25,624 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@723023ed, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6af2ab5a [2022-04-27 12:13:25,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:13:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:13:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:13:25,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:25,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:25,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:25,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:25,638 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-27 12:13:25,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:25,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132167027] [2022-04-27 12:13:25,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:25,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:25,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:13:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:25,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-27 12:13:25,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-27 12:13:25,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-27 12:13:25,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:13:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:25,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-27 12:13:25,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-27 12:13:25,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-27 12:13:25,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-27 12:13:25,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:13:25,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-27 12:13:25,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-27 12:13:25,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-27 12:13:25,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-27 12:13:25,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {39#true} is VALID [2022-04-27 12:13:25,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {39#true} is VALID [2022-04-27 12:13:25,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-27 12:13:25,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-27 12:13:25,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-27 12:13:25,847 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-27 12:13:25,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {40#false} is VALID [2022-04-27 12:13:25,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-27 12:13:25,848 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {40#false} is VALID [2022-04-27 12:13:25,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-27 12:13:25,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-27 12:13:25,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-27 12:13:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:13:25,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:25,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132167027] [2022-04-27 12:13:25,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132167027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:13:25,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:13:25,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:13:25,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41428817] [2022-04-27 12:13:25,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:13:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:13:25,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:25,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:25,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:25,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:13:25,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:25,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:13:25,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:13:25,910 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:26,070 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-27 12:13:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:13:26,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:13:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 12:13:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 12:13:26,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-27 12:13:26,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:26,209 INFO L225 Difference]: With dead ends: 63 [2022-04-27 12:13:26,209 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 12:13:26,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:13:26,213 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:26,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:13:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 12:13:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 12:13:26,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:26,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:13:26,234 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:13:26,235 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:13:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:26,238 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-27 12:13:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-27 12:13:26,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:26,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:26,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-27 12:13:26,240 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-27 12:13:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:26,242 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-27 12:13:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-27 12:13:26,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:26,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:26,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:26,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:13:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-27 12:13:26,247 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-27 12:13:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:26,247 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-27 12:13:26,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-27 12:13:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:13:26,248 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:26,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:26,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:13:26,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-27 12:13:26,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:26,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792134467] [2022-04-27 12:13:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:26,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:26,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:13:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:26,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {258#true} is VALID [2022-04-27 12:13:26,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-27 12:13:26,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {258#true} {258#true} #84#return; {258#true} is VALID [2022-04-27 12:13:26,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:13:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:26,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#true} ~cond := #in~cond; {258#true} is VALID [2022-04-27 12:13:26,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} assume !(0 == ~cond); {258#true} is VALID [2022-04-27 12:13:26,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-27 12:13:26,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #60#return; {258#true} is VALID [2022-04-27 12:13:26,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:13:26,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {258#true} is VALID [2022-04-27 12:13:26,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-27 12:13:26,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #84#return; {258#true} is VALID [2022-04-27 12:13:26,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret5 := main(); {258#true} is VALID [2022-04-27 12:13:26,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {258#true} is VALID [2022-04-27 12:13:26,337 INFO L272 TraceCheckUtils]: 6: Hoare triple {258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {258#true} is VALID [2022-04-27 12:13:26,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {258#true} ~cond := #in~cond; {258#true} is VALID [2022-04-27 12:13:26,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#true} assume !(0 == ~cond); {258#true} is VALID [2022-04-27 12:13:26,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-27 12:13:26,337 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {258#true} {258#true} #60#return; {258#true} is VALID [2022-04-27 12:13:26,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {267#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 12:13:26,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {267#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 12:13:26,339 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:13:26,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {269#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:13:26,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {259#false} is VALID [2022-04-27 12:13:26,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#false} assume !false; {259#false} is VALID [2022-04-27 12:13:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:13:26,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:26,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792134467] [2022-04-27 12:13:26,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792134467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:13:26,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:13:26,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:13:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9955206] [2022-04-27 12:13:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:13:26,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:13:26,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:26,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:26,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:26,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:13:26,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:26,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:13:26,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:13:26,355 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:26,736 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-27 12:13:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:13:26,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:13:26,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-27 12:13:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-27 12:13:26,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-27 12:13:26,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:26,790 INFO L225 Difference]: With dead ends: 37 [2022-04-27 12:13:26,790 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:13:26,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:13:26,791 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:26,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:13:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:13:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 12:13:26,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:26,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:13:26,797 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:13:26,797 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:13:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:26,799 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 12:13:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 12:13:26,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:26,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:26,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-27 12:13:26,800 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-27 12:13:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:26,802 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 12:13:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 12:13:26,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:26,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:26,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:26,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:13:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-27 12:13:26,805 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-27 12:13:26,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:26,805 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-27 12:13:26,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:13:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 12:13:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 12:13:26,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:26,806 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:26,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:13:26,806 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:26,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:26,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-27 12:13:26,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:26,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131401757] [2022-04-27 12:13:26,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:26,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:26,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:26,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120060406] [2022-04-27 12:13:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:26,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:26,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:26,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:26,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:13:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:26,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:13:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:26,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:26,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2022-04-27 12:13:26,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {463#true} is VALID [2022-04-27 12:13:26,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-27 12:13:26,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {463#true} {463#true} #84#return; {463#true} is VALID [2022-04-27 12:13:26,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {463#true} call #t~ret5 := main(); {463#true} is VALID [2022-04-27 12:13:26,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {463#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {463#true} is VALID [2022-04-27 12:13:26,992 INFO L272 TraceCheckUtils]: 6: Hoare triple {463#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {463#true} is VALID [2022-04-27 12:13:26,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#true} ~cond := #in~cond; {463#true} is VALID [2022-04-27 12:13:26,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#true} assume !(0 == ~cond); {463#true} is VALID [2022-04-27 12:13:26,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-27 12:13:26,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {463#true} {463#true} #60#return; {463#true} is VALID [2022-04-27 12:13:26,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {463#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {501#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:13:26,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {501#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {501#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:13:26,994 INFO L272 TraceCheckUtils]: 13: Hoare triple {501#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {463#true} is VALID [2022-04-27 12:13:26,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {463#true} ~cond := #in~cond; {463#true} is VALID [2022-04-27 12:13:26,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {463#true} assume !(0 == ~cond); {463#true} is VALID [2022-04-27 12:13:26,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-27 12:13:26,995 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {463#true} {501#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {501#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:13:26,996 INFO L272 TraceCheckUtils]: 18: Hoare triple {501#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:26,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:26,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {464#false} is VALID [2022-04-27 12:13:26,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#false} assume !false; {464#false} is VALID [2022-04-27 12:13:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:13:26,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:13:26,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:26,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131401757] [2022-04-27 12:13:26,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:26,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120060406] [2022-04-27 12:13:26,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120060406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:13:26,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:13:26,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:13:26,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001176461] [2022-04-27 12:13:26,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:13:26,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 12:13:26,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:26,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:13:27,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:27,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:13:27,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:27,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:13:27,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:13:27,017 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:13:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:27,234 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-27 12:13:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:13:27,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 12:13:27,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:13:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 12:13:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:13:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 12:13:27,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 12:13:27,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:27,302 INFO L225 Difference]: With dead ends: 54 [2022-04-27 12:13:27,302 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 12:13:27,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:13:27,303 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:27,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:13:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 12:13:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-27 12:13:27,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:27,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:13:27,310 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:13:27,311 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:13:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:27,313 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 12:13:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 12:13:27,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:27,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:27,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-27 12:13:27,315 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-27 12:13:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:27,318 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 12:13:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 12:13:27,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:27,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:27,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:27,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:13:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-27 12:13:27,321 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-27 12:13:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:27,321 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-27 12:13:27,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:13:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-27 12:13:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 12:13:27,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:27,322 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:27,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 12:13:27,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:27,539 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:27,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-27 12:13:27,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:27,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022386864] [2022-04-27 12:13:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:27,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:27,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [762364515] [2022-04-27 12:13:27,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:27,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:27,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:27,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:27,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:13:27,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:13:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:27,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:27,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {792#true} call ULTIMATE.init(); {792#true} is VALID [2022-04-27 12:13:27,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {792#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {792#true} is VALID [2022-04-27 12:13:27,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-27 12:13:27,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {792#true} {792#true} #84#return; {792#true} is VALID [2022-04-27 12:13:27,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {792#true} call #t~ret5 := main(); {792#true} is VALID [2022-04-27 12:13:27,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {792#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {792#true} is VALID [2022-04-27 12:13:27,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {792#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {792#true} is VALID [2022-04-27 12:13:27,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {792#true} ~cond := #in~cond; {792#true} is VALID [2022-04-27 12:13:27,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {792#true} assume !(0 == ~cond); {792#true} is VALID [2022-04-27 12:13:27,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-27 12:13:27,690 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {792#true} {792#true} #60#return; {792#true} is VALID [2022-04-27 12:13:27,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {792#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {830#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:13:27,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {830#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:13:27,691 INFO L272 TraceCheckUtils]: 13: Hoare triple {830#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {792#true} is VALID [2022-04-27 12:13:27,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {792#true} ~cond := #in~cond; {792#true} is VALID [2022-04-27 12:13:27,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {792#true} assume !(0 == ~cond); {792#true} is VALID [2022-04-27 12:13:27,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-27 12:13:27,692 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {792#true} {830#(and (= main_~x~0 0) (= main_~n~0 0))} #62#return; {830#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:13:27,692 INFO L272 TraceCheckUtils]: 18: Hoare triple {830#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {792#true} is VALID [2022-04-27 12:13:27,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {792#true} ~cond := #in~cond; {792#true} is VALID [2022-04-27 12:13:27,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {792#true} assume !(0 == ~cond); {792#true} is VALID [2022-04-27 12:13:27,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-27 12:13:27,693 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {792#true} {830#(and (= main_~x~0 0) (= main_~n~0 0))} #64#return; {830#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:13:27,694 INFO L272 TraceCheckUtils]: 23: Hoare triple {830#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:27,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:27,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {793#false} is VALID [2022-04-27 12:13:27,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {793#false} assume !false; {793#false} is VALID [2022-04-27 12:13:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:13:27,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:13:27,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:27,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022386864] [2022-04-27 12:13:27,695 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:27,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762364515] [2022-04-27 12:13:27,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762364515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:13:27,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:13:27,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:13:27,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858747810] [2022-04-27 12:13:27,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:13:27,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 12:13:27,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:27,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:13:27,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:27,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:13:27,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:27,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:13:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:13:27,712 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:13:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:27,938 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-27 12:13:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:13:27,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 12:13:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:13:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 12:13:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:13:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 12:13:27,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 12:13:28,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:28,012 INFO L225 Difference]: With dead ends: 58 [2022-04-27 12:13:28,012 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 12:13:28,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:13:28,013 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:28,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:13:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 12:13:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-27 12:13:28,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:28,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:13:28,035 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:13:28,036 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:13:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:28,038 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-27 12:13:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-27 12:13:28,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:28,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:28,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-27 12:13:28,040 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-27 12:13:28,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:28,042 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-27 12:13:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-27 12:13:28,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:28,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:28,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:28,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:13:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-27 12:13:28,045 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-27 12:13:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:28,046 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-27 12:13:28,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:13:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-27 12:13:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:13:28,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:28,046 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:28,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:13:28,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 12:13:28,247 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:28,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-27 12:13:28,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:28,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383502638] [2022-04-27 12:13:28,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:28,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:28,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:28,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [74693831] [2022-04-27 12:13:28,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:28,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:28,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:28,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:13:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:28,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:13:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:28,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:28,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {1165#true} call ULTIMATE.init(); {1165#true} is VALID [2022-04-27 12:13:28,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1165#true} is VALID [2022-04-27 12:13:28,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 12:13:28,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} #84#return; {1165#true} is VALID [2022-04-27 12:13:28,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {1165#true} call #t~ret5 := main(); {1165#true} is VALID [2022-04-27 12:13:28,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1165#true} is VALID [2022-04-27 12:13:28,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {1165#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1165#true} is VALID [2022-04-27 12:13:28,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-27 12:13:28,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-27 12:13:28,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 12:13:28,455 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1165#true} {1165#true} #60#return; {1165#true} is VALID [2022-04-27 12:13:28,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {1165#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:28,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:28,457 INFO L272 TraceCheckUtils]: 13: Hoare triple {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1165#true} is VALID [2022-04-27 12:13:28,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-27 12:13:28,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-27 12:13:28,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 12:13:28,458 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1165#true} {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:28,458 INFO L272 TraceCheckUtils]: 18: Hoare triple {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1165#true} is VALID [2022-04-27 12:13:28,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-27 12:13:28,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-27 12:13:28,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 12:13:28,460 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1165#true} {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:28,460 INFO L272 TraceCheckUtils]: 23: Hoare triple {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1165#true} is VALID [2022-04-27 12:13:28,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-27 12:13:28,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-27 12:13:28,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 12:13:28,466 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1165#true} {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:28,467 INFO L272 TraceCheckUtils]: 28: Hoare triple {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1255#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:28,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {1255#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1259#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:28,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {1259#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1166#false} is VALID [2022-04-27 12:13:28,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2022-04-27 12:13:28,468 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 12:13:28,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:13:28,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:28,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383502638] [2022-04-27 12:13:28,468 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:28,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74693831] [2022-04-27 12:13:28,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74693831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:13:28,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:13:28,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:13:28,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328293570] [2022-04-27 12:13:28,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:13:28,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 12:13:28,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:28,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:13:28,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:28,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:13:28,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:28,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:13:28,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:13:28,488 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:13:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:28,720 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-27 12:13:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:13:28,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 12:13:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:13:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 12:13:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:13:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 12:13:28,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 12:13:28,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:28,790 INFO L225 Difference]: With dead ends: 66 [2022-04-27 12:13:28,790 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 12:13:28,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:13:28,791 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:28,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 135 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:13:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 12:13:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 12:13:28,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:28,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:13:28,802 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:13:28,804 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:13:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:28,806 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-27 12:13:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-27 12:13:28,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:28,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:28,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-27 12:13:28,807 INFO L87 Difference]: Start difference. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-27 12:13:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:28,809 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-27 12:13:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-27 12:13:28,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:28,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:28,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:28,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:13:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-27 12:13:28,815 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-27 12:13:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:28,816 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-27 12:13:28,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:13:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-27 12:13:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 12:13:28,817 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:28,818 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:28,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:13:29,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:29,036 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-27 12:13:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:29,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247434917] [2022-04-27 12:13:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:29,050 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:29,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1405140392] [2022-04-27 12:13:29,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:29,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:29,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:29,060 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:29,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:13:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:29,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:13:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:29,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:29,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-27 12:13:29,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-27 12:13:29,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #84#return; {1560#true} is VALID [2022-04-27 12:13:29,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret5 := main(); {1560#true} is VALID [2022-04-27 12:13:29,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1560#true} is VALID [2022-04-27 12:13:29,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {1560#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,308 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1560#true} {1560#true} #60#return; {1560#true} is VALID [2022-04-27 12:13:29,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {1560#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:29,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:29,309 INFO L272 TraceCheckUtils]: 13: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,309 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:29,310 INFO L272 TraceCheckUtils]: 18: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,310 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:29,310 INFO L272 TraceCheckUtils]: 23: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,311 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:29,311 INFO L272 TraceCheckUtils]: 28: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,312 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:29,312 INFO L272 TraceCheckUtils]: 33: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,313 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:29,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:13:29,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !false; {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:13:29,313 INFO L272 TraceCheckUtils]: 40: Hoare triple {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,314 INFO L290 TraceCheckUtils]: 43: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,314 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1560#true} {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #62#return; {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:13:29,315 INFO L272 TraceCheckUtils]: 45: Hoare triple {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:29,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1706#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:29,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {1706#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1561#false} is VALID [2022-04-27 12:13:29,315 INFO L290 TraceCheckUtils]: 48: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-27 12:13:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 12:13:29,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:13:29,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-27 12:13:29,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {1706#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1561#false} is VALID [2022-04-27 12:13:29,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1706#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:29,501 INFO L272 TraceCheckUtils]: 45: Hoare triple {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:29,502 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1560#true} {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:13:29,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,502 INFO L290 TraceCheckUtils]: 42: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,502 INFO L272 TraceCheckUtils]: 40: Hoare triple {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:13:29,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:13:29,524 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #70#return; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:13:29,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,524 INFO L272 TraceCheckUtils]: 33: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,525 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #68#return; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:13:29,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,528 INFO L272 TraceCheckUtils]: 28: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,529 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #66#return; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:13:29,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,529 INFO L272 TraceCheckUtils]: 23: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,530 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #64#return; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:13:29,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,531 INFO L272 TraceCheckUtils]: 18: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,533 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #62#return; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:13:29,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,533 INFO L272 TraceCheckUtils]: 13: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !false; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:13:29,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {1560#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:13:29,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1560#true} {1560#true} #60#return; {1560#true} is VALID [2022-04-27 12:13:29,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-27 12:13:29,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-27 12:13:29,534 INFO L272 TraceCheckUtils]: 6: Hoare triple {1560#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1560#true} is VALID [2022-04-27 12:13:29,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1560#true} is VALID [2022-04-27 12:13:29,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret5 := main(); {1560#true} is VALID [2022-04-27 12:13:29,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #84#return; {1560#true} is VALID [2022-04-27 12:13:29,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-27 12:13:29,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-27 12:13:29,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-27 12:13:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 12:13:29,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:29,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247434917] [2022-04-27 12:13:29,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:29,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405140392] [2022-04-27 12:13:29,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405140392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:13:29,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:13:29,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:13:29,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812526111] [2022-04-27 12:13:29,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:13:29,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 49 [2022-04-27 12:13:29,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:29,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:13:29,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:29,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:13:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:29,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:13:29,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:13:29,586 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:13:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:30,549 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-04-27 12:13:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:13:30,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 49 [2022-04-27 12:13:30,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:13:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-27 12:13:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:13:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-27 12:13:30,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2022-04-27 12:13:30,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:30,646 INFO L225 Difference]: With dead ends: 77 [2022-04-27 12:13:30,646 INFO L226 Difference]: Without dead ends: 75 [2022-04-27 12:13:30,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:13:30,647 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:30,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 131 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 12:13:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-27 12:13:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2022-04-27 12:13:30,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:30,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:13:30,661 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:13:30,661 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:13:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:30,664 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-04-27 12:13:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-04-27 12:13:30,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:30,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:30,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 75 states. [2022-04-27 12:13:30,664 INFO L87 Difference]: Start difference. First operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 75 states. [2022-04-27 12:13:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:30,666 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-04-27 12:13:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-04-27 12:13:30,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:30,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:30,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:30,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:13:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-04-27 12:13:30,668 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 49 [2022-04-27 12:13:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:30,669 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-04-27 12:13:30,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:13:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-04-27 12:13:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 12:13:30,669 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:30,669 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:30,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:13:30,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:30,870 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:30,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:30,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 2 times [2022-04-27 12:13:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:30,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061246171] [2022-04-27 12:13:30,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:30,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:30,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:30,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134628111] [2022-04-27 12:13:30,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:13:30,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:30,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:30,881 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:30,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:13:30,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:13:30,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:13:30,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:13:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:30,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:31,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2230#true} is VALID [2022-04-27 12:13:31,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2230#true} is VALID [2022-04-27 12:13:31,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #84#return; {2230#true} is VALID [2022-04-27 12:13:31,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret5 := main(); {2230#true} is VALID [2022-04-27 12:13:31,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {2230#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {2230#true} is VALID [2022-04-27 12:13:31,082 INFO L272 TraceCheckUtils]: 6: Hoare triple {2230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,082 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2230#true} {2230#true} #60#return; {2230#true} is VALID [2022-04-27 12:13:31,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {2230#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:13:31,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !false; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:13:31,083 INFO L272 TraceCheckUtils]: 13: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,084 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #62#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:13:31,084 INFO L272 TraceCheckUtils]: 18: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,084 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #64#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:13:31,085 INFO L272 TraceCheckUtils]: 23: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,085 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #66#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:13:31,085 INFO L272 TraceCheckUtils]: 28: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,086 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #68#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:13:31,086 INFO L272 TraceCheckUtils]: 33: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,087 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #70#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:13:31,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:13:31,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !false; {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:13:31,087 INFO L272 TraceCheckUtils]: 40: Hoare triple {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,088 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2230#true} {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #62#return; {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:13:31,088 INFO L272 TraceCheckUtils]: 45: Hoare triple {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,089 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2230#true} {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #64#return; {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:13:31,089 INFO L272 TraceCheckUtils]: 50: Hoare triple {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:31,089 INFO L290 TraceCheckUtils]: 51: Hoare triple {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2391#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:31,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {2391#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2231#false} is VALID [2022-04-27 12:13:31,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2022-04-27 12:13:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 12:13:31,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:13:31,260 INFO L290 TraceCheckUtils]: 53: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2022-04-27 12:13:31,260 INFO L290 TraceCheckUtils]: 52: Hoare triple {2391#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2231#false} is VALID [2022-04-27 12:13:31,261 INFO L290 TraceCheckUtils]: 51: Hoare triple {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2391#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:31,261 INFO L272 TraceCheckUtils]: 50: Hoare triple {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:31,262 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2230#true} {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:13:31,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,262 INFO L290 TraceCheckUtils]: 47: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,262 INFO L290 TraceCheckUtils]: 46: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,262 INFO L272 TraceCheckUtils]: 45: Hoare triple {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,263 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2230#true} {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:13:31,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,263 INFO L272 TraceCheckUtils]: 40: Hoare triple {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:13:31,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:13:31,265 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:13:31,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,266 INFO L272 TraceCheckUtils]: 33: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,266 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:13:31,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,266 INFO L272 TraceCheckUtils]: 28: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,267 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:13:31,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,267 INFO L272 TraceCheckUtils]: 23: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,268 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:13:31,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,268 INFO L272 TraceCheckUtils]: 18: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,268 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:13:31,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,269 INFO L272 TraceCheckUtils]: 13: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:13:31,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {2230#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:13:31,269 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2230#true} {2230#true} #60#return; {2230#true} is VALID [2022-04-27 12:13:31,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-27 12:13:31,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-27 12:13:31,270 INFO L272 TraceCheckUtils]: 6: Hoare triple {2230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2230#true} is VALID [2022-04-27 12:13:31,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {2230#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {2230#true} is VALID [2022-04-27 12:13:31,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret5 := main(); {2230#true} is VALID [2022-04-27 12:13:31,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #84#return; {2230#true} is VALID [2022-04-27 12:13:31,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 12:13:31,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2230#true} is VALID [2022-04-27 12:13:31,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2230#true} is VALID [2022-04-27 12:13:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 12:13:31,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:31,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061246171] [2022-04-27 12:13:31,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:31,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134628111] [2022-04-27 12:13:31,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134628111] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:13:31,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:13:31,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:13:31,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771887638] [2022-04-27 12:13:31,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:13:31,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 54 [2022-04-27 12:13:31,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:31,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:13:31,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:31,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:13:31,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:31,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:13:31,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:13:31,320 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:13:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:31,694 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-27 12:13:31,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:13:31,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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 54 [2022-04-27 12:13:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:13:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-27 12:13:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:13:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-27 12:13:31,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-27 12:13:31,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:31,744 INFO L225 Difference]: With dead ends: 81 [2022-04-27 12:13:31,744 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 12:13:31,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:13:31,745 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:31,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 197 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:13:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 12:13:31,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-04-27 12:13:31,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:31,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:13:31,765 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:13:31,765 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:13:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:31,767 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-27 12:13:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-27 12:13:31,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:31,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:31,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-27 12:13:31,768 INFO L87 Difference]: Start difference. First operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-27 12:13:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:31,770 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-27 12:13:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-27 12:13:31,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:31,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:31,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:31,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:13:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2022-04-27 12:13:31,772 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 54 [2022-04-27 12:13:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:31,773 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2022-04-27 12:13:31,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:13:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2022-04-27 12:13:31,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 12:13:31,773 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:31,773 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:31,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:13:31,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:31,989 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:31,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 3 times [2022-04-27 12:13:31,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:31,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782148656] [2022-04-27 12:13:31,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:31,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:32,003 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:32,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739542869] [2022-04-27 12:13:32,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:13:32,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:32,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:32,004 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:32,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:13:32,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 12:13:32,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:13:32,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 12:13:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:32,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:32,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2952#true} is VALID [2022-04-27 12:13:32,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2952#true} is VALID [2022-04-27 12:13:32,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #84#return; {2952#true} is VALID [2022-04-27 12:13:32,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret5 := main(); {2952#true} is VALID [2022-04-27 12:13:32,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {2952#true} is VALID [2022-04-27 12:13:32,327 INFO L272 TraceCheckUtils]: 6: Hoare triple {2952#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2952#true} {2952#true} #60#return; {2952#true} is VALID [2022-04-27 12:13:32,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {2952#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:32,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:32,328 INFO L272 TraceCheckUtils]: 13: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,329 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:32,329 INFO L272 TraceCheckUtils]: 18: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,329 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:32,329 INFO L272 TraceCheckUtils]: 23: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,330 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:32,330 INFO L272 TraceCheckUtils]: 28: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,330 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:32,331 INFO L272 TraceCheckUtils]: 33: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,331 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:32,332 INFO L290 TraceCheckUtils]: 38: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-27 12:13:32,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} assume !false; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-27 12:13:32,332 INFO L272 TraceCheckUtils]: 40: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,332 INFO L290 TraceCheckUtils]: 41: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,335 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2952#true} {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} #62#return; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-27 12:13:32,335 INFO L272 TraceCheckUtils]: 45: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,338 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2952#true} {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} #64#return; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-27 12:13:32,338 INFO L272 TraceCheckUtils]: 50: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,338 INFO L290 TraceCheckUtils]: 51: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,338 INFO L290 TraceCheckUtils]: 53: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,338 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2952#true} {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} #66#return; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-27 12:13:32,339 INFO L272 TraceCheckUtils]: 55: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:32,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:32,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {3128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2953#false} is VALID [2022-04-27 12:13:32,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-27 12:13:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 12:13:32,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:13:32,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-27 12:13:32,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {3128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2953#false} is VALID [2022-04-27 12:13:32,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:32,668 INFO L272 TraceCheckUtils]: 55: Hoare triple {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:32,668 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2952#true} {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:13:32,669 INFO L290 TraceCheckUtils]: 53: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,669 INFO L290 TraceCheckUtils]: 52: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,669 INFO L290 TraceCheckUtils]: 51: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,669 INFO L272 TraceCheckUtils]: 50: Hoare triple {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,670 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2952#true} {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:13:32,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,670 INFO L290 TraceCheckUtils]: 47: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,670 INFO L272 TraceCheckUtils]: 45: Hoare triple {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,671 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2952#true} {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:13:32,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,671 INFO L272 TraceCheckUtils]: 40: Hoare triple {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:13:32,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:13:32,675 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2952#true} {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #70#return; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:13:32,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,675 INFO L272 TraceCheckUtils]: 33: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,675 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2952#true} {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #68#return; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:13:32,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,676 INFO L272 TraceCheckUtils]: 28: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,676 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2952#true} {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #66#return; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:13:32,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,676 INFO L272 TraceCheckUtils]: 23: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,677 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2952#true} {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #64#return; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:13:32,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,677 INFO L272 TraceCheckUtils]: 18: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,677 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2952#true} {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #62#return; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:13:32,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,678 INFO L272 TraceCheckUtils]: 13: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !false; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:13:32,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {2952#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:13:32,678 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2952#true} {2952#true} #60#return; {2952#true} is VALID [2022-04-27 12:13:32,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-27 12:13:32,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-27 12:13:32,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {2952#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2952#true} is VALID [2022-04-27 12:13:32,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {2952#true} is VALID [2022-04-27 12:13:32,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret5 := main(); {2952#true} is VALID [2022-04-27 12:13:32,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #84#return; {2952#true} is VALID [2022-04-27 12:13:32,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-27 12:13:32,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2952#true} is VALID [2022-04-27 12:13:32,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2952#true} is VALID [2022-04-27 12:13:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 12:13:32,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:32,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782148656] [2022-04-27 12:13:32,679 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:32,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739542869] [2022-04-27 12:13:32,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739542869] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:13:32,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:13:32,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:13:32,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740928693] [2022-04-27 12:13:32,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:13:32,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 59 [2022-04-27 12:13:32,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:32,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:32,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:32,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:13:32,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:32,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:13:32,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:13:32,731 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:34,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:34,097 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-27 12:13:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:13:34,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 59 [2022-04-27 12:13:34,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-27 12:13:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-27 12:13:34,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2022-04-27 12:13:36,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 81 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:36,183 INFO L225 Difference]: With dead ends: 93 [2022-04-27 12:13:36,183 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 12:13:36,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:13:36,184 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:36,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 135 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:13:36,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 12:13:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2022-04-27 12:13:36,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:36,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:13:36,225 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:13:36,226 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:13:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:36,228 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-04-27 12:13:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2022-04-27 12:13:36,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:36,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:36,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 85 states. [2022-04-27 12:13:36,228 INFO L87 Difference]: Start difference. First operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 85 states. [2022-04-27 12:13:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:36,238 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-04-27 12:13:36,238 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2022-04-27 12:13:36,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:36,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:36,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:36,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:13:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-27 12:13:36,240 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 59 [2022-04-27 12:13:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:36,240 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-27 12:13:36,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-27 12:13:36,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 12:13:36,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:36,241 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:36,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:13:36,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:36,471 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:36,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:36,471 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 1 times [2022-04-27 12:13:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:36,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897680257] [2022-04-27 12:13:36,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:36,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:36,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:36,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478806111] [2022-04-27 12:13:36,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:36,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:36,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:36,488 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:36,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:13:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:36,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 12:13:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:36,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:37,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {3742#true} call ULTIMATE.init(); {3742#true} is VALID [2022-04-27 12:13:37,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {3742#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3742#true} is VALID [2022-04-27 12:13:37,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3742#true} {3742#true} #84#return; {3742#true} is VALID [2022-04-27 12:13:37,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {3742#true} call #t~ret5 := main(); {3742#true} is VALID [2022-04-27 12:13:37,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {3742#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {3742#true} is VALID [2022-04-27 12:13:37,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {3742#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3742#true} is VALID [2022-04-27 12:13:37,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:13:37,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:13:37,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3742#true} {3742#true} #60#return; {3742#true} is VALID [2022-04-27 12:13:37,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {3742#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:37,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:37,291 INFO L272 TraceCheckUtils]: 13: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-27 12:13:37,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:13:37,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:13:37,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,292 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:37,292 INFO L272 TraceCheckUtils]: 18: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3742#true} is VALID [2022-04-27 12:13:37,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:13:37,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:13:37,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,293 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:37,293 INFO L272 TraceCheckUtils]: 23: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-27 12:13:37,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:13:37,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:13:37,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,293 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:37,293 INFO L272 TraceCheckUtils]: 28: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3742#true} is VALID [2022-04-27 12:13:37,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:13:37,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:13:37,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,294 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:37,294 INFO L272 TraceCheckUtils]: 33: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3742#true} is VALID [2022-04-27 12:13:37,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:13:37,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:13:37,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,295 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:37,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:37,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !false; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:37,295 INFO L272 TraceCheckUtils]: 40: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-27 12:13:37,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:13:37,296 INFO L290 TraceCheckUtils]: 42: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:13:37,296 INFO L290 TraceCheckUtils]: 43: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,296 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #62#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:37,296 INFO L272 TraceCheckUtils]: 45: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3742#true} is VALID [2022-04-27 12:13:37,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:13:37,296 INFO L290 TraceCheckUtils]: 47: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:13:37,296 INFO L290 TraceCheckUtils]: 48: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,297 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #64#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:37,297 INFO L272 TraceCheckUtils]: 50: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-27 12:13:37,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:13:37,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:13:37,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,302 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #66#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:37,302 INFO L272 TraceCheckUtils]: 55: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3742#true} is VALID [2022-04-27 12:13:37,302 INFO L290 TraceCheckUtils]: 56: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:13:37,302 INFO L290 TraceCheckUtils]: 57: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:13:37,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,307 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #68#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:37,307 INFO L272 TraceCheckUtils]: 60: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3742#true} is VALID [2022-04-27 12:13:37,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:13:37,308 INFO L290 TraceCheckUtils]: 62: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:13:37,308 INFO L290 TraceCheckUtils]: 63: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,308 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #70#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:37,309 INFO L290 TraceCheckUtils]: 65: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-27 12:13:37,309 INFO L272 TraceCheckUtils]: 66: Hoare triple {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-27 12:13:37,309 INFO L290 TraceCheckUtils]: 67: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-27 12:13:37,309 INFO L290 TraceCheckUtils]: 68: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-27 12:13:37,309 INFO L290 TraceCheckUtils]: 69: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-27 12:13:37,309 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3742#true} {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-27 12:13:37,310 INFO L272 TraceCheckUtils]: 71: Hoare triple {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {3963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:37,310 INFO L290 TraceCheckUtils]: 72: Hoare triple {3963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:37,311 INFO L290 TraceCheckUtils]: 73: Hoare triple {3967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3743#false} is VALID [2022-04-27 12:13:37,311 INFO L290 TraceCheckUtils]: 74: Hoare triple {3743#false} assume !false; {3743#false} is VALID [2022-04-27 12:13:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 12:13:37,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:13:37,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:37,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897680257] [2022-04-27 12:13:37,666 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:37,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478806111] [2022-04-27 12:13:37,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478806111] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:13:37,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:13:37,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 12:13:37,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565952505] [2022-04-27 12:13:37,666 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:13:37,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2022-04-27 12:13:37,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:37,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:13:37,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:37,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:13:37,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:37,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:13:37,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:13:37,707 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:13:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:38,121 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-04-27 12:13:38,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:13:38,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2022-04-27 12:13:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:13:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-27 12:13:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:13:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-27 12:13:38,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2022-04-27 12:13:38,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:38,184 INFO L225 Difference]: With dead ends: 95 [2022-04-27 12:13:38,184 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 12:13:38,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:13:38,185 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:38,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 162 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:13:38,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 12:13:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-04-27 12:13:38,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:38,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:13:38,209 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:13:38,209 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:13:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:38,211 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-27 12:13:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-27 12:13:38,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:38,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:38,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 93 states. [2022-04-27 12:13:38,211 INFO L87 Difference]: Start difference. First operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 93 states. [2022-04-27 12:13:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:38,213 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-27 12:13:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-27 12:13:38,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:38,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:38,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:38,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:13:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-04-27 12:13:38,216 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 75 [2022-04-27 12:13:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:38,216 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-04-27 12:13:38,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:13:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-04-27 12:13:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-27 12:13:38,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:38,217 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:38,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:13:38,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:38,432 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:38,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 1 times [2022-04-27 12:13:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:38,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221024487] [2022-04-27 12:13:38,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:38,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:38,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [814580395] [2022-04-27 12:13:38,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:38,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:38,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:38,457 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:38,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:13:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:38,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 12:13:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:38,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:40,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {4552#true} call ULTIMATE.init(); {4552#true} is VALID [2022-04-27 12:13:40,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {4552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4552#true} is VALID [2022-04-27 12:13:40,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:13:40,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4552#true} {4552#true} #84#return; {4552#true} is VALID [2022-04-27 12:13:40,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {4552#true} call #t~ret5 := main(); {4552#true} is VALID [2022-04-27 12:13:40,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {4552#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {4572#(or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} is VALID [2022-04-27 12:13:40,901 INFO L272 TraceCheckUtils]: 6: Hoare triple {4572#(or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {4552#true} ~cond := #in~cond; {4579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:13:40,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {4579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:13:40,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {4583#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:13:40,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4583#(not (= |assume_abort_if_not_#in~cond| 0))} {4572#(or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} #60#return; {4590#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:13:40,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {4590#(and (<= main_~a~0 100) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-27 12:13:40,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} assume !false; {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-27 12:13:40,905 INFO L272 TraceCheckUtils]: 13: Hoare triple {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:13:40,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:13:40,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:13:40,906 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} #62#return; {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-27 12:13:40,906 INFO L272 TraceCheckUtils]: 18: Hoare triple {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:13:40,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:13:40,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:13:40,907 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} #64#return; {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-27 12:13:40,907 INFO L272 TraceCheckUtils]: 23: Hoare triple {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:13:40,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:13:40,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:13:40,908 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} #66#return; {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-27 12:13:40,908 INFO L272 TraceCheckUtils]: 28: Hoare triple {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:13:40,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:13:40,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:13:40,909 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} #68#return; {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-27 12:13:40,909 INFO L272 TraceCheckUtils]: 33: Hoare triple {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:13:40,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:13:40,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:13:40,910 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} #70#return; {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} is VALID [2022-04-27 12:13:40,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {4594#(and (= main_~x~0 0) (<= main_~a~0 100) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:40,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !false; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:40,911 INFO L272 TraceCheckUtils]: 40: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,911 INFO L290 TraceCheckUtils]: 41: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:13:40,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:13:40,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:13:40,912 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4552#true} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #62#return; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:40,912 INFO L272 TraceCheckUtils]: 45: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:13:40,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:13:40,912 INFO L290 TraceCheckUtils]: 48: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:13:40,913 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4552#true} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #64#return; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:40,913 INFO L272 TraceCheckUtils]: 50: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,913 INFO L290 TraceCheckUtils]: 51: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:13:40,913 INFO L290 TraceCheckUtils]: 52: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:13:40,913 INFO L290 TraceCheckUtils]: 53: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:13:40,914 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4552#true} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #66#return; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:40,914 INFO L272 TraceCheckUtils]: 55: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,914 INFO L290 TraceCheckUtils]: 56: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:13:40,914 INFO L290 TraceCheckUtils]: 57: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:13:40,914 INFO L290 TraceCheckUtils]: 58: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:13:40,914 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4552#true} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #68#return; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:40,915 INFO L272 TraceCheckUtils]: 60: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,915 INFO L290 TraceCheckUtils]: 61: Hoare triple {4552#true} ~cond := #in~cond; {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:40,915 INFO L290 TraceCheckUtils]: 62: Hoare triple {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:13:40,916 INFO L290 TraceCheckUtils]: 63: Hoare triple {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:13:40,916 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #70#return; {4757#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:13:40,917 INFO L290 TraceCheckUtils]: 65: Hoare triple {4757#(and (<= (+ main_~x~0 6) main_~y~0) (<= main_~a~0 100) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-27 12:13:40,917 INFO L272 TraceCheckUtils]: 66: Hoare triple {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,917 INFO L290 TraceCheckUtils]: 67: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-27 12:13:40,917 INFO L290 TraceCheckUtils]: 68: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-27 12:13:40,917 INFO L290 TraceCheckUtils]: 69: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-27 12:13:40,918 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4552#true} {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-27 12:13:40,918 INFO L272 TraceCheckUtils]: 71: Hoare triple {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4552#true} is VALID [2022-04-27 12:13:40,918 INFO L290 TraceCheckUtils]: 72: Hoare triple {4552#true} ~cond := #in~cond; {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:40,919 INFO L290 TraceCheckUtils]: 73: Hoare triple {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:13:40,919 INFO L290 TraceCheckUtils]: 74: Hoare triple {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:13:40,920 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #74#return; {4792#(and (<= 7 main_~y~0) (<= (+ 5 main_~y~0) main_~z~0) (< main_~a~0 1) (= main_~z~0 (+ (* main_~a~0 6) 12)))} is VALID [2022-04-27 12:13:40,921 INFO L272 TraceCheckUtils]: 76: Hoare triple {4792#(and (<= 7 main_~y~0) (<= (+ 5 main_~y~0) main_~z~0) (< main_~a~0 1) (= main_~z~0 (+ (* main_~a~0 6) 12)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {4796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:40,922 INFO L290 TraceCheckUtils]: 77: Hoare triple {4796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:40,922 INFO L290 TraceCheckUtils]: 78: Hoare triple {4800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4553#false} is VALID [2022-04-27 12:13:40,922 INFO L290 TraceCheckUtils]: 79: Hoare triple {4553#false} assume !false; {4553#false} is VALID [2022-04-27 12:13:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 79 proven. 12 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-04-27 12:13:40,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:08,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:08,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221024487] [2022-04-27 12:14:08,948 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:08,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814580395] [2022-04-27 12:14:08,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814580395] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:14:08,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:14:08,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 12:14:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796674408] [2022-04-27 12:14:08,948 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:08,949 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 80 [2022-04-27 12:14:08,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:08,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:08,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:08,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:14:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:09,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:14:09,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-04-27 12:14:09,000 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:13,202 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-04-27 12:14:13,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 12:14:13,202 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 80 [2022-04-27 12:14:13,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:13,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-27 12:14:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-27 12:14:13,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-27 12:14:13,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:13,282 INFO L225 Difference]: With dead ends: 103 [2022-04-27 12:14:13,282 INFO L226 Difference]: Without dead ends: 90 [2022-04-27 12:14:13,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2022-04-27 12:14:13,283 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:13,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 119 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 12:14:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-27 12:14:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-04-27 12:14:13,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:13,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:13,371 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:13,371 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:13,373 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-27 12:14:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-27 12:14:13,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:13,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:13,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-27 12:14:13,373 INFO L87 Difference]: Start difference. First operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-27 12:14:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:13,375 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-27 12:14:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-27 12:14:13,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:13,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:13,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:13,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-04-27 12:14:13,377 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 80 [2022-04-27 12:14:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:13,377 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-04-27 12:14:13,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 12:14:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-27 12:14:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-27 12:14:13,379 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:13,379 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:13,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 12:14:13,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 12:14:13,596 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 4 times [2022-04-27 12:14:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:13,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454707100] [2022-04-27 12:14:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:13,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:13,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:13,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880435416] [2022-04-27 12:14:13,607 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 12:14:13,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:13,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:13,614 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:14:13,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 12:14:13,675 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 12:14:13,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:14:13,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 12:14:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:13,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:14,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {5407#true} call ULTIMATE.init(); {5407#true} is VALID [2022-04-27 12:14:14,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {5407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5407#true} is VALID [2022-04-27 12:14:14,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5407#true} {5407#true} #84#return; {5407#true} is VALID [2022-04-27 12:14:14,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {5407#true} call #t~ret5 := main(); {5407#true} is VALID [2022-04-27 12:14:14,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {5407#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {5407#true} is VALID [2022-04-27 12:14:14,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {5407#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5407#true} {5407#true} #60#return; {5407#true} is VALID [2022-04-27 12:14:14,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {5407#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:14,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:14,163 INFO L272 TraceCheckUtils]: 13: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,164 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:14,164 INFO L272 TraceCheckUtils]: 18: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,164 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:14,164 INFO L272 TraceCheckUtils]: 23: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,165 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:14,165 INFO L272 TraceCheckUtils]: 28: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,166 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:14,166 INFO L272 TraceCheckUtils]: 33: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,167 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:14,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:14,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:14,168 INFO L272 TraceCheckUtils]: 40: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,169 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #62#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:14,169 INFO L272 TraceCheckUtils]: 45: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,169 INFO L290 TraceCheckUtils]: 46: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,172 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #64#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:14,172 INFO L272 TraceCheckUtils]: 50: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,172 INFO L290 TraceCheckUtils]: 51: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,172 INFO L290 TraceCheckUtils]: 52: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,172 INFO L290 TraceCheckUtils]: 53: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,173 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #66#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:14,173 INFO L272 TraceCheckUtils]: 55: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,173 INFO L290 TraceCheckUtils]: 56: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,173 INFO L290 TraceCheckUtils]: 57: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,173 INFO L290 TraceCheckUtils]: 58: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,173 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #68#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:14,173 INFO L272 TraceCheckUtils]: 60: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,174 INFO L290 TraceCheckUtils]: 61: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,174 INFO L290 TraceCheckUtils]: 62: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,174 INFO L290 TraceCheckUtils]: 63: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,175 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #70#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-27 12:14:14,175 INFO L290 TraceCheckUtils]: 65: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-27 12:14:14,175 INFO L290 TraceCheckUtils]: 66: Hoare triple {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} assume !false; {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-27 12:14:14,176 INFO L272 TraceCheckUtils]: 67: Hoare triple {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,176 INFO L290 TraceCheckUtils]: 68: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,176 INFO L290 TraceCheckUtils]: 69: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,176 INFO L290 TraceCheckUtils]: 70: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,176 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5407#true} {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} #62#return; {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-27 12:14:14,176 INFO L272 TraceCheckUtils]: 72: Hoare triple {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,176 INFO L290 TraceCheckUtils]: 73: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,176 INFO L290 TraceCheckUtils]: 74: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,176 INFO L290 TraceCheckUtils]: 75: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,177 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {5407#true} {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} #64#return; {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-27 12:14:14,177 INFO L272 TraceCheckUtils]: 77: Hoare triple {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:14,178 INFO L290 TraceCheckUtils]: 78: Hoare triple {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:14,178 INFO L290 TraceCheckUtils]: 79: Hoare triple {5650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5408#false} is VALID [2022-04-27 12:14:14,178 INFO L290 TraceCheckUtils]: 80: Hoare triple {5408#false} assume !false; {5408#false} is VALID [2022-04-27 12:14:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 12:14:14,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:14,631 INFO L290 TraceCheckUtils]: 80: Hoare triple {5408#false} assume !false; {5408#false} is VALID [2022-04-27 12:14:14,632 INFO L290 TraceCheckUtils]: 79: Hoare triple {5650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5408#false} is VALID [2022-04-27 12:14:14,632 INFO L290 TraceCheckUtils]: 78: Hoare triple {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:14,633 INFO L272 TraceCheckUtils]: 77: Hoare triple {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:14,633 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {5407#true} {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:14:14,633 INFO L290 TraceCheckUtils]: 75: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,633 INFO L290 TraceCheckUtils]: 74: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,633 INFO L290 TraceCheckUtils]: 73: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,633 INFO L272 TraceCheckUtils]: 72: Hoare triple {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,634 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5407#true} {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:14:14,634 INFO L290 TraceCheckUtils]: 70: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,634 INFO L290 TraceCheckUtils]: 69: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,634 INFO L290 TraceCheckUtils]: 68: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,634 INFO L272 TraceCheckUtils]: 67: Hoare triple {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,634 INFO L290 TraceCheckUtils]: 66: Hoare triple {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:14:14,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:14:14,644 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:14,644 INFO L290 TraceCheckUtils]: 63: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,644 INFO L290 TraceCheckUtils]: 62: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,644 INFO L272 TraceCheckUtils]: 60: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,655 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:14,655 INFO L290 TraceCheckUtils]: 58: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,655 INFO L290 TraceCheckUtils]: 57: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,655 INFO L272 TraceCheckUtils]: 55: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,656 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:14,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,656 INFO L272 TraceCheckUtils]: 50: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,656 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:14,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,657 INFO L272 TraceCheckUtils]: 45: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,657 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:14,657 INFO L290 TraceCheckUtils]: 43: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,657 INFO L290 TraceCheckUtils]: 42: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,657 INFO L290 TraceCheckUtils]: 41: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,657 INFO L272 TraceCheckUtils]: 40: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:14,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:14:14,660 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:14,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,661 INFO L272 TraceCheckUtils]: 33: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,661 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:14,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,661 INFO L272 TraceCheckUtils]: 28: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,662 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:14,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,662 INFO L272 TraceCheckUtils]: 23: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,662 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:14,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,663 INFO L272 TraceCheckUtils]: 18: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,663 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:14,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,663 INFO L272 TraceCheckUtils]: 13: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:14,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {5407#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-27 12:14:14,664 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5407#true} {5407#true} #60#return; {5407#true} is VALID [2022-04-27 12:14:14,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-27 12:14:14,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-27 12:14:14,664 INFO L272 TraceCheckUtils]: 6: Hoare triple {5407#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {5407#true} is VALID [2022-04-27 12:14:14,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {5407#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {5407#true} is VALID [2022-04-27 12:14:14,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {5407#true} call #t~ret5 := main(); {5407#true} is VALID [2022-04-27 12:14:14,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5407#true} {5407#true} #84#return; {5407#true} is VALID [2022-04-27 12:14:14,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-27 12:14:14,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {5407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5407#true} is VALID [2022-04-27 12:14:14,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {5407#true} call ULTIMATE.init(); {5407#true} is VALID [2022-04-27 12:14:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 12:14:14,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:14,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454707100] [2022-04-27 12:14:14,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:14,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880435416] [2022-04-27 12:14:14,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880435416] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:14:14,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:14:14,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 12:14:14,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672492064] [2022-04-27 12:14:14,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:14,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) Word has length 81 [2022-04-27 12:14:14,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:14,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-27 12:14:14,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:14,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:14:14,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:14,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:14:14,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:14:14,742 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-27 12:14:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:16,220 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2022-04-27 12:14:16,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:14:16,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) Word has length 81 [2022-04-27 12:14:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-27 12:14:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-27 12:14:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-27 12:14:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-27 12:14:16,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-27 12:14:18,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 81 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:18,385 INFO L225 Difference]: With dead ends: 106 [2022-04-27 12:14:18,385 INFO L226 Difference]: Without dead ends: 104 [2022-04-27 12:14:18,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:14:18,385 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:18,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 149 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 12:14:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-27 12:14:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2022-04-27 12:14:18,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:18,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:18,463 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:18,463 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:18,466 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-04-27 12:14:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2022-04-27 12:14:18,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:18,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:18,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 104 states. [2022-04-27 12:14:18,467 INFO L87 Difference]: Start difference. First operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 104 states. [2022-04-27 12:14:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:18,479 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-04-27 12:14:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2022-04-27 12:14:18,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:18,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:18,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:18,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:14:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-04-27 12:14:18,481 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 81 [2022-04-27 12:14:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:18,481 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-04-27 12:14:18,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-27 12:14:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-04-27 12:14:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-27 12:14:18,484 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:18,484 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:18,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:14:18,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:18,702 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:18,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:18,702 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 2 times [2022-04-27 12:14:18,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:18,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780675010] [2022-04-27 12:14:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:18,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:18,712 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:18,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245637940] [2022-04-27 12:14:18,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:14:18,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:18,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:18,718 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:14:18,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 12:14:18,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:14:18,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:14:18,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 12:14:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:18,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:19,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {6409#true} call ULTIMATE.init(); {6409#true} is VALID [2022-04-27 12:14:19,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {6409#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6409#true} is VALID [2022-04-27 12:14:19,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6409#true} {6409#true} #84#return; {6409#true} is VALID [2022-04-27 12:14:19,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {6409#true} call #t~ret5 := main(); {6409#true} is VALID [2022-04-27 12:14:19,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {6409#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {6409#true} is VALID [2022-04-27 12:14:19,622 INFO L272 TraceCheckUtils]: 6: Hoare triple {6409#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,622 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6409#true} {6409#true} #60#return; {6409#true} is VALID [2022-04-27 12:14:19,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {6409#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:19,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:19,644 INFO L272 TraceCheckUtils]: 13: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,645 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:19,645 INFO L272 TraceCheckUtils]: 18: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,646 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:19,646 INFO L272 TraceCheckUtils]: 23: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,646 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:19,647 INFO L272 TraceCheckUtils]: 28: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,647 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:19,647 INFO L272 TraceCheckUtils]: 33: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,648 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:19,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:19,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !false; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:19,649 INFO L272 TraceCheckUtils]: 40: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,650 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #62#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:19,650 INFO L272 TraceCheckUtils]: 45: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,650 INFO L290 TraceCheckUtils]: 47: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,651 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #64#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:19,651 INFO L272 TraceCheckUtils]: 50: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,651 INFO L290 TraceCheckUtils]: 51: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,651 INFO L290 TraceCheckUtils]: 52: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,651 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #66#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:19,651 INFO L272 TraceCheckUtils]: 55: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,651 INFO L290 TraceCheckUtils]: 58: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,652 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #68#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:19,652 INFO L272 TraceCheckUtils]: 60: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,652 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #70#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:14:19,653 INFO L290 TraceCheckUtils]: 65: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:19,653 INFO L290 TraceCheckUtils]: 66: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !false; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:19,653 INFO L272 TraceCheckUtils]: 67: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,653 INFO L290 TraceCheckUtils]: 68: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,653 INFO L290 TraceCheckUtils]: 69: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,654 INFO L290 TraceCheckUtils]: 70: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,654 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #62#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:19,654 INFO L272 TraceCheckUtils]: 72: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,654 INFO L290 TraceCheckUtils]: 73: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,654 INFO L290 TraceCheckUtils]: 74: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,654 INFO L290 TraceCheckUtils]: 75: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,655 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #64#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:19,655 INFO L272 TraceCheckUtils]: 77: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,655 INFO L290 TraceCheckUtils]: 78: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,655 INFO L290 TraceCheckUtils]: 79: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,655 INFO L290 TraceCheckUtils]: 80: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,655 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #66#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:19,655 INFO L272 TraceCheckUtils]: 82: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,655 INFO L290 TraceCheckUtils]: 83: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,656 INFO L290 TraceCheckUtils]: 84: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,656 INFO L290 TraceCheckUtils]: 85: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,656 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #68#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:19,656 INFO L272 TraceCheckUtils]: 87: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,656 INFO L290 TraceCheckUtils]: 88: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,656 INFO L290 TraceCheckUtils]: 89: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,656 INFO L290 TraceCheckUtils]: 90: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,657 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #70#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-27 12:14:19,657 INFO L290 TraceCheckUtils]: 92: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !(~n~0 <= ~a~0); {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-27 12:14:19,657 INFO L272 TraceCheckUtils]: 93: Hoare triple {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-27 12:14:19,657 INFO L290 TraceCheckUtils]: 94: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-27 12:14:19,657 INFO L290 TraceCheckUtils]: 95: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-27 12:14:19,658 INFO L290 TraceCheckUtils]: 96: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-27 12:14:19,658 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {6409#true} {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} #72#return; {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-27 12:14:19,659 INFO L272 TraceCheckUtils]: 98: Hoare triple {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6712#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:19,659 INFO L290 TraceCheckUtils]: 99: Hoare triple {6712#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6716#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:19,659 INFO L290 TraceCheckUtils]: 100: Hoare triple {6716#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6410#false} is VALID [2022-04-27 12:14:19,659 INFO L290 TraceCheckUtils]: 101: Hoare triple {6410#false} assume !false; {6410#false} is VALID [2022-04-27 12:14:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-27 12:14:19,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:20,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:20,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780675010] [2022-04-27 12:14:20,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:20,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245637940] [2022-04-27 12:14:20,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245637940] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:14:20,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:14:20,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 12:14:20,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583917994] [2022-04-27 12:14:20,050 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:20,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 102 [2022-04-27 12:14:20,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:20,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:14:20,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:20,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:14:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:14:20,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:14:20,100 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:14:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:20,778 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-04-27 12:14:20,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:14:20,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 102 [2022-04-27 12:14:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:14:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-27 12:14:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:14:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-27 12:14:20,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-27 12:14:20,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:20,868 INFO L225 Difference]: With dead ends: 118 [2022-04-27 12:14:20,868 INFO L226 Difference]: Without dead ends: 116 [2022-04-27 12:14:20,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 12:14:20,868 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:20,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 198 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:14:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-27 12:14:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-04-27 12:14:20,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:20,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:14:20,948 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:14:20,949 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:14:20,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:20,960 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-04-27 12:14:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-04-27 12:14:20,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:20,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:20,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 116 states. [2022-04-27 12:14:20,961 INFO L87 Difference]: Start difference. First operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 116 states. [2022-04-27 12:14:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:20,962 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-04-27 12:14:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-04-27 12:14:20,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:20,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:20,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:20,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:14:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2022-04-27 12:14:20,965 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 102 [2022-04-27 12:14:20,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:20,965 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2022-04-27 12:14:20,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:14:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2022-04-27 12:14:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-27 12:14:20,966 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:20,966 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:21,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 12:14:21,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 12:14:21,196 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:21,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:21,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 2 times [2022-04-27 12:14:21,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:21,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247470872] [2022-04-27 12:14:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:21,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:21,229 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:21,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401259516] [2022-04-27 12:14:21,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:14:21,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:21,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:21,235 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:14:21,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 12:14:21,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:14:21,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:14:21,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 12:14:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:21,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:22,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {7413#true} call ULTIMATE.init(); {7413#true} is VALID [2022-04-27 12:14:22,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {7413#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7413#true} is VALID [2022-04-27 12:14:22,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7413#true} {7413#true} #84#return; {7413#true} is VALID [2022-04-27 12:14:22,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {7413#true} call #t~ret5 := main(); {7413#true} is VALID [2022-04-27 12:14:22,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {7413#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {7413#true} is VALID [2022-04-27 12:14:22,077 INFO L272 TraceCheckUtils]: 6: Hoare triple {7413#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,077 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7413#true} {7413#true} #60#return; {7413#true} is VALID [2022-04-27 12:14:22,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {7413#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:22,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:22,078 INFO L272 TraceCheckUtils]: 13: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,079 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:22,079 INFO L272 TraceCheckUtils]: 18: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,079 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:22,079 INFO L272 TraceCheckUtils]: 23: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,080 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:22,080 INFO L272 TraceCheckUtils]: 28: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,081 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:22,081 INFO L272 TraceCheckUtils]: 33: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,081 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:14:22,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:22,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} assume !false; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:22,082 INFO L272 TraceCheckUtils]: 40: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,082 INFO L290 TraceCheckUtils]: 41: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,082 INFO L290 TraceCheckUtils]: 42: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,082 INFO L290 TraceCheckUtils]: 43: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,083 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #62#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:22,083 INFO L272 TraceCheckUtils]: 45: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,083 INFO L290 TraceCheckUtils]: 46: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,083 INFO L290 TraceCheckUtils]: 47: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,083 INFO L290 TraceCheckUtils]: 48: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,083 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #64#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:22,083 INFO L272 TraceCheckUtils]: 50: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,084 INFO L290 TraceCheckUtils]: 51: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,084 INFO L290 TraceCheckUtils]: 52: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,084 INFO L290 TraceCheckUtils]: 53: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,084 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #66#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:22,084 INFO L272 TraceCheckUtils]: 55: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,084 INFO L290 TraceCheckUtils]: 56: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,084 INFO L290 TraceCheckUtils]: 57: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,084 INFO L290 TraceCheckUtils]: 58: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,085 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #68#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:22,085 INFO L272 TraceCheckUtils]: 60: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,085 INFO L290 TraceCheckUtils]: 61: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,085 INFO L290 TraceCheckUtils]: 62: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,085 INFO L290 TraceCheckUtils]: 63: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,085 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #70#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:14:22,086 INFO L290 TraceCheckUtils]: 65: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:22,086 INFO L290 TraceCheckUtils]: 66: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} assume !false; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:22,086 INFO L272 TraceCheckUtils]: 67: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,086 INFO L290 TraceCheckUtils]: 68: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,086 INFO L290 TraceCheckUtils]: 69: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,086 INFO L290 TraceCheckUtils]: 70: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,088 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #62#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:22,088 INFO L272 TraceCheckUtils]: 72: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,088 INFO L290 TraceCheckUtils]: 73: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,088 INFO L290 TraceCheckUtils]: 74: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,088 INFO L290 TraceCheckUtils]: 75: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,088 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #64#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:22,088 INFO L272 TraceCheckUtils]: 77: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,088 INFO L290 TraceCheckUtils]: 78: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,088 INFO L290 TraceCheckUtils]: 79: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,089 INFO L290 TraceCheckUtils]: 80: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,090 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #66#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:22,090 INFO L272 TraceCheckUtils]: 82: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,090 INFO L290 TraceCheckUtils]: 83: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,090 INFO L290 TraceCheckUtils]: 84: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,090 INFO L290 TraceCheckUtils]: 85: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,090 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #68#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:22,090 INFO L272 TraceCheckUtils]: 87: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,090 INFO L290 TraceCheckUtils]: 88: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,091 INFO L290 TraceCheckUtils]: 89: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,091 INFO L290 TraceCheckUtils]: 90: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,091 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #70#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:22,092 INFO L290 TraceCheckUtils]: 92: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} assume !(~n~0 <= ~a~0); {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:22,092 INFO L272 TraceCheckUtils]: 93: Hoare triple {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,092 INFO L290 TraceCheckUtils]: 94: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,092 INFO L290 TraceCheckUtils]: 95: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,092 INFO L290 TraceCheckUtils]: 96: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,093 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {7413#true} {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} #72#return; {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:22,093 INFO L272 TraceCheckUtils]: 98: Hoare triple {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {7413#true} is VALID [2022-04-27 12:14:22,093 INFO L290 TraceCheckUtils]: 99: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-27 12:14:22,093 INFO L290 TraceCheckUtils]: 100: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-27 12:14:22,093 INFO L290 TraceCheckUtils]: 101: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-27 12:14:22,094 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {7413#true} {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} #74#return; {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-27 12:14:22,094 INFO L272 TraceCheckUtils]: 103: Hoare triple {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {7731#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:22,095 INFO L290 TraceCheckUtils]: 104: Hoare triple {7731#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7735#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:22,096 INFO L290 TraceCheckUtils]: 105: Hoare triple {7735#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7414#false} is VALID [2022-04-27 12:14:22,096 INFO L290 TraceCheckUtils]: 106: Hoare triple {7414#false} assume !false; {7414#false} is VALID [2022-04-27 12:14:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-27 12:14:22,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:26,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:26,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247470872] [2022-04-27 12:14:26,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:26,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401259516] [2022-04-27 12:14:26,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401259516] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:14:26,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:14:26,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 12:14:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010349525] [2022-04-27 12:14:26,727 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:26,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-27 12:14:26,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:26,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 12:14:26,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:26,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:14:26,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:26,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:14:26,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:14:26,779 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 12:14:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:27,511 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2022-04-27 12:14:27,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:14:27,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-27 12:14:27,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 12:14:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-27 12:14:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 12:14:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-27 12:14:27,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-27 12:14:27,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:27,648 INFO L225 Difference]: With dead ends: 126 [2022-04-27 12:14:27,648 INFO L226 Difference]: Without dead ends: 113 [2022-04-27 12:14:27,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 12:14:27,649 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:27,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 207 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:14:27,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-27 12:14:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-27 12:14:27,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:27,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:14:27,722 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:14:27,722 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:14:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:27,730 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-04-27 12:14:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-04-27 12:14:27,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:27,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:27,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 113 states. [2022-04-27 12:14:27,734 INFO L87 Difference]: Start difference. First operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 113 states. [2022-04-27 12:14:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:27,749 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-04-27 12:14:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-04-27 12:14:27,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:27,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:27,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:27,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:14:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2022-04-27 12:14:27,752 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 107 [2022-04-27 12:14:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:27,752 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2022-04-27 12:14:27,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-27 12:14:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-04-27 12:14:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-27 12:14:27,753 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:27,753 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:27,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 12:14:27,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 12:14:27,973 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:27,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:27,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 3 times [2022-04-27 12:14:27,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:27,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185681551] [2022-04-27 12:14:27,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:27,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:27,985 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:27,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [674915122] [2022-04-27 12:14:27,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:14:27,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:27,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:28,006 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:14:28,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 12:14:28,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 12:14:28,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:14:28,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 12:14:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:28,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:30,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {8447#true} call ULTIMATE.init(); {8447#true} is VALID [2022-04-27 12:14:30,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {8447#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8447#true} is VALID [2022-04-27 12:14:30,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8447#true} {8447#true} #84#return; {8447#true} is VALID [2022-04-27 12:14:30,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {8447#true} call #t~ret5 := main(); {8447#true} is VALID [2022-04-27 12:14:30,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {8447#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {8447#true} is VALID [2022-04-27 12:14:30,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {8447#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {8447#true} ~cond := #in~cond; {8473#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:14:30,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {8473#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8477#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:14:30,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {8477#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8477#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:14:30,222 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8477#(not (= |assume_abort_if_not_#in~cond| 0))} {8447#true} #60#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,223 INFO L272 TraceCheckUtils]: 13: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,224 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,224 INFO L272 TraceCheckUtils]: 18: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,224 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #64#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,224 INFO L272 TraceCheckUtils]: 23: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,225 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #66#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,225 INFO L272 TraceCheckUtils]: 28: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,226 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #68#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,226 INFO L272 TraceCheckUtils]: 33: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,229 INFO L290 TraceCheckUtils]: 36: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,230 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #70#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,230 INFO L290 TraceCheckUtils]: 38: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,230 INFO L290 TraceCheckUtils]: 39: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,230 INFO L272 TraceCheckUtils]: 40: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,230 INFO L290 TraceCheckUtils]: 42: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,231 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,231 INFO L272 TraceCheckUtils]: 45: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,231 INFO L290 TraceCheckUtils]: 48: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,232 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #64#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,232 INFO L272 TraceCheckUtils]: 50: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,232 INFO L290 TraceCheckUtils]: 51: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,232 INFO L290 TraceCheckUtils]: 52: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,232 INFO L290 TraceCheckUtils]: 53: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,232 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #66#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,232 INFO L272 TraceCheckUtils]: 55: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,233 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #68#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,233 INFO L272 TraceCheckUtils]: 60: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,233 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #70#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,234 INFO L272 TraceCheckUtils]: 67: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,234 INFO L290 TraceCheckUtils]: 68: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,234 INFO L290 TraceCheckUtils]: 69: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,234 INFO L290 TraceCheckUtils]: 70: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,235 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,235 INFO L272 TraceCheckUtils]: 72: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,235 INFO L290 TraceCheckUtils]: 73: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,235 INFO L290 TraceCheckUtils]: 74: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,235 INFO L290 TraceCheckUtils]: 75: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,235 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #64#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,235 INFO L272 TraceCheckUtils]: 77: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,236 INFO L290 TraceCheckUtils]: 78: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,236 INFO L290 TraceCheckUtils]: 79: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,236 INFO L290 TraceCheckUtils]: 80: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,236 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #66#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,236 INFO L272 TraceCheckUtils]: 82: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,236 INFO L290 TraceCheckUtils]: 83: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,236 INFO L290 TraceCheckUtils]: 84: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,236 INFO L290 TraceCheckUtils]: 85: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,237 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #68#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,237 INFO L272 TraceCheckUtils]: 87: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,237 INFO L290 TraceCheckUtils]: 88: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,237 INFO L290 TraceCheckUtils]: 89: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,237 INFO L290 TraceCheckUtils]: 90: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,237 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {8447#true} {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #70#return; {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,238 INFO L290 TraceCheckUtils]: 92: Hoare triple {8484#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8731#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,238 INFO L290 TraceCheckUtils]: 93: Hoare triple {8731#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {8731#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,238 INFO L272 TraceCheckUtils]: 94: Hoare triple {8731#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,239 INFO L290 TraceCheckUtils]: 95: Hoare triple {8447#true} ~cond := #in~cond; {8741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:30,239 INFO L290 TraceCheckUtils]: 96: Hoare triple {8741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:30,239 INFO L290 TraceCheckUtils]: 97: Hoare triple {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:30,240 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} {8731#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,240 INFO L272 TraceCheckUtils]: 99: Hoare triple {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,240 INFO L290 TraceCheckUtils]: 100: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,240 INFO L290 TraceCheckUtils]: 101: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,240 INFO L290 TraceCheckUtils]: 102: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,240 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {8447#true} {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #64#return; {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,240 INFO L272 TraceCheckUtils]: 104: Hoare triple {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,240 INFO L290 TraceCheckUtils]: 105: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,240 INFO L290 TraceCheckUtils]: 106: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,240 INFO L290 TraceCheckUtils]: 107: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,241 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8447#true} {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #66#return; {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,241 INFO L272 TraceCheckUtils]: 109: Hoare triple {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,241 INFO L290 TraceCheckUtils]: 110: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,241 INFO L290 TraceCheckUtils]: 111: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,241 INFO L290 TraceCheckUtils]: 112: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,241 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {8447#true} {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #68#return; {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,241 INFO L272 TraceCheckUtils]: 114: Hoare triple {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,242 INFO L290 TraceCheckUtils]: 115: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,242 INFO L290 TraceCheckUtils]: 116: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,242 INFO L290 TraceCheckUtils]: 117: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,242 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {8447#true} {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #70#return; {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-27 12:14:30,243 INFO L290 TraceCheckUtils]: 119: Hoare triple {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} assume !(~n~0 <= ~a~0); {8816#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-27 12:14:30,243 INFO L272 TraceCheckUtils]: 120: Hoare triple {8816#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-27 12:14:30,243 INFO L290 TraceCheckUtils]: 121: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-27 12:14:30,244 INFO L290 TraceCheckUtils]: 122: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-27 12:14:30,244 INFO L290 TraceCheckUtils]: 123: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-27 12:14:30,244 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {8447#true} {8816#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #72#return; {8816#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-27 12:14:32,266 WARN L272 TraceCheckUtils]: 125: Hoare triple {8816#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8835#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-27 12:14:32,266 INFO L290 TraceCheckUtils]: 126: Hoare triple {8835#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8839#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:32,267 INFO L290 TraceCheckUtils]: 127: Hoare triple {8839#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8448#false} is VALID [2022-04-27 12:14:32,267 INFO L290 TraceCheckUtils]: 128: Hoare triple {8448#false} assume !false; {8448#false} is VALID [2022-04-27 12:14:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-04-27 12:14:32,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:32,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185681551] [2022-04-27 12:14:32,580 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:32,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674915122] [2022-04-27 12:14:32,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674915122] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:14:32,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:14:32,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 12:14:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006146676] [2022-04-27 12:14:32,580 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:32,581 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 129 [2022-04-27 12:14:32,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:32,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:14:34,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:34,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 12:14:34,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:34,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 12:14:34,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-27 12:14:34,634 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:14:40,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:14:43,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:14:47,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:14:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:47,504 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-04-27 12:14:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:14:47,505 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 129 [2022-04-27 12:14:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:14:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:14:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2022-04-27 12:14:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:14:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2022-04-27 12:14:47,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 40 transitions. [2022-04-27 12:14:47,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:47,911 INFO L225 Difference]: With dead ends: 119 [2022-04-27 12:14:47,911 INFO L226 Difference]: Without dead ends: 115 [2022-04-27 12:14:47,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-27 12:14:47,912 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:14:47,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 106 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 168 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-04-27 12:14:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-27 12:14:48,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-27 12:14:48,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:14:48,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:14:48,032 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:14:48,032 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:14:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:48,038 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-27 12:14:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-27 12:14:48,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:48,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:48,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 115 states. [2022-04-27 12:14:48,039 INFO L87 Difference]: Start difference. First operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 115 states. [2022-04-27 12:14:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:14:48,041 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-27 12:14:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-27 12:14:48,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:14:48,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:14:48,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:14:48,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:14:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:14:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2022-04-27 12:14:48,043 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 129 [2022-04-27 12:14:48,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:14:48,043 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2022-04-27 12:14:48,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:14:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-27 12:14:48,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-27 12:14:48,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:14:48,044 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:14:48,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 12:14:48,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 12:14:48,249 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:14:48,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:14:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 3 times [2022-04-27 12:14:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:14:48,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490777383] [2022-04-27 12:14:48,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:14:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:14:48,265 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:14:48,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5026203] [2022-04-27 12:14:48,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:14:48,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:14:48,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:14:48,268 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:14:48,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 12:14:48,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 12:14:48,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:14:48,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-27 12:14:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:14:48,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:15:15,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {9435#true} call ULTIMATE.init(); {9435#true} is VALID [2022-04-27 12:15:15,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {9435#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); {9443#(= (select |#valid| 0) 0)} is VALID [2022-04-27 12:15:15,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {9443#(= (select |#valid| 0) 0)} assume true; {9443#(= (select |#valid| 0) 0)} is VALID [2022-04-27 12:15:15,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9443#(= (select |#valid| 0) 0)} {9435#true} #84#return; {9435#true} is VALID [2022-04-27 12:15:15,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {9435#true} call #t~ret5 := main(); {9435#true} is VALID [2022-04-27 12:15:15,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {9435#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {9456#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} is VALID [2022-04-27 12:15:15,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {9456#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {9435#true} ~cond := #in~cond; {9463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:15:15,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {9463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:15:15,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {9467#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:15:15,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9467#(not (= |assume_abort_if_not_#in~cond| 0))} {9456#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} #60#return; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,733 INFO L272 TraceCheckUtils]: 13: Hoare triple {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,734 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9435#true} {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,734 INFO L272 TraceCheckUtils]: 18: Hoare triple {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,735 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9435#true} {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #64#return; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,735 INFO L272 TraceCheckUtils]: 23: Hoare triple {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,735 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9435#true} {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #66#return; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,735 INFO L272 TraceCheckUtils]: 28: Hoare triple {9474#(and (<= main_~a~0 100) (<= 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)); {9435#true} is VALID [2022-04-27 12:15:15,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,736 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9435#true} {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #68#return; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,736 INFO L272 TraceCheckUtils]: 33: Hoare triple {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,736 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9435#true} {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #70#return; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,737 INFO L272 TraceCheckUtils]: 40: Hoare triple {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,738 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9435#true} {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,738 INFO L272 TraceCheckUtils]: 45: Hoare triple {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,738 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9435#true} {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #64#return; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,738 INFO L272 TraceCheckUtils]: 50: Hoare triple {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,739 INFO L290 TraceCheckUtils]: 51: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,739 INFO L290 TraceCheckUtils]: 52: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,739 INFO L290 TraceCheckUtils]: 53: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,739 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9435#true} {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #66#return; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,739 INFO L272 TraceCheckUtils]: 55: Hoare triple {9474#(and (<= main_~a~0 100) (<= 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)); {9435#true} is VALID [2022-04-27 12:15:15,739 INFO L290 TraceCheckUtils]: 56: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,739 INFO L290 TraceCheckUtils]: 57: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,739 INFO L290 TraceCheckUtils]: 58: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,740 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9435#true} {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #68#return; {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,740 INFO L272 TraceCheckUtils]: 60: Hoare triple {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,740 INFO L290 TraceCheckUtils]: 61: Hoare triple {9435#true} ~cond := #in~cond; {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:15,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:15,742 INFO L290 TraceCheckUtils]: 63: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:15,743 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9474#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #70#return; {9639#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {9639#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,745 INFO L272 TraceCheckUtils]: 67: Hoare triple {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,745 INFO L290 TraceCheckUtils]: 68: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,745 INFO L290 TraceCheckUtils]: 69: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,746 INFO L290 TraceCheckUtils]: 70: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,746 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9435#true} {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,746 INFO L272 TraceCheckUtils]: 72: Hoare triple {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,746 INFO L290 TraceCheckUtils]: 73: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,746 INFO L290 TraceCheckUtils]: 74: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,746 INFO L290 TraceCheckUtils]: 75: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,747 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9435#true} {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} #64#return; {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,747 INFO L272 TraceCheckUtils]: 77: Hoare triple {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,747 INFO L290 TraceCheckUtils]: 78: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,747 INFO L290 TraceCheckUtils]: 79: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,747 INFO L290 TraceCheckUtils]: 80: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,747 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9435#true} {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} #66#return; {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,747 INFO L272 TraceCheckUtils]: 82: Hoare triple {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 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)); {9435#true} is VALID [2022-04-27 12:15:15,748 INFO L290 TraceCheckUtils]: 83: Hoare triple {9435#true} ~cond := #in~cond; {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:15,748 INFO L290 TraceCheckUtils]: 84: Hoare triple {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:15,748 INFO L290 TraceCheckUtils]: 85: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:15,749 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9643#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (<= 0 main_~a~0))} #68#return; {9707#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,749 INFO L272 TraceCheckUtils]: 87: Hoare triple {9707#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,749 INFO L290 TraceCheckUtils]: 88: Hoare triple {9435#true} ~cond := #in~cond; {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:15,750 INFO L290 TraceCheckUtils]: 89: Hoare triple {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:15,750 INFO L290 TraceCheckUtils]: 90: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:15,751 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9707#(and (exists ((v_main_~z~0_48 Int)) (and (<= main_~z~0 (+ v_main_~z~0_48 6)) (= (+ 12 (* v_main_~z~0_48 v_main_~z~0_48)) (+ (* main_~y~0 12) (* v_main_~z~0_48 (- 6)))))) (<= main_~a~0 100) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} #70#return; {9723#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,758 INFO L290 TraceCheckUtils]: 92: Hoare triple {9723#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9723#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,759 INFO L290 TraceCheckUtils]: 93: Hoare triple {9723#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} assume !false; {9723#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,759 INFO L272 TraceCheckUtils]: 94: Hoare triple {9723#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,759 INFO L290 TraceCheckUtils]: 95: Hoare triple {9435#true} ~cond := #in~cond; {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:15,759 INFO L290 TraceCheckUtils]: 96: Hoare triple {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:15,760 INFO L290 TraceCheckUtils]: 97: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:15,760 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9723#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0))} #62#return; {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,761 INFO L272 TraceCheckUtils]: 99: Hoare triple {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,761 INFO L290 TraceCheckUtils]: 100: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,761 INFO L290 TraceCheckUtils]: 101: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,761 INFO L290 TraceCheckUtils]: 102: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,764 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {9435#true} {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #64#return; {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,764 INFO L272 TraceCheckUtils]: 104: Hoare triple {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,764 INFO L290 TraceCheckUtils]: 105: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,764 INFO L290 TraceCheckUtils]: 106: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,764 INFO L290 TraceCheckUtils]: 107: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,764 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9435#true} {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #66#return; {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,765 INFO L272 TraceCheckUtils]: 109: Hoare triple {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,765 INFO L290 TraceCheckUtils]: 110: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,765 INFO L290 TraceCheckUtils]: 111: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,765 INFO L290 TraceCheckUtils]: 112: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,765 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {9435#true} {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #68#return; {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,765 INFO L272 TraceCheckUtils]: 114: Hoare triple {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,765 INFO L290 TraceCheckUtils]: 115: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,765 INFO L290 TraceCheckUtils]: 116: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,765 INFO L290 TraceCheckUtils]: 117: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,766 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {9435#true} {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #70#return; {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-27 12:15:15,768 INFO L290 TraceCheckUtils]: 119: Hoare triple {9745#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} assume !(~n~0 <= ~a~0); {9809#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (= (mod main_~z~0 6) 0))} is VALID [2022-04-27 12:15:15,768 INFO L272 TraceCheckUtils]: 120: Hoare triple {9809#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:15,768 INFO L290 TraceCheckUtils]: 121: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:15,768 INFO L290 TraceCheckUtils]: 122: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:15,768 INFO L290 TraceCheckUtils]: 123: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:15,769 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {9435#true} {9809#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (= (mod main_~z~0 6) 0))} #72#return; {9809#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (= (mod main_~z~0 6) 0))} is VALID [2022-04-27 12:15:15,769 INFO L272 TraceCheckUtils]: 125: Hoare triple {9809#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (= (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)); {9435#true} is VALID [2022-04-27 12:15:15,769 INFO L290 TraceCheckUtils]: 126: Hoare triple {9435#true} ~cond := #in~cond; {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:15,769 INFO L290 TraceCheckUtils]: 127: Hoare triple {9628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:15,770 INFO L290 TraceCheckUtils]: 128: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:15,775 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9809#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (= (mod main_~z~0 6) 0))} #74#return; {9840#(and (= (+ (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 12) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6)) (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18))) (<= main_~a~0 100) (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} is VALID [2022-04-27 12:15:15,778 INFO L272 TraceCheckUtils]: 130: Hoare triple {9840#(and (= (+ (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 12) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6)) (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18))) (<= main_~a~0 100) (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {9844#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:15:15,779 INFO L290 TraceCheckUtils]: 131: Hoare triple {9844#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9848#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:15,779 INFO L290 TraceCheckUtils]: 132: Hoare triple {9848#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9436#false} is VALID [2022-04-27 12:15:15,779 INFO L290 TraceCheckUtils]: 133: Hoare triple {9436#false} assume !false; {9436#false} is VALID [2022-04-27 12:15:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 261 proven. 74 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2022-04-27 12:15:15,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:15:53,469 INFO L290 TraceCheckUtils]: 133: Hoare triple {9436#false} assume !false; {9436#false} is VALID [2022-04-27 12:15:53,469 INFO L290 TraceCheckUtils]: 132: Hoare triple {9848#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9436#false} is VALID [2022-04-27 12:15:53,470 INFO L290 TraceCheckUtils]: 131: Hoare triple {9844#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9848#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:53,470 INFO L272 TraceCheckUtils]: 130: Hoare triple {9864#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {9844#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:15:53,471 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9868#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} #74#return; {9864#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-27 12:15:53,471 INFO L290 TraceCheckUtils]: 128: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:53,472 INFO L290 TraceCheckUtils]: 127: Hoare triple {9878#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:53,472 INFO L290 TraceCheckUtils]: 126: Hoare triple {9435#true} ~cond := #in~cond; {9878#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:15:53,472 INFO L272 TraceCheckUtils]: 125: Hoare triple {9868#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,472 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {9435#true} {9868#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} #72#return; {9868#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} is VALID [2022-04-27 12:15:53,473 INFO L290 TraceCheckUtils]: 123: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,473 INFO L290 TraceCheckUtils]: 122: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,473 INFO L290 TraceCheckUtils]: 121: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,473 INFO L272 TraceCheckUtils]: 120: Hoare triple {9868#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,473 INFO L290 TraceCheckUtils]: 119: Hoare triple {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {9868#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} is VALID [2022-04-27 12:15:53,474 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {9435#true} {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #70#return; {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:15:53,474 INFO L290 TraceCheckUtils]: 117: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,474 INFO L290 TraceCheckUtils]: 116: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,474 INFO L290 TraceCheckUtils]: 115: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,474 INFO L272 TraceCheckUtils]: 114: Hoare triple {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,474 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {9435#true} {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #68#return; {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:15:53,474 INFO L290 TraceCheckUtils]: 112: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,474 INFO L290 TraceCheckUtils]: 111: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,474 INFO L290 TraceCheckUtils]: 110: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,475 INFO L272 TraceCheckUtils]: 109: Hoare triple {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,475 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9435#true} {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #66#return; {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:15:53,475 INFO L290 TraceCheckUtils]: 107: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,475 INFO L290 TraceCheckUtils]: 106: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,475 INFO L290 TraceCheckUtils]: 105: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,475 INFO L272 TraceCheckUtils]: 104: Hoare triple {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,476 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {9435#true} {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #64#return; {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:15:53,476 INFO L290 TraceCheckUtils]: 102: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,476 INFO L290 TraceCheckUtils]: 101: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,476 INFO L290 TraceCheckUtils]: 100: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,476 INFO L272 TraceCheckUtils]: 99: Hoare triple {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,477 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9964#(or (not (= (mod main_~z~0 6) 0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0))} #62#return; {9900#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:15:53,477 INFO L290 TraceCheckUtils]: 97: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:53,478 INFO L290 TraceCheckUtils]: 96: Hoare triple {9878#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:53,478 INFO L290 TraceCheckUtils]: 95: Hoare triple {9435#true} ~cond := #in~cond; {9878#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:15:53,478 INFO L272 TraceCheckUtils]: 94: Hoare triple {9964#(or (not (= (mod main_~z~0 6) 0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,479 INFO L290 TraceCheckUtils]: 93: Hoare triple {9964#(or (not (= (mod main_~z~0 6) 0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0))} assume !false; {9964#(or (not (= (mod main_~z~0 6) 0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0))} is VALID [2022-04-27 12:15:53,484 INFO L290 TraceCheckUtils]: 92: Hoare triple {9983#(or (<= (div main_~z~0 6) main_~a~0) (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 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)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9964#(or (not (= (mod main_~z~0 6) 0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0))} is VALID [2022-04-27 12:15:53,485 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9987#(or (<= (div main_~z~0 6) main_~a~0) (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 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_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} #70#return; {9983#(or (<= (div main_~z~0 6) main_~a~0) (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 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)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} is VALID [2022-04-27 12:15:53,485 INFO L290 TraceCheckUtils]: 90: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:53,485 INFO L290 TraceCheckUtils]: 89: Hoare triple {9878#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:53,486 INFO L290 TraceCheckUtils]: 88: Hoare triple {9435#true} ~cond := #in~cond; {9878#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:15:53,486 INFO L272 TraceCheckUtils]: 87: Hoare triple {9987#(or (<= (div main_~z~0 6) main_~a~0) (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 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_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,527 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} {9435#true} #68#return; {9987#(or (<= (div main_~z~0 6) main_~a~0) (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 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_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} is VALID [2022-04-27 12:15:53,527 INFO L290 TraceCheckUtils]: 85: Hoare triple {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:53,527 INFO L290 TraceCheckUtils]: 84: Hoare triple {9878#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:15:53,528 INFO L290 TraceCheckUtils]: 83: Hoare triple {9435#true} ~cond := #in~cond; {9878#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:15:53,528 INFO L272 TraceCheckUtils]: 82: Hoare triple {9435#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9435#true} {9435#true} #66#return; {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L290 TraceCheckUtils]: 80: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L290 TraceCheckUtils]: 79: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L290 TraceCheckUtils]: 78: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L272 TraceCheckUtils]: 77: Hoare triple {9435#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9435#true} {9435#true} #64#return; {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L290 TraceCheckUtils]: 75: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L290 TraceCheckUtils]: 74: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L290 TraceCheckUtils]: 73: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L272 TraceCheckUtils]: 72: Hoare triple {9435#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9435#true} {9435#true} #62#return; {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L290 TraceCheckUtils]: 70: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,528 INFO L290 TraceCheckUtils]: 69: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L272 TraceCheckUtils]: 67: Hoare triple {9435#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {9435#true} assume !false; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {9435#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; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9435#true} {9435#true} #70#return; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 63: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 62: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 61: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L272 TraceCheckUtils]: 60: Hoare triple {9435#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9435#true} {9435#true} #68#return; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 58: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 57: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 56: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L272 TraceCheckUtils]: 55: Hoare triple {9435#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9435#true} {9435#true} #66#return; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 53: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 51: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L272 TraceCheckUtils]: 50: Hoare triple {9435#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9435#true} {9435#true} #64#return; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 46: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L272 TraceCheckUtils]: 45: Hoare triple {9435#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9435#true} {9435#true} #62#return; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L272 TraceCheckUtils]: 40: Hoare triple {9435#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {9435#true} assume !false; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {9435#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; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9435#true} {9435#true} #70#return; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L272 TraceCheckUtils]: 33: Hoare triple {9435#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9435#true} {9435#true} #68#return; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L272 TraceCheckUtils]: 28: Hoare triple {9435#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9435#true} {9435#true} #66#return; {9435#true} is VALID [2022-04-27 12:15:53,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L272 TraceCheckUtils]: 23: Hoare triple {9435#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9435#true} {9435#true} #64#return; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L272 TraceCheckUtils]: 18: Hoare triple {9435#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9435#true} {9435#true} #62#return; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L272 TraceCheckUtils]: 13: Hoare triple {9435#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {9435#true} assume !false; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {9435#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9435#true} {9435#true} #60#return; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L272 TraceCheckUtils]: 6: Hoare triple {9435#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {9435#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; {9435#true} is VALID [2022-04-27 12:15:53,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {9435#true} call #t~ret5 := main(); {9435#true} is VALID [2022-04-27 12:15:53,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9435#true} {9435#true} #84#return; {9435#true} is VALID [2022-04-27 12:15:53,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-27 12:15:53,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {9435#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); {9435#true} is VALID [2022-04-27 12:15:53,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {9435#true} call ULTIMATE.init(); {9435#true} is VALID [2022-04-27 12:15:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 234 proven. 51 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2022-04-27 12:15:53,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:15:53,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490777383] [2022-04-27 12:15:53,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:15:53,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5026203] [2022-04-27 12:15:53,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5026203] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:15:53,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:15:53,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 25 [2022-04-27 12:15:53,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542871107] [2022-04-27 12:15:53,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:15:53,533 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 14 states have call predecessors, (36), 12 states have call successors, (36) Word has length 134 [2022-04-27 12:15:53,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:15:53,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 14 states have call predecessors, (36), 12 states have call successors, (36) [2022-04-27 12:15:53,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:53,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 12:15:53,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:15:53,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 12:15:53,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-04-27 12:15:53,674 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand has 25 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 14 states have call predecessors, (36), 12 states have call successors, (36) [2022-04-27 12:16:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:16:21,739 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-27 12:16:21,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 12:16:21,739 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 14 states have call predecessors, (36), 12 states have call successors, (36) Word has length 134 [2022-04-27 12:16:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:16:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 14 states have call predecessors, (36), 12 states have call successors, (36) [2022-04-27 12:16:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 50 transitions. [2022-04-27 12:16:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 14 states have call predecessors, (36), 12 states have call successors, (36) [2022-04-27 12:16:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 50 transitions. [2022-04-27 12:16:21,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 50 transitions. [2022-04-27 12:16:21,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:16:21,826 INFO L225 Difference]: With dead ends: 115 [2022-04-27 12:16:21,826 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 12:16:21,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 12:16:21,827 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:16:21,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 122 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 250 Invalid, 0 Unknown, 9 Unchecked, 9.8s Time] [2022-04-27 12:16:21,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 12:16:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 12:16:21,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:16:21,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:16:21,828 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:16:21,828 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:16:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:16:21,828 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:16:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:16:21,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:16:21,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:16:21,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:16:21,828 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:16:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:16:21,829 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:16:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:16:21,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:16:21,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:16:21,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:16:21,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:16:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:16:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 12:16:21,829 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2022-04-27 12:16:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:16:21,829 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 12:16:21,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 14 states have call predecessors, (36), 12 states have call successors, (36) [2022-04-27 12:16:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:16:21,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:16:21,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:16:21,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 12:16:22,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 12:16:22,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 12:16:25,345 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-27 12:16:25,345 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-27 12:16:25,345 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-27 12:16:25,345 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-27 12:16:25,345 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 12:16:25,345 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-27 12:16:25,345 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-27 12:16:25,345 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (or (not (= (select |#valid| 0) 0)) (let ((.cse0 (* main_~y~0 12))) (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ .cse0 (* main_~z~0 6))) (= (+ (* main_~x~0 18) .cse0 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0)))) [2022-04-27 12:16:25,345 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (not (= (select |#valid| 0) 0)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 100) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) .cse0 (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (<= .cse1 (+ main_~a~0 1)))))) [2022-04-27 12:16:25,345 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 22 56) no Hoare annotation was computed. [2022-04-27 12:16:25,345 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (or (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (not (= (select |#valid| 0) 0))) [2022-04-27 12:16:25,346 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (or (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (not (= (select |#valid| 0) 0))) [2022-04-27 12:16:25,346 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (not (= (select |#valid| 0) 0)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 100) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) .cse0 (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (<= .cse1 (+ main_~a~0 1)))))) [2022-04-27 12:16:25,346 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 22 56) no Hoare annotation was computed. [2022-04-27 12:16:25,346 INFO L899 garLoopResultBuilder]: For program point L38(lines 33 46) no Hoare annotation was computed. [2022-04-27 12:16:25,346 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (or (not (= (select |#valid| 0) 0)) (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))) [2022-04-27 12:16:25,346 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (or (not (= (select |#valid| 0) 0)) (let ((.cse0 (* main_~y~0 12))) (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ .cse0 (* main_~z~0 6))) (= (+ (* main_~x~0 18) .cse0 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0)))) [2022-04-27 12:16:25,346 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (or (not (= (select |#valid| 0) 0)) (let ((.cse0 (* main_~y~0 12))) (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ .cse0 (* main_~z~0 6))) (= (+ (* main_~x~0 18) .cse0 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0)))) [2022-04-27 12:16:25,346 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 56) the Hoare annotation is: true [2022-04-27 12:16:25,346 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (* (- 1) main_~a~0))) (or (not (= (select |#valid| 0) 0)) (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ .cse0 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) .cse0) 65536) 1)) (< main_~a~0 0)))) [2022-04-27 12:16:25,346 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-04-27 12:16:25,346 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-04-27 12:16:25,346 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (or (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (not (= (select |#valid| 0) 0))) [2022-04-27 12:16:25,346 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (or (and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* main_~n~0 6) 6) main_~z~0) (= main_~z~0 6)) (not (= (select |#valid| 0) 0)) (let ((.cse0 (* main_~n~0 main_~n~0)) (.cse1 (* main_~n~0 main_~n~0 main_~n~0)) (.cse2 (div (+ main_~z~0 (- 6)) 6))) (and (= (+ (* 3 .cse0) .cse1 (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0)) (= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) .cse1 (* 6 .cse0) 8)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= .cse2 (+ main_~a~0 1)) (= .cse1 main_~x~0) (< main_~a~0 .cse2)))) [2022-04-27 12:16:25,346 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (or (not (= (select |#valid| 0) 0)) (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))) [2022-04-27 12:16:25,346 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (or (not (= (select |#valid| 0) 0)) (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))) [2022-04-27 12:16:25,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:16:25,347 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 12:16:25,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:16:25,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:16:25,347 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= (select |#valid| 0) 0) [2022-04-27 12:16:25,347 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 12:16:25,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:16:25,347 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-27 12:16:25,347 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-27 12:16:25,347 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-27 12:16:25,347 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-27 12:16:25,347 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-27 12:16:25,347 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 12:16:25,349 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1] [2022-04-27 12:16:25,350 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:16:25,368 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:16:25,368 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:16:25,384 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:16:25,385 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:16:25,385 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 12:16:25,385 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:16:25,385 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:16:25,385 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:16:25,385 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:16:25,385 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-27 12:16:25,385 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:16:25,386 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:16:25,386 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:16:25,386 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:16:25,386 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 12:16:25,386 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-27 12:16:25,386 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:16:25,386 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:16:25,386 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 12:16:25,386 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:16:25,389 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:16:25,390 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 12:16:25,390 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 12:16:25,390 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:16:25,390 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:16:25,390 INFO L163 areAnnotationChecker]: CFG has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:16:25,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:16:25 BoogieIcfgContainer [2022-04-27 12:16:25,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:16:25,405 INFO L158 Benchmark]: Toolchain (without parser) took 180753.27ms. Allocated memory was 238.0MB in the beginning and 287.3MB in the end (delta: 49.3MB). Free memory was 182.8MB in the beginning and 127.1MB in the end (delta: 55.7MB). Peak memory consumption was 142.6MB. Max. memory is 8.0GB. [2022-04-27 12:16:25,406 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 238.0MB. Free memory is still 199.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:16:25,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.77ms. Allocated memory is still 238.0MB. Free memory was 182.5MB in the beginning and 211.7MB in the end (delta: -29.1MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-04-27 12:16:25,406 INFO L158 Benchmark]: Boogie Preprocessor took 79.80ms. Allocated memory is still 238.0MB. Free memory was 211.7MB in the beginning and 210.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 12:16:25,406 INFO L158 Benchmark]: RCFGBuilder took 427.48ms. Allocated memory is still 238.0MB. Free memory was 210.1MB in the beginning and 198.3MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 12:16:25,407 INFO L158 Benchmark]: TraceAbstraction took 179878.66ms. Allocated memory was 238.0MB in the beginning and 287.3MB in the end (delta: 49.3MB). Free memory was 197.8MB in the beginning and 127.1MB in the end (delta: 70.7MB). Peak memory consumption was 157.6MB. Max. memory is 8.0GB. [2022-04-27 12:16:25,409 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.35ms. Allocated memory is still 238.0MB. Free memory is still 199.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 357.77ms. Allocated memory is still 238.0MB. Free memory was 182.5MB in the beginning and 211.7MB in the end (delta: -29.1MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 79.80ms. Allocated memory is still 238.0MB. Free memory was 211.7MB in the beginning and 210.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 427.48ms. Allocated memory is still 238.0MB. Free memory was 210.1MB in the beginning and 198.3MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 179878.66ms. Allocated memory was 238.0MB in the beginning and 287.3MB in the end (delta: 49.3MB). Free memory was 197.8MB in the beginning and 127.1MB in the end (delta: 70.7MB). Peak memory consumption was 157.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 179.8s, OverallIterations: 15, TraceHistogramMax: 23, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 58.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 19.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 2038 SdHoareTripleChecker+Invalid, 19.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9 IncrementalHoareTripleChecker+Unchecked, 1436 mSDsCounter, 411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2309 IncrementalHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 411 mSolverCounterUnsat, 602 mSDtfsCounter, 2309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1547 GetRequests, 1374 SyntacticMatches, 11 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 30.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=12, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 54 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 70 PreInvPairs, 115 NumberOfFragments, 769 HoareAnnotationTreeSize, 70 FomulaSimplifications, 2200 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 19 FomulaSimplificationsInter, 29172 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 110.4s InterpolantComputationTime, 985 NumberOfCodeBlocks, 796 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1342 ConstructedInterpolants, 6 QuantifiedInterpolants, 5717 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1921 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 5618/5874 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: !(\valid[0] == 0) || (((((n <= a + 1 && a <= 100) && z * z + 12 == y * 12 + z * 6) && x * 18 + y * 12 + 6 == z * 2 + z * y) && n * 6 + 6 == z) && 0 <= a) RESULT: Ultimate proved your program to be correct! [2022-04-27 12:16:25,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...