/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/ps4-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:35:10,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:35:10,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:35:10,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:35:10,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:35:10,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:35:10,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:35:10,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:35:10,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:35:10,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:35:10,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:35:10,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:35:10,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:35:10,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:35:10,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:35:10,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:35:10,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:35:10,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:35:10,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:35:10,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:35:10,985 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:35:10,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:35:10,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:35:10,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:35:10,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:35:10,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:35:10,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:35:10,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:35:10,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:35:10,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:35:10,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:35:10,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:35:10,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:35:10,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:35:10,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:35:10,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:35:10,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:35:10,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:35:10,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:35:10,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:35:10,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:35:10,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:35:10,999 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 14:35:11,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:35:11,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:35:11,017 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:35:11,017 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:35:11,018 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:35:11,018 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:35:11,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:35:11,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:35:11,018 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:35:11,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:35:11,019 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:35:11,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:35:11,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:35:11,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:35:11,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:35:11,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:35:11,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:35:11,020 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:35:11,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:35:11,020 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:35:11,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:35:11,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:35:11,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:35:11,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:35:11,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:35:11,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:35:11,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:35:11,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:35:11,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:35:11,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:35:11,021 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:35:11,021 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:35:11,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:35:11,022 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 14:35:11,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:35:11,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:35:11,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:35:11,217 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:35:11,217 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:35:11,218 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound50.c [2022-04-27 14:35:11,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094ab0f4e/b96e741dee2f4629a360936c6cbb8b11/FLAG7ca2f8aaf [2022-04-27 14:35:11,593 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:35:11,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound50.c [2022-04-27 14:35:11,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094ab0f4e/b96e741dee2f4629a360936c6cbb8b11/FLAG7ca2f8aaf [2022-04-27 14:35:12,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094ab0f4e/b96e741dee2f4629a360936c6cbb8b11 [2022-04-27 14:35:12,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:35:12,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:35:12,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:35:12,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:35:12,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:35:12,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:35:12" (1/1) ... [2022-04-27 14:35:12,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142f1c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:12, skipping insertion in model container [2022-04-27 14:35:12,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:35:12" (1/1) ... [2022-04-27 14:35:12,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:35:12,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:35:12,175 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/ps4-ll_unwindbound50.c[458,471] [2022-04-27 14:35:12,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:35:12,198 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:35:12,208 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/ps4-ll_unwindbound50.c[458,471] [2022-04-27 14:35:12,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:35:12,224 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:35:12,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:12 WrapperNode [2022-04-27 14:35:12,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:35:12,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:35:12,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:35:12,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:35:12,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:12" (1/1) ... [2022-04-27 14:35:12,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:12" (1/1) ... [2022-04-27 14:35:12,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:12" (1/1) ... [2022-04-27 14:35:12,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:12" (1/1) ... [2022-04-27 14:35:12,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:12" (1/1) ... [2022-04-27 14:35:12,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:12" (1/1) ... [2022-04-27 14:35:12,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:12" (1/1) ... [2022-04-27 14:35:12,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:35:12,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:35:12,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:35:12,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:35:12,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:12" (1/1) ... [2022-04-27 14:35:12,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:35:12,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:12,274 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 14:35:12,276 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 14:35:12,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:35:12,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:35:12,314 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:35:12,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:35:12,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:35:12,317 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:35:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:35:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:35:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:35:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:35:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:35:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:35:12,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:35:12,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:35:12,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:35:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:35:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:35:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:35:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:35:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:35:12,374 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:35:12,375 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:35:12,552 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:35:12,557 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:35:12,557 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:35:12,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:35:12 BoogieIcfgContainer [2022-04-27 14:35:12,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:35:12,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:35:12,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:35:12,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:35:12,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:35:12" (1/3) ... [2022-04-27 14:35:12,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc0798f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:35:12, skipping insertion in model container [2022-04-27 14:35:12,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:35:12" (2/3) ... [2022-04-27 14:35:12,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc0798f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:35:12, skipping insertion in model container [2022-04-27 14:35:12,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:35:12" (3/3) ... [2022-04-27 14:35:12,567 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound50.c [2022-04-27 14:35:12,579 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:35:12,579 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:35:12,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:35:12,623 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@1dea3d4c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a0371a9 [2022-04-27 14:35:12,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:35:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 14:35:12,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:12,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:12,636 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times [2022-04-27 14:35:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:12,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780965598] [2022-04-27 14:35:12,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:12,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:35:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:12,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-27 14:35:12,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 14:35:12,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-27 14:35:12,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:35:12,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-27 14:35:12,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 14:35:12,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-27 14:35:12,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-27 14:35:12,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {26#true} is VALID [2022-04-27 14:35:12,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-27 14:35:12,797 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27#false} is VALID [2022-04-27 14:35:12,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-27 14:35:12,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-27 14:35:12,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-27 14:35:12,798 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 14:35:12,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:12,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780965598] [2022-04-27 14:35:12,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780965598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:35:12,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:35:12,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:35:12,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406936151] [2022-04-27 14:35:12,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:35:12,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:35:12,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:12,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:12,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:12,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:35:12,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:12,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:35:12,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:35:12,875 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:13,037 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-27 14:35:13,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:35:13,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:35:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 14:35:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 14:35:13,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-27 14:35:13,135 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 14:35:13,145 INFO L225 Difference]: With dead ends: 41 [2022-04-27 14:35:13,146 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 14:35:13,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:35:13,153 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:13,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:35:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 14:35:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-27 14:35:13,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:13,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:13,178 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:13,178 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:13,185 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 14:35:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 14:35:13,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:13,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:13,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 14:35:13,187 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 14:35:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:13,190 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 14:35:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 14:35:13,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:13,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:13,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:13,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-27 14:35:13,194 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-27 14:35:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:13,194 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-27 14:35:13,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 14:35:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:35:13,195 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:13,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:13,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:35:13,196 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:13,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:13,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times [2022-04-27 14:35:13,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:13,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598346177] [2022-04-27 14:35:13,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:13,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:13,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:13,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942961672] [2022-04-27 14:35:13,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:13,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:13,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:13,223 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 14:35:13,254 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 14:35:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:13,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:35:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:13,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:13,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {155#true} is VALID [2022-04-27 14:35:13,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:13,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(<= ~counter~0 0)} assume true; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:13,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#(<= ~counter~0 0)} {155#true} #57#return; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:13,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#(<= ~counter~0 0)} call #t~ret6 := main(); {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:13,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:13,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {179#(<= |main_#t~post5| 0)} is VALID [2022-04-27 14:35:13,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(<= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {156#false} is VALID [2022-04-27 14:35:13,435 INFO L272 TraceCheckUtils]: 8: Hoare triple {156#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {156#false} is VALID [2022-04-27 14:35:13,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#false} ~cond := #in~cond; {156#false} is VALID [2022-04-27 14:35:13,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {156#false} assume 0 == ~cond; {156#false} is VALID [2022-04-27 14:35:13,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#false} assume !false; {156#false} is VALID [2022-04-27 14:35:13,436 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 14:35:13,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:35:13,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:13,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598346177] [2022-04-27 14:35:13,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:13,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942961672] [2022-04-27 14:35:13,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942961672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:35:13,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:35:13,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:35:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858194485] [2022-04-27 14:35:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:35:13,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:35:13,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:13,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:13,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:13,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:35:13,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:13,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:35:13,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:35:13,456 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:13,509 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 14:35:13,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:35:13,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:35:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 14:35:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 14:35:13,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-27 14:35:13,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:13,541 INFO L225 Difference]: With dead ends: 28 [2022-04-27 14:35:13,541 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 14:35:13,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:35:13,542 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:13,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:35:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 14:35:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 14:35:13,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:13,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:13,548 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:13,549 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:13,551 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 14:35:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:35:13,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:13,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:13,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 14:35:13,552 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 14:35:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:13,553 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 14:35:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:35:13,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:13,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:13,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:13,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 14:35:13,556 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-27 14:35:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:13,556 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 14:35:13,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:35:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:35:13,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:13,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:13,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:35:13,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:13,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:13,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:13,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times [2022-04-27 14:35:13,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:13,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036358066] [2022-04-27 14:35:13,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:13,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:13,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:13,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613224537] [2022-04-27 14:35:13,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:13,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:13,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:13,786 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 14:35:13,825 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 14:35:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:13,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:35:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:13,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:13,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {305#true} is VALID [2022-04-27 14:35:13,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {305#true} is VALID [2022-04-27 14:35:13,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 14:35:13,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #57#return; {305#true} is VALID [2022-04-27 14:35:13,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} call #t~ret6 := main(); {305#true} is VALID [2022-04-27 14:35:13,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:13,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:13,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:13,942 INFO L272 TraceCheckUtils]: 8: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:13,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:13,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {306#false} is VALID [2022-04-27 14:35:13,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#false} assume !false; {306#false} is VALID [2022-04-27 14:35:13,946 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 14:35:13,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:35:13,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:13,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036358066] [2022-04-27 14:35:13,946 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:13,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613224537] [2022-04-27 14:35:13,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613224537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:35:13,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:35:13,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:35:13,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340685786] [2022-04-27 14:35:13,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:35:13,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:35:13,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:13,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:13,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:13,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:35:13,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:13,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:35:13,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:35:13,962 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:14,127 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 14:35:14,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:35:14,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:35:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 14:35:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 14:35:14,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-27 14:35:14,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:14,164 INFO L225 Difference]: With dead ends: 30 [2022-04-27 14:35:14,164 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:35:14,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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 14:35:14,166 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:14,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:35:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:35:14,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:35:14,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:14,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:14,173 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:14,173 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:14,175 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:35:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:35:14,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:14,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:14,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:35:14,176 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:35:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:14,178 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:35:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:35:14,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:14,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:14,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:14,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 14:35:14,180 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-27 14:35:14,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:14,180 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 14:35:14,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:35:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:35:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:35:14,181 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:14,181 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:14,206 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 14:35:14,402 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,SelfDestructingSolverStorable2 [2022-04-27 14:35:14,402 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:14,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:14,403 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times [2022-04-27 14:35:14,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:14,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310704604] [2022-04-27 14:35:14,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:14,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:14,415 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:14,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1110593492] [2022-04-27 14:35:14,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:14,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:14,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:14,417 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 14:35:14,440 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 14:35:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:14,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:35:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:14,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:14,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-27 14:35:14,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:14,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(<= ~counter~0 0)} assume true; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:14,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#(<= ~counter~0 0)} {481#true} #57#return; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:14,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#(<= ~counter~0 0)} call #t~ret6 := main(); {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:14,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:14,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:14,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:14,647 INFO L272 TraceCheckUtils]: 8: Hoare triple {505#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:14,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(<= ~counter~0 1)} ~cond := #in~cond; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:14,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= ~counter~0 1)} assume !(0 == ~cond); {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:14,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#(<= ~counter~0 1)} assume true; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:14,653 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {505#(<= ~counter~0 1)} {505#(<= ~counter~0 1)} #51#return; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:14,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:14,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {530#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:35:14,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {482#false} is VALID [2022-04-27 14:35:14,657 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {482#false} is VALID [2022-04-27 14:35:14,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-27 14:35:14,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-27 14:35:14,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-27 14:35:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:35:14,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:14,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-27 14:35:14,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-27 14:35:14,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-27 14:35:14,798 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {482#false} is VALID [2022-04-27 14:35:14,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {558#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {482#false} is VALID [2022-04-27 14:35:14,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {558#(< |main_#t~post5| 50)} is VALID [2022-04-27 14:35:14,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(< ~counter~0 50)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {562#(< ~counter~0 50)} is VALID [2022-04-27 14:35:14,799 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {481#true} {562#(< ~counter~0 50)} #51#return; {562#(< ~counter~0 50)} is VALID [2022-04-27 14:35:14,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-27 14:35:14,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#true} assume !(0 == ~cond); {481#true} is VALID [2022-04-27 14:35:14,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#true} ~cond := #in~cond; {481#true} is VALID [2022-04-27 14:35:14,800 INFO L272 TraceCheckUtils]: 8: Hoare triple {562#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {481#true} is VALID [2022-04-27 14:35:14,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {562#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {562#(< ~counter~0 50)} is VALID [2022-04-27 14:35:14,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {587#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {562#(< ~counter~0 50)} is VALID [2022-04-27 14:35:14,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#(< ~counter~0 49)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {587#(< ~counter~0 49)} is VALID [2022-04-27 14:35:14,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#(< ~counter~0 49)} call #t~ret6 := main(); {587#(< ~counter~0 49)} is VALID [2022-04-27 14:35:14,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#(< ~counter~0 49)} {481#true} #57#return; {587#(< ~counter~0 49)} is VALID [2022-04-27 14:35:14,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#(< ~counter~0 49)} assume true; {587#(< ~counter~0 49)} is VALID [2022-04-27 14:35:14,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {587#(< ~counter~0 49)} is VALID [2022-04-27 14:35:14,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-27 14:35:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:35:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:14,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310704604] [2022-04-27 14:35:14,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:14,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110593492] [2022-04-27 14:35:14,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110593492] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:35:14,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:35:14,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:35:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701528188] [2022-04-27 14:35:14,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:14,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 14:35:14,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:14,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:35:14,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:14,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:35:14,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:14,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:35:14,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:35:14,834 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:35:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:15,014 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-27 14:35:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:35:15,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 14:35:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:35:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-27 14:35:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:35:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-27 14:35:15,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 70 transitions. [2022-04-27 14:35:15,076 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 14:35:15,080 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:35:15,080 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:35:15,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:35:15,083 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:15,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:35:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:35:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-27 14:35:15,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:15,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:15,109 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:15,109 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:15,120 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:35:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:35:15,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:15,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:15,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-27 14:35:15,124 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-27 14:35:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:15,126 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:35:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:35:15,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:15,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:15,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:15,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-27 14:35:15,129 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 20 [2022-04-27 14:35:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:15,129 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-27 14:35:15,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:35:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-27 14:35:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:35:15,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:15,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:15,153 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 14:35:15,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:15,331 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times [2022-04-27 14:35:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:15,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708116142] [2022-04-27 14:35:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:15,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:15,344 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:15,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545983659] [2022-04-27 14:35:15,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:15,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:15,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:15,345 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 14:35:15,359 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 14:35:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:15,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:35:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:15,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:15,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {875#true} call ULTIMATE.init(); {875#true} is VALID [2022-04-27 14:35:15,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {875#true} is VALID [2022-04-27 14:35:15,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:35:15,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} #57#return; {875#true} is VALID [2022-04-27 14:35:15,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} call #t~ret6 := main(); {875#true} is VALID [2022-04-27 14:35:15,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:15,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:15,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:15,524 INFO L272 TraceCheckUtils]: 8: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {875#true} is VALID [2022-04-27 14:35:15,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#true} ~cond := #in~cond; {875#true} is VALID [2022-04-27 14:35:15,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {875#true} assume !(0 == ~cond); {875#true} is VALID [2022-04-27 14:35:15,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:35:15,525 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {875#true} {895#(and (= main_~x~0 0) (= main_~y~0 0))} #51#return; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:15,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:35:15,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:35:15,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:35:15,527 INFO L272 TraceCheckUtils]: 16: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:15,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:15,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {876#false} is VALID [2022-04-27 14:35:15,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#false} assume !false; {876#false} is VALID [2022-04-27 14:35:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:35:15,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:15,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#false} assume !false; {876#false} is VALID [2022-04-27 14:35:15,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {876#false} is VALID [2022-04-27 14:35:15,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:15,673 INFO L272 TraceCheckUtils]: 16: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:15,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:15,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:15,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:15,932 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {875#true} {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #51#return; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:15,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:35:15,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {875#true} assume !(0 == ~cond); {875#true} is VALID [2022-04-27 14:35:15,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#true} ~cond := #in~cond; {875#true} is VALID [2022-04-27 14:35:15,933 INFO L272 TraceCheckUtils]: 8: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {875#true} is VALID [2022-04-27 14:35:15,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:15,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:15,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:35:15,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} call #t~ret6 := main(); {875#true} is VALID [2022-04-27 14:35:15,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} #57#return; {875#true} is VALID [2022-04-27 14:35:15,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:35:15,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {875#true} is VALID [2022-04-27 14:35:15,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {875#true} call ULTIMATE.init(); {875#true} is VALID [2022-04-27 14:35:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 14:35:15,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:15,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708116142] [2022-04-27 14:35:15,937 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:15,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545983659] [2022-04-27 14:35:15,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545983659] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:15,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:15,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:35:15,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658939400] [2022-04-27 14:35:15,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:35:15,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 14:35:15,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:15,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:35:16,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:16,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:35:16,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:16,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:35:16,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:35:16,449 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:35:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:16,548 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-27 14:35:16,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:35:16,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 14:35:16,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:35:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 14:35:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:35:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 14:35:16,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-27 14:35:17,025 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 14:35:17,027 INFO L225 Difference]: With dead ends: 62 [2022-04-27 14:35:17,027 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 14:35:17,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:35:17,028 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:17,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:35:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 14:35:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-04-27 14:35:17,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:17,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:17,047 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:17,048 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:17,049 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-27 14:35:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-27 14:35:17,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:17,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:17,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 14:35:17,051 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 14:35:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:17,052 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-27 14:35:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-27 14:35:17,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:17,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:17,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:17,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-04-27 14:35:17,055 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2022-04-27 14:35:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:17,055 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-04-27 14:35:17,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:35:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-27 14:35:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:35:17,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:17,056 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:17,083 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 14:35:17,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:17,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:17,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times [2022-04-27 14:35:17,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:17,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782001279] [2022-04-27 14:35:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:17,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:17,289 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:17,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579324654] [2022-04-27 14:35:17,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:17,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:17,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:17,291 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 14:35:17,303 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 14:35:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:17,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 14:35:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:17,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:17,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1257#true} is VALID [2022-04-27 14:35:17,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1257#true} is VALID [2022-04-27 14:35:17,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-27 14:35:17,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} #57#return; {1257#true} is VALID [2022-04-27 14:35:17,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} call #t~ret6 := main(); {1257#true} is VALID [2022-04-27 14:35:17,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:17,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:17,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:17,744 INFO L272 TraceCheckUtils]: 8: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1257#true} is VALID [2022-04-27 14:35:17,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {1257#true} ~cond := #in~cond; {1257#true} is VALID [2022-04-27 14:35:17,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {1257#true} assume !(0 == ~cond); {1257#true} is VALID [2022-04-27 14:35:17,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-27 14:35:17,745 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1257#true} {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:17,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:35:17,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:35:17,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:35:17,747 INFO L272 TraceCheckUtils]: 16: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1257#true} is VALID [2022-04-27 14:35:17,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {1257#true} ~cond := #in~cond; {1315#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:17,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {1315#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:35:17,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:35:17,749 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} #51#return; {1326#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:35:17,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {1326#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1330#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:17,750 INFO L272 TraceCheckUtils]: 22: Hoare triple {1330#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1334#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:17,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {1334#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1338#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:17,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {1338#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1258#false} is VALID [2022-04-27 14:35:17,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2022-04-27 14:35:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 14:35:17,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:47,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:47,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782001279] [2022-04-27 14:35:47,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:47,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579324654] [2022-04-27 14:35:47,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579324654] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:47,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:47,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:35:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690306421] [2022-04-27 14:35:47,901 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:47,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 14:35:47,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:47,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:47,925 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 14:35:47,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:35:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:47,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:35:47,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:35:47,926 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:48,245 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-27 14:35:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:35:48,246 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 14:35:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 14:35:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 14:35:48,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-27 14:35:48,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:48,281 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:35:48,281 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:35:48,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:35:48,282 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:48,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:48,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:35:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:35:48,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:48,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:48,304 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:48,304 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:48,305 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-27 14:35:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:35:48,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:48,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:48,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:35:48,306 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:35:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:48,317 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-27 14:35:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:35:48,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:48,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:48,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:48,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-27 14:35:48,319 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 26 [2022-04-27 14:35:48,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:48,320 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-27 14:35:48,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:35:48,320 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:35:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:35:48,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:48,321 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:48,343 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 14:35:48,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:48,543 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:48,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:48,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 2 times [2022-04-27 14:35:48,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:48,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470965458] [2022-04-27 14:35:48,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:48,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:48,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:48,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2091993793] [2022-04-27 14:35:48,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:35:48,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:48,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:48,570 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 14:35:48,581 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 14:35:48,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:35:48,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:48,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:35:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:48,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:48,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-27 14:35:48,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1622#true} is VALID [2022-04-27 14:35:48,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:35:48,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1622#true} {1622#true} #57#return; {1622#true} is VALID [2022-04-27 14:35:48,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {1622#true} call #t~ret6 := main(); {1622#true} is VALID [2022-04-27 14:35:48,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {1622#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:48,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:48,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:48,960 INFO L272 TraceCheckUtils]: 8: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1622#true} is VALID [2022-04-27 14:35:48,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:35:48,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:35:48,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:35:48,961 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1622#true} {1642#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:48,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:48,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:48,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:48,962 INFO L272 TraceCheckUtils]: 16: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1622#true} is VALID [2022-04-27 14:35:48,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:35:48,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:35:48,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:35:48,963 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1622#true} {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:48,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:35:48,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:35:48,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !!(#t~post5 < 50);havoc #t~post5; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:35:48,964 INFO L272 TraceCheckUtils]: 24: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1622#true} is VALID [2022-04-27 14:35:48,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:35:48,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:35:48,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:35:48,965 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1622#true} {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #51#return; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:35:48,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1717#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:35:48,967 INFO L272 TraceCheckUtils]: 30: Hoare triple {1717#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1721#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:48,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {1721#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1725#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:48,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {1725#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1623#false} is VALID [2022-04-27 14:35:48,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-27 14:35:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:35:48,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:49,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:49,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470965458] [2022-04-27 14:35:49,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:49,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091993793] [2022-04-27 14:35:49,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091993793] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:49,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:49,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:35:49,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318065817] [2022-04-27 14:35:49,285 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:49,286 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-27 14:35:49,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:49,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:49,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:49,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:35:49,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:49,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:35:49,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:35:49,308 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:49,559 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-27 14:35:49,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:35:49,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-27 14:35:49,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 14:35:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 14:35:49,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-27 14:35:49,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:49,594 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:35:49,594 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:35:49,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 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 14:35:49,594 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:49,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:35:49,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:35:49,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:49,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:49,616 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:49,616 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:49,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:49,617 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-27 14:35:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:35:49,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:49,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:49,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:35:49,618 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:35:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:49,619 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-27 14:35:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:35:49,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:49,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:49,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:49,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-27 14:35:49,621 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 34 [2022-04-27 14:35:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:49,622 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-27 14:35:49,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:35:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:35:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 14:35:49,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:49,623 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:49,647 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 14:35:49,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:49,845 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 3 times [2022-04-27 14:35:49,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:49,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245851205] [2022-04-27 14:35:49,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:49,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:49,862 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:49,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927796625] [2022-04-27 14:35:49,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:35:49,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:49,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:49,863 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 14:35:49,889 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 14:35:49,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:35:49,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:49,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:35:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:49,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:50,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {2005#true} call ULTIMATE.init(); {2005#true} is VALID [2022-04-27 14:35:50,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2005#true} is VALID [2022-04-27 14:35:50,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:50,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2005#true} {2005#true} #57#return; {2005#true} is VALID [2022-04-27 14:35:50,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {2005#true} call #t~ret6 := main(); {2005#true} is VALID [2022-04-27 14:35:50,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {2005#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:50,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:50,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:50,332 INFO L272 TraceCheckUtils]: 8: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:35:50,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:35:50,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:35:50,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:50,333 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2005#true} {2025#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:50,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:50,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:50,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:50,334 INFO L272 TraceCheckUtils]: 16: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:35:50,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:35:50,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:35:50,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:50,335 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2005#true} {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:50,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:50,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:50,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:50,340 INFO L272 TraceCheckUtils]: 24: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:35:50,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:35:50,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:35:50,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:50,340 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2005#true} {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #51#return; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:50,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:50,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:50,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:50,342 INFO L272 TraceCheckUtils]: 32: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:35:50,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:35:50,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:35:50,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:35:50,343 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2005#true} {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #51#return; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:50,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2125#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:35:50,344 INFO L272 TraceCheckUtils]: 38: Hoare triple {2125#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:50,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:50,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {2133#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2006#false} is VALID [2022-04-27 14:35:50,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {2006#false} assume !false; {2006#false} is VALID [2022-04-27 14:35:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:35:50,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:50,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:50,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245851205] [2022-04-27 14:35:50,654 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:50,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927796625] [2022-04-27 14:35:50,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927796625] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:50,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:50,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:35:50,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844858292] [2022-04-27 14:35:50,655 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:50,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-27 14:35:50,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:50,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:50,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:50,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:35:50,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:50,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:35:50,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:35:50,684 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:50,999 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:35:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:35:50,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-27 14:35:51,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:35:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:35:51,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-27 14:35:51,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:51,052 INFO L225 Difference]: With dead ends: 52 [2022-04-27 14:35:51,052 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 14:35:51,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:35:51,053 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:51,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 14:35:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 14:35:51,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:51,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:51,093 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:51,093 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:51,095 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-27 14:35:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:35:51,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:51,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:51,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-27 14:35:51,096 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-27 14:35:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:51,097 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-27 14:35:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:35:51,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:51,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:51,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:51,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-27 14:35:51,100 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-27 14:35:51,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:51,100 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-27 14:35:51,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:35:51,100 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:35:51,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 14:35:51,101 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:51,101 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:51,124 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 14:35:51,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:51,302 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:51,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 2 times [2022-04-27 14:35:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:51,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700201031] [2022-04-27 14:35:51,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:51,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:51,314 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:51,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1804423856] [2022-04-27 14:35:51,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:35:51,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:51,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:51,318 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 14:35:51,319 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 14:35:51,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:35:51,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:51,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:35:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:51,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:51,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2423#true} is VALID [2022-04-27 14:35:51,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:51,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {2431#(<= ~counter~0 0)} assume true; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:51,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2431#(<= ~counter~0 0)} {2423#true} #57#return; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:51,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {2431#(<= ~counter~0 0)} call #t~ret6 := main(); {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:51,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {2431#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:35:51,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {2431#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:51,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:51,617 INFO L272 TraceCheckUtils]: 8: Hoare triple {2447#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:51,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {2447#(<= ~counter~0 1)} ~cond := #in~cond; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:51,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {2447#(<= ~counter~0 1)} assume !(0 == ~cond); {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:51,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {2447#(<= ~counter~0 1)} assume true; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:51,619 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2447#(<= ~counter~0 1)} {2447#(<= ~counter~0 1)} #51#return; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:51,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {2447#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:35:51,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {2447#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:51,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:51,620 INFO L272 TraceCheckUtils]: 16: Hoare triple {2472#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:51,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {2472#(<= ~counter~0 2)} ~cond := #in~cond; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:51,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#(<= ~counter~0 2)} assume !(0 == ~cond); {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:51,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {2472#(<= ~counter~0 2)} assume true; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:51,632 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2472#(<= ~counter~0 2)} {2472#(<= ~counter~0 2)} #51#return; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:51,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:35:51,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {2472#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:51,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {2497#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:51,634 INFO L272 TraceCheckUtils]: 24: Hoare triple {2497#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:51,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {2497#(<= ~counter~0 3)} ~cond := #in~cond; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:51,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {2497#(<= ~counter~0 3)} assume !(0 == ~cond); {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:51,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {2497#(<= ~counter~0 3)} assume true; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:51,635 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2497#(<= ~counter~0 3)} {2497#(<= ~counter~0 3)} #51#return; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:51,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {2497#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:35:51,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {2497#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:51,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {2522#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:51,637 INFO L272 TraceCheckUtils]: 32: Hoare triple {2522#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:51,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {2522#(<= ~counter~0 4)} ~cond := #in~cond; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:51,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {2522#(<= ~counter~0 4)} assume !(0 == ~cond); {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:51,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {2522#(<= ~counter~0 4)} assume true; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:51,638 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2522#(<= ~counter~0 4)} {2522#(<= ~counter~0 4)} #51#return; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:51,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {2522#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:35:51,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {2522#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2547#(<= |main_#t~post5| 4)} is VALID [2022-04-27 14:35:51,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {2547#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {2424#false} is VALID [2022-04-27 14:35:51,639 INFO L272 TraceCheckUtils]: 40: Hoare triple {2424#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2424#false} is VALID [2022-04-27 14:35:51,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {2424#false} ~cond := #in~cond; {2424#false} is VALID [2022-04-27 14:35:51,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#false} assume 0 == ~cond; {2424#false} is VALID [2022-04-27 14:35:51,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2022-04-27 14:35:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:35:51,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:51,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2022-04-27 14:35:51,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#false} assume 0 == ~cond; {2424#false} is VALID [2022-04-27 14:35:51,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {2424#false} ~cond := #in~cond; {2424#false} is VALID [2022-04-27 14:35:51,921 INFO L272 TraceCheckUtils]: 40: Hoare triple {2424#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2424#false} is VALID [2022-04-27 14:35:51,922 INFO L290 TraceCheckUtils]: 39: Hoare triple {2575#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {2424#false} is VALID [2022-04-27 14:35:51,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {2579#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2575#(< |main_#t~post5| 50)} is VALID [2022-04-27 14:35:51,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {2579#(< ~counter~0 50)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2579#(< ~counter~0 50)} is VALID [2022-04-27 14:35:51,923 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2423#true} {2579#(< ~counter~0 50)} #51#return; {2579#(< ~counter~0 50)} is VALID [2022-04-27 14:35:51,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:35:51,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:35:51,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:35:51,924 INFO L272 TraceCheckUtils]: 32: Hoare triple {2579#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:35:51,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {2579#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {2579#(< ~counter~0 50)} is VALID [2022-04-27 14:35:51,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {2604#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2579#(< ~counter~0 50)} is VALID [2022-04-27 14:35:51,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {2604#(< ~counter~0 49)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2604#(< ~counter~0 49)} is VALID [2022-04-27 14:35:51,926 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2423#true} {2604#(< ~counter~0 49)} #51#return; {2604#(< ~counter~0 49)} is VALID [2022-04-27 14:35:51,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:35:51,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:35:51,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:35:51,927 INFO L272 TraceCheckUtils]: 24: Hoare triple {2604#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:35:51,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {2604#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {2604#(< ~counter~0 49)} is VALID [2022-04-27 14:35:51,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {2629#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2604#(< ~counter~0 49)} is VALID [2022-04-27 14:35:51,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {2629#(< ~counter~0 48)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2629#(< ~counter~0 48)} is VALID [2022-04-27 14:35:51,929 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2423#true} {2629#(< ~counter~0 48)} #51#return; {2629#(< ~counter~0 48)} is VALID [2022-04-27 14:35:51,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:35:51,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:35:51,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:35:51,929 INFO L272 TraceCheckUtils]: 16: Hoare triple {2629#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:35:51,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {2629#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {2629#(< ~counter~0 48)} is VALID [2022-04-27 14:35:51,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {2654#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2629#(< ~counter~0 48)} is VALID [2022-04-27 14:35:51,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {2654#(< ~counter~0 47)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2654#(< ~counter~0 47)} is VALID [2022-04-27 14:35:51,931 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2423#true} {2654#(< ~counter~0 47)} #51#return; {2654#(< ~counter~0 47)} is VALID [2022-04-27 14:35:51,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:35:51,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:35:51,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:35:51,932 INFO L272 TraceCheckUtils]: 8: Hoare triple {2654#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:35:51,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {2654#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {2654#(< ~counter~0 47)} is VALID [2022-04-27 14:35:51,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {2679#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2654#(< ~counter~0 47)} is VALID [2022-04-27 14:35:51,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {2679#(< ~counter~0 46)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2679#(< ~counter~0 46)} is VALID [2022-04-27 14:35:51,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {2679#(< ~counter~0 46)} call #t~ret6 := main(); {2679#(< ~counter~0 46)} is VALID [2022-04-27 14:35:51,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2679#(< ~counter~0 46)} {2423#true} #57#return; {2679#(< ~counter~0 46)} is VALID [2022-04-27 14:35:51,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {2679#(< ~counter~0 46)} assume true; {2679#(< ~counter~0 46)} is VALID [2022-04-27 14:35:51,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2679#(< ~counter~0 46)} is VALID [2022-04-27 14:35:51,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2423#true} is VALID [2022-04-27 14:35:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:35:51,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:51,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700201031] [2022-04-27 14:35:51,936 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:51,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804423856] [2022-04-27 14:35:51,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804423856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:35:51,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:35:51,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 14:35:51,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149682914] [2022-04-27 14:35:51,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:51,937 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2022-04-27 14:35:51,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:51,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:35:51,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:51,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:35:51,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:51,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:35:51,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:35:51,992 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:35:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:52,455 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2022-04-27 14:35:52,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:35:52,456 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2022-04-27 14:35:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:35:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-27 14:35:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:35:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-27 14:35:52,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 123 transitions. [2022-04-27 14:35:52,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:52,568 INFO L225 Difference]: With dead ends: 123 [2022-04-27 14:35:52,568 INFO L226 Difference]: Without dead ends: 118 [2022-04-27 14:35:52,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:35:52,571 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 120 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:52,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 148 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:35:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-27 14:35:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 93. [2022-04-27 14:35:52,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:52,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:52,631 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:52,632 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:52,634 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-27 14:35:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-27 14:35:52,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:52,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:52,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 118 states. [2022-04-27 14:35:52,636 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 118 states. [2022-04-27 14:35:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:52,639 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-27 14:35:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-27 14:35:52,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:52,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:52,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:52,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-04-27 14:35:52,643 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 44 [2022-04-27 14:35:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:52,643 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-04-27 14:35:52,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:35:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-04-27 14:35:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 14:35:52,644 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:52,644 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:52,663 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 14:35:52,855 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,SelfDestructingSolverStorable8 [2022-04-27 14:35:52,855 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:52,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 4 times [2022-04-27 14:35:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:52,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391295317] [2022-04-27 14:35:52,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:52,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:52,866 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:52,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016903155] [2022-04-27 14:35:52,866 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:35:52,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:52,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:52,867 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 14:35:52,883 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 14:35:52,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:35:52,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:52,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:35:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:52,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:53,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {3256#true} call ULTIMATE.init(); {3256#true} is VALID [2022-04-27 14:35:53,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {3256#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3256#true} is VALID [2022-04-27 14:35:53,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:35:53,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3256#true} {3256#true} #57#return; {3256#true} is VALID [2022-04-27 14:35:53,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {3256#true} call #t~ret6 := main(); {3256#true} is VALID [2022-04-27 14:35:53,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {3256#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:53,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:53,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:53,325 INFO L272 TraceCheckUtils]: 8: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:35:53,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:35:53,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:35:53,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:35:53,325 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3256#true} {3276#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:53,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:53,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:53,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:53,327 INFO L272 TraceCheckUtils]: 16: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:35:53,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:35:53,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:35:53,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:35:53,327 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3256#true} {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:35:53,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:35:53,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:35:53,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 50);havoc #t~post5; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:35:53,328 INFO L272 TraceCheckUtils]: 24: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:35:53,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:35:53,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:35:53,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:35:53,329 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3256#true} {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #51#return; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:35:53,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:35:53,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:35:53,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 50);havoc #t~post5; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:35:53,330 INFO L272 TraceCheckUtils]: 32: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:35:53,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:35:53,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:35:53,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:35:53,331 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3256#true} {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #51#return; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:35:53,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:35:53,332 INFO L290 TraceCheckUtils]: 38: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:35:53,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:35:53,332 INFO L272 TraceCheckUtils]: 40: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:35:53,332 INFO L290 TraceCheckUtils]: 41: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:35:53,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:35:53,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:35:53,333 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3256#true} {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #51#return; {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:35:53,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {3401#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:35:53,334 INFO L272 TraceCheckUtils]: 46: Hoare triple {3401#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3405#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:53,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {3405#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3409#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:53,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {3409#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3257#false} is VALID [2022-04-27 14:35:53,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {3257#false} assume !false; {3257#false} is VALID [2022-04-27 14:35:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:35:53,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:53,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:53,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391295317] [2022-04-27 14:35:53,635 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:53,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016903155] [2022-04-27 14:35:53,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016903155] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:53,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:53,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:35:53,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680329396] [2022-04-27 14:35:53,635 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:53,637 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-27 14:35:53,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:53,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:53,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:53,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:35:53,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:53,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:35:53,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:35:53,672 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:54,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:54,144 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-04-27 14:35:54,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:35:54,145 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-27 14:35:54,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-27 14:35:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-27 14:35:54,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-27 14:35:54,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:54,194 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:35:54,194 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:35:54,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:35:54,195 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:54,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:35:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:35:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:35:54,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:54,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:54,246 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:54,246 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:54,255 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-27 14:35:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 14:35:54,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:54,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:54,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:35:54,257 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:35:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:54,260 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-27 14:35:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 14:35:54,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:54,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:54,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:54,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2022-04-27 14:35:54,263 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 50 [2022-04-27 14:35:54,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:54,263 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2022-04-27 14:35:54,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:35:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 14:35:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 14:35:54,264 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:54,264 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:54,295 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 14:35:54,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 14:35:54,479 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 5 times [2022-04-27 14:35:54,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:54,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639690200] [2022-04-27 14:35:54,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:54,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:54,501 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:54,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1318787670] [2022-04-27 14:35:54,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:35:54,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:54,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:54,512 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 14:35:54,514 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 14:35:54,703 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:35:54,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:54,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:35:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:54,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:55,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {3917#true} call ULTIMATE.init(); {3917#true} is VALID [2022-04-27 14:35:55,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {3917#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3917#true} is VALID [2022-04-27 14:35:55,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:55,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3917#true} {3917#true} #57#return; {3917#true} is VALID [2022-04-27 14:35:55,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {3917#true} call #t~ret6 := main(); {3917#true} is VALID [2022-04-27 14:35:55,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {3917#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:55,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:55,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:55,121 INFO L272 TraceCheckUtils]: 8: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:35:55,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:35:55,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:35:55,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:55,123 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3917#true} {3937#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:55,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:55,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:55,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:55,133 INFO L272 TraceCheckUtils]: 16: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:35:55,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:35:55,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:35:55,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:55,134 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3917#true} {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:55,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:55,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:55,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:55,136 INFO L272 TraceCheckUtils]: 24: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:35:55,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:35:55,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:35:55,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:55,137 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3917#true} {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:35:55,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:35:55,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:35:55,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:35:55,139 INFO L272 TraceCheckUtils]: 32: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:35:55,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:35:55,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:35:55,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:55,139 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3917#true} {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #51#return; {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:35:55,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:35:55,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:35:55,141 INFO L290 TraceCheckUtils]: 39: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:35:55,141 INFO L272 TraceCheckUtils]: 40: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:35:55,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:35:55,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:35:55,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:55,142 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3917#true} {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #51#return; {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:35:55,142 INFO L290 TraceCheckUtils]: 45: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:35:55,143 INFO L290 TraceCheckUtils]: 46: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:35:55,143 INFO L290 TraceCheckUtils]: 47: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:35:55,143 INFO L272 TraceCheckUtils]: 48: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:35:55,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:35:55,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:35:55,144 INFO L290 TraceCheckUtils]: 51: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:35:55,144 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3917#true} {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #51#return; {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:35:55,145 INFO L290 TraceCheckUtils]: 53: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {4087#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:35:55,146 INFO L272 TraceCheckUtils]: 54: Hoare triple {4087#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4091#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:55,146 INFO L290 TraceCheckUtils]: 55: Hoare triple {4091#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4095#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:55,146 INFO L290 TraceCheckUtils]: 56: Hoare triple {4095#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3918#false} is VALID [2022-04-27 14:35:55,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {3918#false} assume !false; {3918#false} is VALID [2022-04-27 14:35:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:35:55,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:55,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:55,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639690200] [2022-04-27 14:35:55,451 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:55,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318787670] [2022-04-27 14:35:55,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318787670] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:55,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:55,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:35:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310897720] [2022-04-27 14:35:55,452 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:55,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-27 14:35:55,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:55,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:55,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:55,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:35:55,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:55,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:35:55,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:35:55,487 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:56,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:56,038 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-04-27 14:35:56,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:35:56,038 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-27 14:35:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-27 14:35:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-27 14:35:56,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-27 14:35:56,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:56,082 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:35:56,082 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:35:56,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:35:56,083 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:56,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:35:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:35:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:35:56,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:56,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:56,132 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:56,133 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:56,134 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-27 14:35:56,134 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 14:35:56,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:56,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:56,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:35:56,135 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:35:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:56,137 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-27 14:35:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 14:35:56,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:56,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:56,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:56,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-04-27 14:35:56,139 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 58 [2022-04-27 14:35:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:56,140 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-04-27 14:35:56,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:35:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 14:35:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 14:35:56,140 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:56,141 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:56,150 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 14:35:56,345 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,SelfDestructingSolverStorable10 [2022-04-27 14:35:56,346 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:56,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 6 times [2022-04-27 14:35:56,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:56,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496374768] [2022-04-27 14:35:56,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:56,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:56,358 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:56,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739247737] [2022-04-27 14:35:56,358 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:35:56,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:56,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:56,359 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 14:35:56,361 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 14:35:56,708 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:35:56,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:56,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:35:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:56,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:57,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {4603#true} call ULTIMATE.init(); {4603#true} is VALID [2022-04-27 14:35:57,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {4603#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4603#true} is VALID [2022-04-27 14:35:57,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:57,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4603#true} {4603#true} #57#return; {4603#true} is VALID [2022-04-27 14:35:57,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {4603#true} call #t~ret6 := main(); {4603#true} is VALID [2022-04-27 14:35:57,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {4603#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:57,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:57,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:57,197 INFO L272 TraceCheckUtils]: 8: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:57,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:57,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:57,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:57,198 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4603#true} {4623#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:57,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:57,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:57,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:57,199 INFO L272 TraceCheckUtils]: 16: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:57,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:57,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:57,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:57,200 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4603#true} {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:35:57,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4673#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:35:57,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {4673#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4673#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:35:57,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {4673#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 50);havoc #t~post5; {4673#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:35:57,202 INFO L272 TraceCheckUtils]: 24: Hoare triple {4673#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:57,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:57,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:57,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:57,203 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4603#true} {4673#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {4673#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:35:57,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {4673#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:35:57,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:35:57,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:35:57,204 INFO L272 TraceCheckUtils]: 32: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:57,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:57,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:57,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:57,205 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4603#true} {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #51#return; {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:35:57,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:35:57,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:35:57,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 50);havoc #t~post5; {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:35:57,207 INFO L272 TraceCheckUtils]: 40: Hoare triple {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:57,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:57,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:57,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:57,207 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4603#true} {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #51#return; {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:35:57,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:35:57,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:35:57,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !!(#t~post5 < 50);havoc #t~post5; {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:35:57,209 INFO L272 TraceCheckUtils]: 48: Hoare triple {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:57,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:57,209 INFO L290 TraceCheckUtils]: 50: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:57,209 INFO L290 TraceCheckUtils]: 51: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:57,210 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4603#true} {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #51#return; {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:35:57,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:35:57,211 INFO L290 TraceCheckUtils]: 54: Hoare triple {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:35:57,211 INFO L290 TraceCheckUtils]: 55: Hoare triple {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:35:57,211 INFO L272 TraceCheckUtils]: 56: Hoare triple {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4603#true} is VALID [2022-04-27 14:35:57,211 INFO L290 TraceCheckUtils]: 57: Hoare triple {4603#true} ~cond := #in~cond; {4603#true} is VALID [2022-04-27 14:35:57,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {4603#true} assume !(0 == ~cond); {4603#true} is VALID [2022-04-27 14:35:57,211 INFO L290 TraceCheckUtils]: 59: Hoare triple {4603#true} assume true; {4603#true} is VALID [2022-04-27 14:35:57,212 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4603#true} {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} #51#return; {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:35:57,213 INFO L290 TraceCheckUtils]: 61: Hoare triple {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {4798#(and (<= main_~k~0 6) (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0))} is VALID [2022-04-27 14:35:57,213 INFO L272 TraceCheckUtils]: 62: Hoare triple {4798#(and (<= main_~k~0 6) (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4802#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:57,214 INFO L290 TraceCheckUtils]: 63: Hoare triple {4802#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4806#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:57,214 INFO L290 TraceCheckUtils]: 64: Hoare triple {4806#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4604#false} is VALID [2022-04-27 14:35:57,214 INFO L290 TraceCheckUtils]: 65: Hoare triple {4604#false} assume !false; {4604#false} is VALID [2022-04-27 14:35:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 14:35:57,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:57,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:57,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496374768] [2022-04-27 14:35:57,517 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:57,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739247737] [2022-04-27 14:35:57,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739247737] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:57,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:57,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:35:57,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984456998] [2022-04-27 14:35:57,517 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:57,518 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-27 14:35:57,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:57,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:57,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:57,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:35:57,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:57,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:35:57,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:35:57,558 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:58,176 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2022-04-27 14:35:58,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:35:58,176 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-27 14:35:58,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 14:35:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 14:35:58,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-27 14:35:58,233 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 14:35:58,235 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:35:58,235 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:35:58,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:35:58,236 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:58,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:35:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:35:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:35:58,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:58,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:58,277 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:58,277 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:58,279 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-27 14:35:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 14:35:58,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:58,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:58,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:35:58,280 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:35:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:58,282 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-27 14:35:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 14:35:58,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:58,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:58,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:58,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:35:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-04-27 14:35:58,284 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 66 [2022-04-27 14:35:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:58,285 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-04-27 14:35:58,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:35:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 14:35:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-27 14:35:58,285 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:58,286 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:58,297 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 14:35:58,492 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,SelfDestructingSolverStorable11 [2022-04-27 14:35:58,492 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:58,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:58,493 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 7 times [2022-04-27 14:35:58,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:58,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710864123] [2022-04-27 14:35:58,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:58,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:58,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:58,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959160533] [2022-04-27 14:35:58,513 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:35:58,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:58,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:58,515 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 14:35:58,515 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 14:35:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:58,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 14:35:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:58,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:59,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {5314#true} call ULTIMATE.init(); {5314#true} is VALID [2022-04-27 14:35:59,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {5314#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5314#true} is VALID [2022-04-27 14:35:59,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:35:59,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5314#true} {5314#true} #57#return; {5314#true} is VALID [2022-04-27 14:35:59,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {5314#true} call #t~ret6 := main(); {5314#true} is VALID [2022-04-27 14:35:59,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {5314#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5334#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:59,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {5334#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5334#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:59,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {5334#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {5334#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:59,535 INFO L272 TraceCheckUtils]: 8: Hoare triple {5334#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:35:59,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:35:59,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:35:59,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:35:59,536 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5314#true} {5334#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {5334#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:35:59,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {5334#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:35:59,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:35:59,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:35:59,537 INFO L272 TraceCheckUtils]: 16: Hoare triple {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:35:59,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:35:59,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:35:59,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:35:59,539 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5314#true} {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #51#return; {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:35:59,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,541 INFO L272 TraceCheckUtils]: 24: Hoare triple {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:35:59,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:35:59,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:35:59,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:35:59,541 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5314#true} {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} #51#return; {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:35:59,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:35:59,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:35:59,542 INFO L272 TraceCheckUtils]: 32: Hoare triple {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:35:59,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:35:59,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:35:59,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:35:59,543 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5314#true} {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #51#return; {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:35:59,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,544 INFO L272 TraceCheckUtils]: 40: Hoare triple {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:35:59,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:35:59,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:35:59,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:35:59,545 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5314#true} {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #51#return; {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,546 INFO L272 TraceCheckUtils]: 48: Hoare triple {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:35:59,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:35:59,546 INFO L290 TraceCheckUtils]: 50: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:35:59,546 INFO L290 TraceCheckUtils]: 51: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:35:59,547 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5314#true} {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} #51#return; {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,547 INFO L290 TraceCheckUtils]: 53: Hoare triple {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,547 INFO L290 TraceCheckUtils]: 54: Hoare triple {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,548 INFO L290 TraceCheckUtils]: 55: Hoare triple {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,548 INFO L272 TraceCheckUtils]: 56: Hoare triple {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:35:59,548 INFO L290 TraceCheckUtils]: 57: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:35:59,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:35:59,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:35:59,549 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5314#true} {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #51#return; {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:35:59,549 INFO L290 TraceCheckUtils]: 61: Hoare triple {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:35:59,550 INFO L290 TraceCheckUtils]: 62: Hoare triple {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:35:59,550 INFO L290 TraceCheckUtils]: 63: Hoare triple {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:35:59,550 INFO L272 TraceCheckUtils]: 64: Hoare triple {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5314#true} is VALID [2022-04-27 14:35:59,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {5314#true} ~cond := #in~cond; {5314#true} is VALID [2022-04-27 14:35:59,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {5314#true} assume !(0 == ~cond); {5314#true} is VALID [2022-04-27 14:35:59,550 INFO L290 TraceCheckUtils]: 67: Hoare triple {5314#true} assume true; {5314#true} is VALID [2022-04-27 14:35:59,551 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5314#true} {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #51#return; {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:35:59,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {5534#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:35:59,552 INFO L272 TraceCheckUtils]: 70: Hoare triple {5534#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5538#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:59,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {5538#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5542#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:59,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {5542#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5315#false} is VALID [2022-04-27 14:35:59,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {5315#false} assume !false; {5315#false} is VALID [2022-04-27 14:35:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 14:35:59,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:00,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:00,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710864123] [2022-04-27 14:36:00,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:00,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959160533] [2022-04-27 14:36:00,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959160533] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:00,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:00,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:36:00,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111126641] [2022-04-27 14:36:00,633 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:00,633 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-27 14:36:00,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:00,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:00,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:00,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:36:00,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:00,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:36:00,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:36:00,683 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:01,425 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-04-27 14:36:01,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:36:01,425 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-27 14:36:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 14:36:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 14:36:01,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-27 14:36:01,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:01,484 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:36:01,484 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:36:01,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:36:01,485 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:01,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:36:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:36:01,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:36:01,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:01,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:01,537 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:01,537 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:01,539 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-27 14:36:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 14:36:01,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:01,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:01,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:36:01,540 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:36:01,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:01,542 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-27 14:36:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 14:36:01,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:01,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:01,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:01,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2022-04-27 14:36:01,544 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 74 [2022-04-27 14:36:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:01,544 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2022-04-27 14:36:01,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:36:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 14:36:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 14:36:01,545 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:01,545 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:01,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-27 14:36:01,751 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,SelfDestructingSolverStorable12 [2022-04-27 14:36:01,752 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:01,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 8 times [2022-04-27 14:36:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:01,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873866599] [2022-04-27 14:36:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:01,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:01,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300624359] [2022-04-27 14:36:01,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:36:01,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:01,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:01,770 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 14:36:01,783 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 14:36:02,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:36:02,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:02,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:36:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:02,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:02,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {6200#true} call ULTIMATE.init(); {6200#true} is VALID [2022-04-27 14:36:02,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {6200#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6200#true} is VALID [2022-04-27 14:36:02,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:36:02,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6200#true} {6200#true} #57#return; {6200#true} is VALID [2022-04-27 14:36:02,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {6200#true} call #t~ret6 := main(); {6200#true} is VALID [2022-04-27 14:36:02,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {6200#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:02,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {6220#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:02,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {6220#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:02,784 INFO L272 TraceCheckUtils]: 8: Hoare triple {6220#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:36:02,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:36:02,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:36:02,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:36:02,785 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6200#true} {6220#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:02,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {6220#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:02,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:02,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:02,786 INFO L272 TraceCheckUtils]: 16: Hoare triple {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:36:02,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:36:02,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:36:02,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:36:02,787 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6200#true} {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:02,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:02,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:02,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:02,788 INFO L272 TraceCheckUtils]: 24: Hoare triple {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:36:02,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:36:02,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:36:02,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:36:02,788 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6200#true} {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:02,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6295#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:02,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {6295#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6295#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:02,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {6295#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {6295#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:02,789 INFO L272 TraceCheckUtils]: 32: Hoare triple {6295#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:36:02,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:36:02,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:36:02,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:36:02,790 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6200#true} {6295#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {6295#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:02,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {6295#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:02,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:02,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:02,791 INFO L272 TraceCheckUtils]: 40: Hoare triple {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:36:02,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:36:02,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:36:02,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:36:02,792 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6200#true} {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #51#return; {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:02,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:36:02,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:36:02,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(#t~post5 < 50);havoc #t~post5; {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:36:02,793 INFO L272 TraceCheckUtils]: 48: Hoare triple {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:36:02,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:36:02,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:36:02,793 INFO L290 TraceCheckUtils]: 51: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:36:02,794 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6200#true} {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #51#return; {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:36:02,794 INFO L290 TraceCheckUtils]: 53: Hoare triple {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:36:02,794 INFO L290 TraceCheckUtils]: 54: Hoare triple {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:36:02,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} assume !!(#t~post5 < 50);havoc #t~post5; {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:36:02,795 INFO L272 TraceCheckUtils]: 56: Hoare triple {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:36:02,795 INFO L290 TraceCheckUtils]: 57: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:36:02,795 INFO L290 TraceCheckUtils]: 58: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:36:02,795 INFO L290 TraceCheckUtils]: 59: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:36:02,795 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6200#true} {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} #51#return; {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:36:02,796 INFO L290 TraceCheckUtils]: 61: Hoare triple {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:36:02,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:36:02,797 INFO L290 TraceCheckUtils]: 63: Hoare triple {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} assume !!(#t~post5 < 50);havoc #t~post5; {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:36:02,797 INFO L272 TraceCheckUtils]: 64: Hoare triple {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:36:02,797 INFO L290 TraceCheckUtils]: 65: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:36:02,797 INFO L290 TraceCheckUtils]: 66: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:36:02,797 INFO L290 TraceCheckUtils]: 67: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:36:02,798 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6200#true} {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} #51#return; {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:36:02,798 INFO L290 TraceCheckUtils]: 69: Hoare triple {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:36:02,798 INFO L290 TraceCheckUtils]: 70: Hoare triple {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:36:02,799 INFO L290 TraceCheckUtils]: 71: Hoare triple {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 50);havoc #t~post5; {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:36:02,799 INFO L272 TraceCheckUtils]: 72: Hoare triple {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6200#true} is VALID [2022-04-27 14:36:02,799 INFO L290 TraceCheckUtils]: 73: Hoare triple {6200#true} ~cond := #in~cond; {6200#true} is VALID [2022-04-27 14:36:02,799 INFO L290 TraceCheckUtils]: 74: Hoare triple {6200#true} assume !(0 == ~cond); {6200#true} is VALID [2022-04-27 14:36:02,799 INFO L290 TraceCheckUtils]: 75: Hoare triple {6200#true} assume true; {6200#true} is VALID [2022-04-27 14:36:02,800 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6200#true} {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #51#return; {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:36:02,800 INFO L290 TraceCheckUtils]: 77: Hoare triple {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {6445#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:36:02,801 INFO L272 TraceCheckUtils]: 78: Hoare triple {6445#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6449#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:02,801 INFO L290 TraceCheckUtils]: 79: Hoare triple {6449#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6453#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:02,802 INFO L290 TraceCheckUtils]: 80: Hoare triple {6453#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6201#false} is VALID [2022-04-27 14:36:02,802 INFO L290 TraceCheckUtils]: 81: Hoare triple {6201#false} assume !false; {6201#false} is VALID [2022-04-27 14:36:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 14:36:02,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:03,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:03,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873866599] [2022-04-27 14:36:03,070 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:03,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300624359] [2022-04-27 14:36:03,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300624359] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:03,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:03,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:36:03,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644435869] [2022-04-27 14:36:03,072 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:03,075 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-27 14:36:03,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:03,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:03,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:03,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:36:03,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:03,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:36:03,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:36:03,120 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:03,945 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-04-27 14:36:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:36:03,946 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-27 14:36:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-27 14:36:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-27 14:36:03,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-27 14:36:04,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:04,007 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:36:04,007 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:36:04,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:36:04,008 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:04,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 408 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:36:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:36:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:36:04,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:04,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:04,057 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:04,057 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:04,058 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-27 14:36:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 14:36:04,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:04,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:04,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:36:04,059 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:36:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:04,061 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-27 14:36:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 14:36:04,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:04,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:04,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:04,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-04-27 14:36:04,063 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 82 [2022-04-27 14:36:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:04,064 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-04-27 14:36:04,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:36:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 14:36:04,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-27 14:36:04,069 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:04,069 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:04,078 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 14:36:04,276 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,SelfDestructingSolverStorable13 [2022-04-27 14:36:04,276 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash 488857026, now seen corresponding path program 9 times [2022-04-27 14:36:04,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:04,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992081037] [2022-04-27 14:36:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:04,296 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:04,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589681670] [2022-04-27 14:36:04,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:36:04,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:04,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:04,301 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:04,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 14:36:04,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 14:36:04,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:04,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-27 14:36:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:04,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:05,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {6961#true} call ULTIMATE.init(); {6961#true} is VALID [2022-04-27 14:36:05,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {6961#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6961#true} is VALID [2022-04-27 14:36:05,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:36:05,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6961#true} {6961#true} #57#return; {6961#true} is VALID [2022-04-27 14:36:05,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {6961#true} call #t~ret6 := main(); {6961#true} is VALID [2022-04-27 14:36:05,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {6961#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6981#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:05,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {6981#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6981#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:05,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {6981#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {6981#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:05,414 INFO L272 TraceCheckUtils]: 8: Hoare triple {6981#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:36:05,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:36:05,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:36:05,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:36:05,414 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6961#true} {6981#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {6981#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:05,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {6981#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:05,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:05,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:05,416 INFO L272 TraceCheckUtils]: 16: Hoare triple {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:36:05,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:36:05,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:36:05,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:36:05,417 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6961#true} {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:05,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7031#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:05,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {7031#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7031#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:05,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {7031#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {7031#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:05,418 INFO L272 TraceCheckUtils]: 24: Hoare triple {7031#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:36:05,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:36:05,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:36:05,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:36:05,419 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6961#true} {7031#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {7031#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:05,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {7031#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7056#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:36:05,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {7056#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7056#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:36:05,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {7056#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {7056#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:36:05,421 INFO L272 TraceCheckUtils]: 32: Hoare triple {7056#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:36:05,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:36:05,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:36:05,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:36:05,422 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6961#true} {7056#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #51#return; {7056#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:36:05,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {7056#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7081#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:36:05,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {7081#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7081#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:36:05,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {7081#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {7081#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:36:05,423 INFO L272 TraceCheckUtils]: 40: Hoare triple {7081#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:36:05,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:36:05,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:36:05,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:36:05,424 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6961#true} {7081#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #51#return; {7081#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:36:05,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {7081#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7106#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:36:05,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {7106#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7106#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:36:05,426 INFO L290 TraceCheckUtils]: 47: Hoare triple {7106#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 50);havoc #t~post5; {7106#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:36:05,426 INFO L272 TraceCheckUtils]: 48: Hoare triple {7106#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:36:05,426 INFO L290 TraceCheckUtils]: 49: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:36:05,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:36:05,426 INFO L290 TraceCheckUtils]: 51: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:36:05,427 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6961#true} {7106#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} #51#return; {7106#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:36:05,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {7106#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7131#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-27 14:36:05,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {7131#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7131#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-27 14:36:05,428 INFO L290 TraceCheckUtils]: 55: Hoare triple {7131#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {7131#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-27 14:36:05,428 INFO L272 TraceCheckUtils]: 56: Hoare triple {7131#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:36:05,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:36:05,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:36:05,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:36:05,429 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6961#true} {7131#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} #51#return; {7131#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-27 14:36:05,429 INFO L290 TraceCheckUtils]: 61: Hoare triple {7131#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} is VALID [2022-04-27 14:36:05,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} is VALID [2022-04-27 14:36:05,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} is VALID [2022-04-27 14:36:05,430 INFO L272 TraceCheckUtils]: 64: Hoare triple {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:36:05,430 INFO L290 TraceCheckUtils]: 65: Hoare triple {6961#true} ~cond := #in~cond; {6961#true} is VALID [2022-04-27 14:36:05,430 INFO L290 TraceCheckUtils]: 66: Hoare triple {6961#true} assume !(0 == ~cond); {6961#true} is VALID [2022-04-27 14:36:05,431 INFO L290 TraceCheckUtils]: 67: Hoare triple {6961#true} assume true; {6961#true} is VALID [2022-04-27 14:36:05,431 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6961#true} {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} #51#return; {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} is VALID [2022-04-27 14:36:05,432 INFO L290 TraceCheckUtils]: 69: Hoare triple {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:36:05,432 INFO L290 TraceCheckUtils]: 70: Hoare triple {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:36:05,432 INFO L290 TraceCheckUtils]: 71: Hoare triple {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(#t~post5 < 50);havoc #t~post5; {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:36:05,433 INFO L272 TraceCheckUtils]: 72: Hoare triple {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:36:05,433 INFO L290 TraceCheckUtils]: 73: Hoare triple {6961#true} ~cond := #in~cond; {7194#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:05,433 INFO L290 TraceCheckUtils]: 74: Hoare triple {7194#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:05,434 INFO L290 TraceCheckUtils]: 75: Hoare triple {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:05,434 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #51#return; {7205#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-27 14:36:05,435 INFO L290 TraceCheckUtils]: 77: Hoare triple {7205#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7209#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:36:05,436 INFO L290 TraceCheckUtils]: 78: Hoare triple {7209#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7209#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:36:05,436 INFO L290 TraceCheckUtils]: 79: Hoare triple {7209#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 50);havoc #t~post5; {7209#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:36:05,436 INFO L272 TraceCheckUtils]: 80: Hoare triple {7209#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6961#true} is VALID [2022-04-27 14:36:05,437 INFO L290 TraceCheckUtils]: 81: Hoare triple {6961#true} ~cond := #in~cond; {7194#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:05,437 INFO L290 TraceCheckUtils]: 82: Hoare triple {7194#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:05,437 INFO L290 TraceCheckUtils]: 83: Hoare triple {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:05,438 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} {7209#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} #51#return; {7231#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:36:05,439 INFO L290 TraceCheckUtils]: 85: Hoare triple {7231#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {7235#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:36:05,440 INFO L272 TraceCheckUtils]: 86: Hoare triple {7235#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7239#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:05,440 INFO L290 TraceCheckUtils]: 87: Hoare triple {7239#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7243#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:05,440 INFO L290 TraceCheckUtils]: 88: Hoare triple {7243#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6962#false} is VALID [2022-04-27 14:36:05,441 INFO L290 TraceCheckUtils]: 89: Hoare triple {6962#false} assume !false; {6962#false} is VALID [2022-04-27 14:36:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-27 14:36:05,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:23,902 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse1 (* 13 c_main_~y~0 c_main_~y~0)) (.cse2 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (not (<= (+ (* c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1 (* 3 (* c_main_~y~0 c_main_~y~0))) (div (+ .cse0 .cse1 4 .cse2) 4))) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse3 (+ c_main_~y~0 1))) (= (* .cse3 .cse3) (* main_~k~0 .cse3))))) (not (= 0 (mod (+ .cse0 .cse1 .cse2) 4))))) is different from false [2022-04-27 14:36:28,098 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= 0 (mod (+ (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 13 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4)))) is different from false [2022-04-27 14:36:28,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:28,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992081037] [2022-04-27 14:36:28,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:28,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589681670] [2022-04-27 14:36:28,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589681670] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:28,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:28,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-27 14:36:28,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074430034] [2022-04-27 14:36:28,102 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:28,102 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 90 [2022-04-27 14:36:28,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:28,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:28,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:28,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 14:36:28,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 14:36:28,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=446, Unknown=2, NotChecked=86, Total=600 [2022-04-27 14:36:28,152 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:29,598 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-27 14:36:29,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 14:36:29,598 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 90 [2022-04-27 14:36:29,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-27 14:36:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-27 14:36:29,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2022-04-27 14:36:29,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:29,662 INFO L225 Difference]: With dead ends: 100 [2022-04-27 14:36:29,662 INFO L226 Difference]: Without dead ends: 95 [2022-04-27 14:36:29,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=87, Invalid=569, Unknown=2, NotChecked=98, Total=756 [2022-04-27 14:36:29,663 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:29,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 482 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 14:36:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-27 14:36:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-27 14:36:29,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:29,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:29,716 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:29,716 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:29,718 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-27 14:36:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 14:36:29,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:29,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:29,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-27 14:36:29,719 INFO L87 Difference]: Start difference. First operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-27 14:36:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:29,721 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-27 14:36:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 14:36:29,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:29,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:29,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:29,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-04-27 14:36:29,724 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 90 [2022-04-27 14:36:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:29,724 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-04-27 14:36:29,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:36:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 14:36:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 14:36:29,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:29,725 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:29,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:29,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:29,931 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:29,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:29,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1958171289, now seen corresponding path program 3 times [2022-04-27 14:36:29,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:29,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072840369] [2022-04-27 14:36:29,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:29,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:29,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:29,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795153536] [2022-04-27 14:36:29,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:36:29,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:29,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:29,947 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:29,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 14:36:30,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 14:36:30,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:30,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 14:36:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:30,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:30,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {7766#true} call ULTIMATE.init(); {7766#true} is VALID [2022-04-27 14:36:30,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {7766#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7774#(<= ~counter~0 0)} is VALID [2022-04-27 14:36:30,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {7774#(<= ~counter~0 0)} assume true; {7774#(<= ~counter~0 0)} is VALID [2022-04-27 14:36:30,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7774#(<= ~counter~0 0)} {7766#true} #57#return; {7774#(<= ~counter~0 0)} is VALID [2022-04-27 14:36:30,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {7774#(<= ~counter~0 0)} call #t~ret6 := main(); {7774#(<= ~counter~0 0)} is VALID [2022-04-27 14:36:30,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {7774#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7774#(<= ~counter~0 0)} is VALID [2022-04-27 14:36:30,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {7774#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7790#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:30,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {7790#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {7790#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:30,521 INFO L272 TraceCheckUtils]: 8: Hoare triple {7790#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7790#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:30,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {7790#(<= ~counter~0 1)} ~cond := #in~cond; {7790#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:30,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {7790#(<= ~counter~0 1)} assume !(0 == ~cond); {7790#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:30,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {7790#(<= ~counter~0 1)} assume true; {7790#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:30,523 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7790#(<= ~counter~0 1)} {7790#(<= ~counter~0 1)} #51#return; {7790#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:30,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {7790#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7790#(<= ~counter~0 1)} is VALID [2022-04-27 14:36:30,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {7790#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7815#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:30,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {7815#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {7815#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:30,525 INFO L272 TraceCheckUtils]: 16: Hoare triple {7815#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7815#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:30,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {7815#(<= ~counter~0 2)} ~cond := #in~cond; {7815#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:30,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {7815#(<= ~counter~0 2)} assume !(0 == ~cond); {7815#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:30,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {7815#(<= ~counter~0 2)} assume true; {7815#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:30,526 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7815#(<= ~counter~0 2)} {7815#(<= ~counter~0 2)} #51#return; {7815#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:30,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {7815#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7815#(<= ~counter~0 2)} is VALID [2022-04-27 14:36:30,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {7815#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7840#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:30,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {7840#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {7840#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:30,528 INFO L272 TraceCheckUtils]: 24: Hoare triple {7840#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7840#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:30,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {7840#(<= ~counter~0 3)} ~cond := #in~cond; {7840#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:30,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {7840#(<= ~counter~0 3)} assume !(0 == ~cond); {7840#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:30,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {7840#(<= ~counter~0 3)} assume true; {7840#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:30,529 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7840#(<= ~counter~0 3)} {7840#(<= ~counter~0 3)} #51#return; {7840#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:30,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {7840#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7840#(<= ~counter~0 3)} is VALID [2022-04-27 14:36:30,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {7840#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7865#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:30,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {7865#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {7865#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:30,531 INFO L272 TraceCheckUtils]: 32: Hoare triple {7865#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7865#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:30,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {7865#(<= ~counter~0 4)} ~cond := #in~cond; {7865#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:30,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {7865#(<= ~counter~0 4)} assume !(0 == ~cond); {7865#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:30,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {7865#(<= ~counter~0 4)} assume true; {7865#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:30,533 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7865#(<= ~counter~0 4)} {7865#(<= ~counter~0 4)} #51#return; {7865#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:30,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {7865#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7865#(<= ~counter~0 4)} is VALID [2022-04-27 14:36:30,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {7865#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7890#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:30,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {7890#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {7890#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:30,534 INFO L272 TraceCheckUtils]: 40: Hoare triple {7890#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7890#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:30,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {7890#(<= ~counter~0 5)} ~cond := #in~cond; {7890#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:30,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {7890#(<= ~counter~0 5)} assume !(0 == ~cond); {7890#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:30,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {7890#(<= ~counter~0 5)} assume true; {7890#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:30,536 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7890#(<= ~counter~0 5)} {7890#(<= ~counter~0 5)} #51#return; {7890#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:30,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {7890#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7890#(<= ~counter~0 5)} is VALID [2022-04-27 14:36:30,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {7890#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7915#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:30,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {7915#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {7915#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:30,538 INFO L272 TraceCheckUtils]: 48: Hoare triple {7915#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7915#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:30,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {7915#(<= ~counter~0 6)} ~cond := #in~cond; {7915#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:30,538 INFO L290 TraceCheckUtils]: 50: Hoare triple {7915#(<= ~counter~0 6)} assume !(0 == ~cond); {7915#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:30,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {7915#(<= ~counter~0 6)} assume true; {7915#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:30,539 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7915#(<= ~counter~0 6)} {7915#(<= ~counter~0 6)} #51#return; {7915#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:30,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {7915#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7915#(<= ~counter~0 6)} is VALID [2022-04-27 14:36:30,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {7915#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7940#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:30,540 INFO L290 TraceCheckUtils]: 55: Hoare triple {7940#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {7940#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:30,541 INFO L272 TraceCheckUtils]: 56: Hoare triple {7940#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7940#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:30,541 INFO L290 TraceCheckUtils]: 57: Hoare triple {7940#(<= ~counter~0 7)} ~cond := #in~cond; {7940#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:30,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {7940#(<= ~counter~0 7)} assume !(0 == ~cond); {7940#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:30,542 INFO L290 TraceCheckUtils]: 59: Hoare triple {7940#(<= ~counter~0 7)} assume true; {7940#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:30,543 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7940#(<= ~counter~0 7)} {7940#(<= ~counter~0 7)} #51#return; {7940#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:30,543 INFO L290 TraceCheckUtils]: 61: Hoare triple {7940#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7940#(<= ~counter~0 7)} is VALID [2022-04-27 14:36:30,543 INFO L290 TraceCheckUtils]: 62: Hoare triple {7940#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7965#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:30,544 INFO L290 TraceCheckUtils]: 63: Hoare triple {7965#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {7965#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:30,544 INFO L272 TraceCheckUtils]: 64: Hoare triple {7965#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7965#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:30,545 INFO L290 TraceCheckUtils]: 65: Hoare triple {7965#(<= ~counter~0 8)} ~cond := #in~cond; {7965#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:30,545 INFO L290 TraceCheckUtils]: 66: Hoare triple {7965#(<= ~counter~0 8)} assume !(0 == ~cond); {7965#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:30,545 INFO L290 TraceCheckUtils]: 67: Hoare triple {7965#(<= ~counter~0 8)} assume true; {7965#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:30,546 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7965#(<= ~counter~0 8)} {7965#(<= ~counter~0 8)} #51#return; {7965#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:30,546 INFO L290 TraceCheckUtils]: 69: Hoare triple {7965#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7965#(<= ~counter~0 8)} is VALID [2022-04-27 14:36:30,547 INFO L290 TraceCheckUtils]: 70: Hoare triple {7965#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7990#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:30,547 INFO L290 TraceCheckUtils]: 71: Hoare triple {7990#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {7990#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:30,548 INFO L272 TraceCheckUtils]: 72: Hoare triple {7990#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7990#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:30,548 INFO L290 TraceCheckUtils]: 73: Hoare triple {7990#(<= ~counter~0 9)} ~cond := #in~cond; {7990#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:30,548 INFO L290 TraceCheckUtils]: 74: Hoare triple {7990#(<= ~counter~0 9)} assume !(0 == ~cond); {7990#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:30,549 INFO L290 TraceCheckUtils]: 75: Hoare triple {7990#(<= ~counter~0 9)} assume true; {7990#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:30,549 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7990#(<= ~counter~0 9)} {7990#(<= ~counter~0 9)} #51#return; {7990#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:30,550 INFO L290 TraceCheckUtils]: 77: Hoare triple {7990#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7990#(<= ~counter~0 9)} is VALID [2022-04-27 14:36:30,550 INFO L290 TraceCheckUtils]: 78: Hoare triple {7990#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8015#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:30,550 INFO L290 TraceCheckUtils]: 79: Hoare triple {8015#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {8015#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:30,551 INFO L272 TraceCheckUtils]: 80: Hoare triple {8015#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8015#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:30,551 INFO L290 TraceCheckUtils]: 81: Hoare triple {8015#(<= ~counter~0 10)} ~cond := #in~cond; {8015#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:30,552 INFO L290 TraceCheckUtils]: 82: Hoare triple {8015#(<= ~counter~0 10)} assume !(0 == ~cond); {8015#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:30,552 INFO L290 TraceCheckUtils]: 83: Hoare triple {8015#(<= ~counter~0 10)} assume true; {8015#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:30,552 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {8015#(<= ~counter~0 10)} {8015#(<= ~counter~0 10)} #51#return; {8015#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:30,553 INFO L290 TraceCheckUtils]: 85: Hoare triple {8015#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8015#(<= ~counter~0 10)} is VALID [2022-04-27 14:36:30,553 INFO L290 TraceCheckUtils]: 86: Hoare triple {8015#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8040#(<= |main_#t~post5| 10)} is VALID [2022-04-27 14:36:30,554 INFO L290 TraceCheckUtils]: 87: Hoare triple {8040#(<= |main_#t~post5| 10)} assume !(#t~post5 < 50);havoc #t~post5; {7767#false} is VALID [2022-04-27 14:36:30,554 INFO L272 TraceCheckUtils]: 88: Hoare triple {7767#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7767#false} is VALID [2022-04-27 14:36:30,554 INFO L290 TraceCheckUtils]: 89: Hoare triple {7767#false} ~cond := #in~cond; {7767#false} is VALID [2022-04-27 14:36:30,554 INFO L290 TraceCheckUtils]: 90: Hoare triple {7767#false} assume 0 == ~cond; {7767#false} is VALID [2022-04-27 14:36:30,554 INFO L290 TraceCheckUtils]: 91: Hoare triple {7767#false} assume !false; {7767#false} is VALID [2022-04-27 14:36:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:36:30,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:31,140 INFO L290 TraceCheckUtils]: 91: Hoare triple {7767#false} assume !false; {7767#false} is VALID [2022-04-27 14:36:31,141 INFO L290 TraceCheckUtils]: 90: Hoare triple {7767#false} assume 0 == ~cond; {7767#false} is VALID [2022-04-27 14:36:31,141 INFO L290 TraceCheckUtils]: 89: Hoare triple {7767#false} ~cond := #in~cond; {7767#false} is VALID [2022-04-27 14:36:31,141 INFO L272 TraceCheckUtils]: 88: Hoare triple {7767#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7767#false} is VALID [2022-04-27 14:36:31,141 INFO L290 TraceCheckUtils]: 87: Hoare triple {8068#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {7767#false} is VALID [2022-04-27 14:36:31,141 INFO L290 TraceCheckUtils]: 86: Hoare triple {8072#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8068#(< |main_#t~post5| 50)} is VALID [2022-04-27 14:36:31,142 INFO L290 TraceCheckUtils]: 85: Hoare triple {8072#(< ~counter~0 50)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8072#(< ~counter~0 50)} is VALID [2022-04-27 14:36:31,142 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7766#true} {8072#(< ~counter~0 50)} #51#return; {8072#(< ~counter~0 50)} is VALID [2022-04-27 14:36:31,142 INFO L290 TraceCheckUtils]: 83: Hoare triple {7766#true} assume true; {7766#true} is VALID [2022-04-27 14:36:31,142 INFO L290 TraceCheckUtils]: 82: Hoare triple {7766#true} assume !(0 == ~cond); {7766#true} is VALID [2022-04-27 14:36:31,142 INFO L290 TraceCheckUtils]: 81: Hoare triple {7766#true} ~cond := #in~cond; {7766#true} is VALID [2022-04-27 14:36:31,142 INFO L272 TraceCheckUtils]: 80: Hoare triple {8072#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7766#true} is VALID [2022-04-27 14:36:31,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {8072#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {8072#(< ~counter~0 50)} is VALID [2022-04-27 14:36:31,144 INFO L290 TraceCheckUtils]: 78: Hoare triple {8097#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8072#(< ~counter~0 50)} is VALID [2022-04-27 14:36:31,144 INFO L290 TraceCheckUtils]: 77: Hoare triple {8097#(< ~counter~0 49)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8097#(< ~counter~0 49)} is VALID [2022-04-27 14:36:31,145 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7766#true} {8097#(< ~counter~0 49)} #51#return; {8097#(< ~counter~0 49)} is VALID [2022-04-27 14:36:31,145 INFO L290 TraceCheckUtils]: 75: Hoare triple {7766#true} assume true; {7766#true} is VALID [2022-04-27 14:36:31,145 INFO L290 TraceCheckUtils]: 74: Hoare triple {7766#true} assume !(0 == ~cond); {7766#true} is VALID [2022-04-27 14:36:31,145 INFO L290 TraceCheckUtils]: 73: Hoare triple {7766#true} ~cond := #in~cond; {7766#true} is VALID [2022-04-27 14:36:31,145 INFO L272 TraceCheckUtils]: 72: Hoare triple {8097#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7766#true} is VALID [2022-04-27 14:36:31,146 INFO L290 TraceCheckUtils]: 71: Hoare triple {8097#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {8097#(< ~counter~0 49)} is VALID [2022-04-27 14:36:31,146 INFO L290 TraceCheckUtils]: 70: Hoare triple {8122#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8097#(< ~counter~0 49)} is VALID [2022-04-27 14:36:31,147 INFO L290 TraceCheckUtils]: 69: Hoare triple {8122#(< ~counter~0 48)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8122#(< ~counter~0 48)} is VALID [2022-04-27 14:36:31,147 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7766#true} {8122#(< ~counter~0 48)} #51#return; {8122#(< ~counter~0 48)} is VALID [2022-04-27 14:36:31,147 INFO L290 TraceCheckUtils]: 67: Hoare triple {7766#true} assume true; {7766#true} is VALID [2022-04-27 14:36:31,147 INFO L290 TraceCheckUtils]: 66: Hoare triple {7766#true} assume !(0 == ~cond); {7766#true} is VALID [2022-04-27 14:36:31,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {7766#true} ~cond := #in~cond; {7766#true} is VALID [2022-04-27 14:36:31,147 INFO L272 TraceCheckUtils]: 64: Hoare triple {8122#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7766#true} is VALID [2022-04-27 14:36:31,148 INFO L290 TraceCheckUtils]: 63: Hoare triple {8122#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {8122#(< ~counter~0 48)} is VALID [2022-04-27 14:36:31,148 INFO L290 TraceCheckUtils]: 62: Hoare triple {8147#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8122#(< ~counter~0 48)} is VALID [2022-04-27 14:36:31,149 INFO L290 TraceCheckUtils]: 61: Hoare triple {8147#(< ~counter~0 47)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8147#(< ~counter~0 47)} is VALID [2022-04-27 14:36:31,149 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7766#true} {8147#(< ~counter~0 47)} #51#return; {8147#(< ~counter~0 47)} is VALID [2022-04-27 14:36:31,149 INFO L290 TraceCheckUtils]: 59: Hoare triple {7766#true} assume true; {7766#true} is VALID [2022-04-27 14:36:31,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {7766#true} assume !(0 == ~cond); {7766#true} is VALID [2022-04-27 14:36:31,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {7766#true} ~cond := #in~cond; {7766#true} is VALID [2022-04-27 14:36:31,150 INFO L272 TraceCheckUtils]: 56: Hoare triple {8147#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7766#true} is VALID [2022-04-27 14:36:31,150 INFO L290 TraceCheckUtils]: 55: Hoare triple {8147#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {8147#(< ~counter~0 47)} is VALID [2022-04-27 14:36:31,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {8172#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8147#(< ~counter~0 47)} is VALID [2022-04-27 14:36:31,151 INFO L290 TraceCheckUtils]: 53: Hoare triple {8172#(< ~counter~0 46)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8172#(< ~counter~0 46)} is VALID [2022-04-27 14:36:31,151 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7766#true} {8172#(< ~counter~0 46)} #51#return; {8172#(< ~counter~0 46)} is VALID [2022-04-27 14:36:31,151 INFO L290 TraceCheckUtils]: 51: Hoare triple {7766#true} assume true; {7766#true} is VALID [2022-04-27 14:36:31,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {7766#true} assume !(0 == ~cond); {7766#true} is VALID [2022-04-27 14:36:31,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {7766#true} ~cond := #in~cond; {7766#true} is VALID [2022-04-27 14:36:31,152 INFO L272 TraceCheckUtils]: 48: Hoare triple {8172#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7766#true} is VALID [2022-04-27 14:36:31,152 INFO L290 TraceCheckUtils]: 47: Hoare triple {8172#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {8172#(< ~counter~0 46)} is VALID [2022-04-27 14:36:31,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {8197#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8172#(< ~counter~0 46)} is VALID [2022-04-27 14:36:31,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {8197#(< ~counter~0 45)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8197#(< ~counter~0 45)} is VALID [2022-04-27 14:36:31,153 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7766#true} {8197#(< ~counter~0 45)} #51#return; {8197#(< ~counter~0 45)} is VALID [2022-04-27 14:36:31,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {7766#true} assume true; {7766#true} is VALID [2022-04-27 14:36:31,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {7766#true} assume !(0 == ~cond); {7766#true} is VALID [2022-04-27 14:36:31,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {7766#true} ~cond := #in~cond; {7766#true} is VALID [2022-04-27 14:36:31,154 INFO L272 TraceCheckUtils]: 40: Hoare triple {8197#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7766#true} is VALID [2022-04-27 14:36:31,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {8197#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {8197#(< ~counter~0 45)} is VALID [2022-04-27 14:36:31,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {8222#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8197#(< ~counter~0 45)} is VALID [2022-04-27 14:36:31,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {8222#(< ~counter~0 44)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8222#(< ~counter~0 44)} is VALID [2022-04-27 14:36:31,156 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7766#true} {8222#(< ~counter~0 44)} #51#return; {8222#(< ~counter~0 44)} is VALID [2022-04-27 14:36:31,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {7766#true} assume true; {7766#true} is VALID [2022-04-27 14:36:31,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {7766#true} assume !(0 == ~cond); {7766#true} is VALID [2022-04-27 14:36:31,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {7766#true} ~cond := #in~cond; {7766#true} is VALID [2022-04-27 14:36:31,156 INFO L272 TraceCheckUtils]: 32: Hoare triple {8222#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7766#true} is VALID [2022-04-27 14:36:31,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {8222#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {8222#(< ~counter~0 44)} is VALID [2022-04-27 14:36:31,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {8247#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8222#(< ~counter~0 44)} is VALID [2022-04-27 14:36:31,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {8247#(< ~counter~0 43)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8247#(< ~counter~0 43)} is VALID [2022-04-27 14:36:31,158 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7766#true} {8247#(< ~counter~0 43)} #51#return; {8247#(< ~counter~0 43)} is VALID [2022-04-27 14:36:31,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {7766#true} assume true; {7766#true} is VALID [2022-04-27 14:36:31,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {7766#true} assume !(0 == ~cond); {7766#true} is VALID [2022-04-27 14:36:31,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {7766#true} ~cond := #in~cond; {7766#true} is VALID [2022-04-27 14:36:31,158 INFO L272 TraceCheckUtils]: 24: Hoare triple {8247#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7766#true} is VALID [2022-04-27 14:36:31,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {8247#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {8247#(< ~counter~0 43)} is VALID [2022-04-27 14:36:31,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {8272#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8247#(< ~counter~0 43)} is VALID [2022-04-27 14:36:31,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {8272#(< ~counter~0 42)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8272#(< ~counter~0 42)} is VALID [2022-04-27 14:36:31,160 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7766#true} {8272#(< ~counter~0 42)} #51#return; {8272#(< ~counter~0 42)} is VALID [2022-04-27 14:36:31,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {7766#true} assume true; {7766#true} is VALID [2022-04-27 14:36:31,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {7766#true} assume !(0 == ~cond); {7766#true} is VALID [2022-04-27 14:36:31,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {7766#true} ~cond := #in~cond; {7766#true} is VALID [2022-04-27 14:36:31,161 INFO L272 TraceCheckUtils]: 16: Hoare triple {8272#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7766#true} is VALID [2022-04-27 14:36:31,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {8272#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {8272#(< ~counter~0 42)} is VALID [2022-04-27 14:36:31,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {8297#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8272#(< ~counter~0 42)} is VALID [2022-04-27 14:36:31,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {8297#(< ~counter~0 41)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8297#(< ~counter~0 41)} is VALID [2022-04-27 14:36:31,163 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7766#true} {8297#(< ~counter~0 41)} #51#return; {8297#(< ~counter~0 41)} is VALID [2022-04-27 14:36:31,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {7766#true} assume true; {7766#true} is VALID [2022-04-27 14:36:31,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {7766#true} assume !(0 == ~cond); {7766#true} is VALID [2022-04-27 14:36:31,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {7766#true} ~cond := #in~cond; {7766#true} is VALID [2022-04-27 14:36:31,163 INFO L272 TraceCheckUtils]: 8: Hoare triple {8297#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7766#true} is VALID [2022-04-27 14:36:31,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {8297#(< ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {8297#(< ~counter~0 41)} is VALID [2022-04-27 14:36:31,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {8322#(< ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8297#(< ~counter~0 41)} is VALID [2022-04-27 14:36:31,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {8322#(< ~counter~0 40)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {8322#(< ~counter~0 40)} is VALID [2022-04-27 14:36:31,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {8322#(< ~counter~0 40)} call #t~ret6 := main(); {8322#(< ~counter~0 40)} is VALID [2022-04-27 14:36:31,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8322#(< ~counter~0 40)} {7766#true} #57#return; {8322#(< ~counter~0 40)} is VALID [2022-04-27 14:36:31,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {8322#(< ~counter~0 40)} assume true; {8322#(< ~counter~0 40)} is VALID [2022-04-27 14:36:31,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {7766#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8322#(< ~counter~0 40)} is VALID [2022-04-27 14:36:31,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {7766#true} call ULTIMATE.init(); {7766#true} is VALID [2022-04-27 14:36:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 14:36:31,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:31,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072840369] [2022-04-27 14:36:31,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:31,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795153536] [2022-04-27 14:36:31,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795153536] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:36:31,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:36:31,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-27 14:36:31,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410369930] [2022-04-27 14:36:31,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) Word has length 92 [2022-04-27 14:36:31,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:31,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:36:31,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:31,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 14:36:31,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:31,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 14:36:31,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:36:31,287 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:36:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:32,307 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2022-04-27 14:36:32,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 14:36:32,307 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) Word has length 92 [2022-04-27 14:36:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:36:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 249 transitions. [2022-04-27 14:36:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:36:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 249 transitions. [2022-04-27 14:36:32,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 249 transitions. [2022-04-27 14:36:32,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:32,593 INFO L225 Difference]: With dead ends: 249 [2022-04-27 14:36:32,593 INFO L226 Difference]: Without dead ends: 244 [2022-04-27 14:36:32,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 14:36:32,594 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 208 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:32,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 253 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:36:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-04-27 14:36:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 189. [2022-04-27 14:36:32,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:32,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:32,710 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:32,710 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:32,715 INFO L93 Difference]: Finished difference Result 244 states and 245 transitions. [2022-04-27 14:36:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 245 transitions. [2022-04-27 14:36:32,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:32,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:32,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 244 states. [2022-04-27 14:36:32,717 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 244 states. [2022-04-27 14:36:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:32,723 INFO L93 Difference]: Finished difference Result 244 states and 245 transitions. [2022-04-27 14:36:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 245 transitions. [2022-04-27 14:36:32,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:32,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:32,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:32,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2022-04-27 14:36:32,728 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 92 [2022-04-27 14:36:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:32,728 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2022-04-27 14:36:32,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:36:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2022-04-27 14:36:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-27 14:36:32,729 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:32,729 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:32,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:32,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 14:36:32,943 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:32,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:32,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2105665221, now seen corresponding path program 10 times [2022-04-27 14:36:32,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:32,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159414084] [2022-04-27 14:36:32,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:32,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:32,957 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:32,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812622545] [2022-04-27 14:36:32,957 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:36:32,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:32,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:32,958 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:32,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 14:36:34,167 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:36:34,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:34,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 14:36:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:34,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:34,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {9481#true} call ULTIMATE.init(); {9481#true} is VALID [2022-04-27 14:36:34,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {9481#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9481#true} is VALID [2022-04-27 14:36:34,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {9481#true} assume true; {9481#true} is VALID [2022-04-27 14:36:34,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9481#true} {9481#true} #57#return; {9481#true} is VALID [2022-04-27 14:36:34,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {9481#true} call #t~ret6 := main(); {9481#true} is VALID [2022-04-27 14:36:34,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {9481#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9501#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:34,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {9501#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9501#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:34,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {9501#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {9501#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:34,709 INFO L272 TraceCheckUtils]: 8: Hoare triple {9501#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9481#true} is VALID [2022-04-27 14:36:34,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {9481#true} ~cond := #in~cond; {9481#true} is VALID [2022-04-27 14:36:34,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {9481#true} assume !(0 == ~cond); {9481#true} is VALID [2022-04-27 14:36:34,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {9481#true} assume true; {9481#true} is VALID [2022-04-27 14:36:34,709 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9481#true} {9501#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {9501#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:34,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {9501#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9526#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:34,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {9526#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9526#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:34,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {9526#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {9526#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:34,710 INFO L272 TraceCheckUtils]: 16: Hoare triple {9526#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9481#true} is VALID [2022-04-27 14:36:34,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {9481#true} ~cond := #in~cond; {9481#true} is VALID [2022-04-27 14:36:34,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {9481#true} assume !(0 == ~cond); {9481#true} is VALID [2022-04-27 14:36:34,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {9481#true} assume true; {9481#true} is VALID [2022-04-27 14:36:34,711 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9481#true} {9526#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {9526#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:34,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {9526#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9551#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:36:34,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {9551#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9551#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:36:34,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {9551#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {9551#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:36:34,712 INFO L272 TraceCheckUtils]: 24: Hoare triple {9551#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9481#true} is VALID [2022-04-27 14:36:34,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {9481#true} ~cond := #in~cond; {9481#true} is VALID [2022-04-27 14:36:34,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {9481#true} assume !(0 == ~cond); {9481#true} is VALID [2022-04-27 14:36:34,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {9481#true} assume true; {9481#true} is VALID [2022-04-27 14:36:34,713 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9481#true} {9551#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #51#return; {9551#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:36:34,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {9551#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9576#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:36:34,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {9576#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9576#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:36:34,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {9576#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {9576#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:36:34,714 INFO L272 TraceCheckUtils]: 32: Hoare triple {9576#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9481#true} is VALID [2022-04-27 14:36:34,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {9481#true} ~cond := #in~cond; {9481#true} is VALID [2022-04-27 14:36:34,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {9481#true} assume !(0 == ~cond); {9481#true} is VALID [2022-04-27 14:36:34,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {9481#true} assume true; {9481#true} is VALID [2022-04-27 14:36:34,714 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9481#true} {9576#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #51#return; {9576#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:36:34,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {9576#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9601#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:36:34,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {9601#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9601#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:36:34,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {9601#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {9601#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:36:34,715 INFO L272 TraceCheckUtils]: 40: Hoare triple {9601#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9481#true} is VALID [2022-04-27 14:36:34,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {9481#true} ~cond := #in~cond; {9481#true} is VALID [2022-04-27 14:36:34,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {9481#true} assume !(0 == ~cond); {9481#true} is VALID [2022-04-27 14:36:34,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {9481#true} assume true; {9481#true} is VALID [2022-04-27 14:36:34,716 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9481#true} {9601#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #51#return; {9601#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:36:34,716 INFO L290 TraceCheckUtils]: 45: Hoare triple {9601#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9626#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:34,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {9626#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9626#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:34,717 INFO L290 TraceCheckUtils]: 47: Hoare triple {9626#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {9626#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:34,717 INFO L272 TraceCheckUtils]: 48: Hoare triple {9626#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9481#true} is VALID [2022-04-27 14:36:34,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {9481#true} ~cond := #in~cond; {9481#true} is VALID [2022-04-27 14:36:34,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {9481#true} assume !(0 == ~cond); {9481#true} is VALID [2022-04-27 14:36:34,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {9481#true} assume true; {9481#true} is VALID [2022-04-27 14:36:34,718 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9481#true} {9626#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {9626#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:36:34,718 INFO L290 TraceCheckUtils]: 53: Hoare triple {9626#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9651#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:34,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {9651#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9651#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:34,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {9651#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {9651#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:34,719 INFO L272 TraceCheckUtils]: 56: Hoare triple {9651#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9481#true} is VALID [2022-04-27 14:36:34,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {9481#true} ~cond := #in~cond; {9481#true} is VALID [2022-04-27 14:36:34,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {9481#true} assume !(0 == ~cond); {9481#true} is VALID [2022-04-27 14:36:34,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {9481#true} assume true; {9481#true} is VALID [2022-04-27 14:36:34,719 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9481#true} {9651#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #51#return; {9651#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:34,720 INFO L290 TraceCheckUtils]: 61: Hoare triple {9651#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9676#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:36:34,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {9676#(and (= 7 main_~y~0) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9676#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:36:34,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {9676#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(#t~post5 < 50);havoc #t~post5; {9676#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:36:34,720 INFO L272 TraceCheckUtils]: 64: Hoare triple {9676#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9481#true} is VALID [2022-04-27 14:36:34,721 INFO L290 TraceCheckUtils]: 65: Hoare triple {9481#true} ~cond := #in~cond; {9481#true} is VALID [2022-04-27 14:36:34,721 INFO L290 TraceCheckUtils]: 66: Hoare triple {9481#true} assume !(0 == ~cond); {9481#true} is VALID [2022-04-27 14:36:34,721 INFO L290 TraceCheckUtils]: 67: Hoare triple {9481#true} assume true; {9481#true} is VALID [2022-04-27 14:36:34,721 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9481#true} {9676#(and (= 7 main_~y~0) (= 7 main_~c~0))} #51#return; {9676#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:36:34,721 INFO L290 TraceCheckUtils]: 69: Hoare triple {9676#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9701#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:36:34,722 INFO L290 TraceCheckUtils]: 70: Hoare triple {9701#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9701#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:36:34,722 INFO L290 TraceCheckUtils]: 71: Hoare triple {9701#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {9701#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:36:34,722 INFO L272 TraceCheckUtils]: 72: Hoare triple {9701#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9481#true} is VALID [2022-04-27 14:36:34,722 INFO L290 TraceCheckUtils]: 73: Hoare triple {9481#true} ~cond := #in~cond; {9481#true} is VALID [2022-04-27 14:36:34,722 INFO L290 TraceCheckUtils]: 74: Hoare triple {9481#true} assume !(0 == ~cond); {9481#true} is VALID [2022-04-27 14:36:34,722 INFO L290 TraceCheckUtils]: 75: Hoare triple {9481#true} assume true; {9481#true} is VALID [2022-04-27 14:36:34,723 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9481#true} {9701#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #51#return; {9701#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:36:34,723 INFO L290 TraceCheckUtils]: 77: Hoare triple {9701#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9726#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:34,724 INFO L290 TraceCheckUtils]: 78: Hoare triple {9726#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9726#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:34,724 INFO L290 TraceCheckUtils]: 79: Hoare triple {9726#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {9726#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:34,724 INFO L272 TraceCheckUtils]: 80: Hoare triple {9726#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9481#true} is VALID [2022-04-27 14:36:34,724 INFO L290 TraceCheckUtils]: 81: Hoare triple {9481#true} ~cond := #in~cond; {9481#true} is VALID [2022-04-27 14:36:34,724 INFO L290 TraceCheckUtils]: 82: Hoare triple {9481#true} assume !(0 == ~cond); {9481#true} is VALID [2022-04-27 14:36:34,724 INFO L290 TraceCheckUtils]: 83: Hoare triple {9481#true} assume true; {9481#true} is VALID [2022-04-27 14:36:34,724 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {9481#true} {9726#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #51#return; {9726#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:34,725 INFO L290 TraceCheckUtils]: 85: Hoare triple {9726#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9751#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:34,726 INFO L290 TraceCheckUtils]: 86: Hoare triple {9751#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9751#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:34,726 INFO L290 TraceCheckUtils]: 87: Hoare triple {9751#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {9751#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:34,726 INFO L272 TraceCheckUtils]: 88: Hoare triple {9751#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9481#true} is VALID [2022-04-27 14:36:34,726 INFO L290 TraceCheckUtils]: 89: Hoare triple {9481#true} ~cond := #in~cond; {9481#true} is VALID [2022-04-27 14:36:34,726 INFO L290 TraceCheckUtils]: 90: Hoare triple {9481#true} assume !(0 == ~cond); {9481#true} is VALID [2022-04-27 14:36:34,726 INFO L290 TraceCheckUtils]: 91: Hoare triple {9481#true} assume true; {9481#true} is VALID [2022-04-27 14:36:34,727 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {9481#true} {9751#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #51#return; {9751#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:34,727 INFO L290 TraceCheckUtils]: 93: Hoare triple {9751#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {9776#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:36:34,728 INFO L272 TraceCheckUtils]: 94: Hoare triple {9776#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9780#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:34,728 INFO L290 TraceCheckUtils]: 95: Hoare triple {9780#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9784#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:34,729 INFO L290 TraceCheckUtils]: 96: Hoare triple {9784#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9482#false} is VALID [2022-04-27 14:36:34,729 INFO L290 TraceCheckUtils]: 97: Hoare triple {9482#false} assume !false; {9482#false} is VALID [2022-04-27 14:36:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 22 proven. 220 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 14:36:34,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:35,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:35,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159414084] [2022-04-27 14:36:35,040 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:35,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812622545] [2022-04-27 14:36:35,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812622545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:35,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:35,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 14:36:35,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908089929] [2022-04-27 14:36:35,041 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:35,042 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 98 [2022-04-27 14:36:35,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:35,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:35,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:35,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:36:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:35,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:36:35,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:36:35,108 INFO L87 Difference]: Start difference. First operand 189 states and 201 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:36,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:36,367 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2022-04-27 14:36:36,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:36:36,367 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 98 [2022-04-27 14:36:36,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-27 14:36:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-27 14:36:36,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 79 transitions. [2022-04-27 14:36:36,460 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 14:36:36,463 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:36:36,464 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:36:36,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:36:36,465 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:36,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 532 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 14:36:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:36:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:36:36,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:36,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:36,571 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:36,571 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:36,575 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2022-04-27 14:36:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2022-04-27 14:36:36,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:36,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:36,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:36:36,576 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:36:36,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:36,579 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2022-04-27 14:36:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2022-04-27 14:36:36,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:36,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:36,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:36,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 200 transitions. [2022-04-27 14:36:36,584 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 200 transitions. Word has length 98 [2022-04-27 14:36:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:36,584 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 200 transitions. [2022-04-27 14:36:36,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:36:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2022-04-27 14:36:36,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-27 14:36:36,585 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:36,586 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:36,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:36,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 14:36:36,791 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:36,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:36,792 INFO L85 PathProgramCache]: Analyzing trace with hash -65749816, now seen corresponding path program 11 times [2022-04-27 14:36:36,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:36,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947728383] [2022-04-27 14:36:36,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:36,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:36,834 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:36,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980909309] [2022-04-27 14:36:36,834 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:36:36,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:36,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:36,835 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:36,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 14:36:37,386 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-27 14:36:37,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:37,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-27 14:36:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:37,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:37,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {10748#true} call ULTIMATE.init(); {10748#true} is VALID [2022-04-27 14:36:37,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {10748#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10748#true} is VALID [2022-04-27 14:36:37,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10748#true} {10748#true} #57#return; {10748#true} is VALID [2022-04-27 14:36:37,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {10748#true} call #t~ret6 := main(); {10748#true} is VALID [2022-04-27 14:36:37,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {10748#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {10768#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:37,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {10768#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10768#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:37,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {10768#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {10768#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:37,960 INFO L272 TraceCheckUtils]: 8: Hoare triple {10768#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10748#true} is VALID [2022-04-27 14:36:37,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {10748#true} ~cond := #in~cond; {10748#true} is VALID [2022-04-27 14:36:37,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {10748#true} assume !(0 == ~cond); {10748#true} is VALID [2022-04-27 14:36:37,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,961 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10748#true} {10768#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {10768#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:37,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {10768#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10793#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:37,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {10793#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10793#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:37,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {10793#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {10793#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:37,962 INFO L272 TraceCheckUtils]: 16: Hoare triple {10793#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10748#true} is VALID [2022-04-27 14:36:37,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {10748#true} ~cond := #in~cond; {10748#true} is VALID [2022-04-27 14:36:37,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {10748#true} assume !(0 == ~cond); {10748#true} is VALID [2022-04-27 14:36:37,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,962 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10748#true} {10793#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {10793#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:37,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {10793#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10818#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:37,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {10818#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10818#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:37,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {10818#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {10818#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:37,967 INFO L272 TraceCheckUtils]: 24: Hoare triple {10818#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10748#true} is VALID [2022-04-27 14:36:37,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {10748#true} ~cond := #in~cond; {10748#true} is VALID [2022-04-27 14:36:37,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {10748#true} assume !(0 == ~cond); {10748#true} is VALID [2022-04-27 14:36:37,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,968 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10748#true} {10818#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {10818#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:36:37,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {10818#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10843#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:36:37,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {10843#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10843#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:36:37,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {10843#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {10843#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:36:37,969 INFO L272 TraceCheckUtils]: 32: Hoare triple {10843#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10748#true} is VALID [2022-04-27 14:36:37,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {10748#true} ~cond := #in~cond; {10748#true} is VALID [2022-04-27 14:36:37,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {10748#true} assume !(0 == ~cond); {10748#true} is VALID [2022-04-27 14:36:37,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,969 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10748#true} {10843#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #51#return; {10843#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:36:37,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {10843#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10868#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-27 14:36:37,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {10868#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10868#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-27 14:36:37,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {10868#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {10868#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-27 14:36:37,970 INFO L272 TraceCheckUtils]: 40: Hoare triple {10868#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10748#true} is VALID [2022-04-27 14:36:37,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {10748#true} ~cond := #in~cond; {10748#true} is VALID [2022-04-27 14:36:37,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {10748#true} assume !(0 == ~cond); {10748#true} is VALID [2022-04-27 14:36:37,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,971 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10748#true} {10868#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #51#return; {10868#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-27 14:36:37,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {10868#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10893#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:36:37,972 INFO L290 TraceCheckUtils]: 46: Hoare triple {10893#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10893#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:36:37,972 INFO L290 TraceCheckUtils]: 47: Hoare triple {10893#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 50);havoc #t~post5; {10893#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:36:37,972 INFO L272 TraceCheckUtils]: 48: Hoare triple {10893#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10748#true} is VALID [2022-04-27 14:36:37,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {10748#true} ~cond := #in~cond; {10748#true} is VALID [2022-04-27 14:36:37,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {10748#true} assume !(0 == ~cond); {10748#true} is VALID [2022-04-27 14:36:37,972 INFO L290 TraceCheckUtils]: 51: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,972 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10748#true} {10893#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} #51#return; {10893#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:36:37,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {10893#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10918#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:37,973 INFO L290 TraceCheckUtils]: 54: Hoare triple {10918#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10918#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:37,973 INFO L290 TraceCheckUtils]: 55: Hoare triple {10918#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {10918#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:37,974 INFO L272 TraceCheckUtils]: 56: Hoare triple {10918#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10748#true} is VALID [2022-04-27 14:36:37,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {10748#true} ~cond := #in~cond; {10748#true} is VALID [2022-04-27 14:36:37,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {10748#true} assume !(0 == ~cond); {10748#true} is VALID [2022-04-27 14:36:37,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,974 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10748#true} {10918#(and (= main_~y~0 6) (= main_~c~0 6))} #51#return; {10918#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:36:37,974 INFO L290 TraceCheckUtils]: 61: Hoare triple {10918#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10943#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:36:37,975 INFO L290 TraceCheckUtils]: 62: Hoare triple {10943#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10943#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:36:37,975 INFO L290 TraceCheckUtils]: 63: Hoare triple {10943#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 50);havoc #t~post5; {10943#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:36:37,975 INFO L272 TraceCheckUtils]: 64: Hoare triple {10943#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10748#true} is VALID [2022-04-27 14:36:37,975 INFO L290 TraceCheckUtils]: 65: Hoare triple {10748#true} ~cond := #in~cond; {10748#true} is VALID [2022-04-27 14:36:37,975 INFO L290 TraceCheckUtils]: 66: Hoare triple {10748#true} assume !(0 == ~cond); {10748#true} is VALID [2022-04-27 14:36:37,975 INFO L290 TraceCheckUtils]: 67: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,976 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10748#true} {10943#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #51#return; {10943#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:36:37,976 INFO L290 TraceCheckUtils]: 69: Hoare triple {10943#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10968#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 14:36:37,976 INFO L290 TraceCheckUtils]: 70: Hoare triple {10968#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10968#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 14:36:37,977 INFO L290 TraceCheckUtils]: 71: Hoare triple {10968#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !!(#t~post5 < 50);havoc #t~post5; {10968#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 14:36:37,977 INFO L272 TraceCheckUtils]: 72: Hoare triple {10968#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10748#true} is VALID [2022-04-27 14:36:37,977 INFO L290 TraceCheckUtils]: 73: Hoare triple {10748#true} ~cond := #in~cond; {10748#true} is VALID [2022-04-27 14:36:37,977 INFO L290 TraceCheckUtils]: 74: Hoare triple {10748#true} assume !(0 == ~cond); {10748#true} is VALID [2022-04-27 14:36:37,977 INFO L290 TraceCheckUtils]: 75: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,977 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10748#true} {10968#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #51#return; {10968#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 14:36:37,978 INFO L290 TraceCheckUtils]: 77: Hoare triple {10968#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10993#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:36:37,978 INFO L290 TraceCheckUtils]: 78: Hoare triple {10993#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10993#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:36:37,978 INFO L290 TraceCheckUtils]: 79: Hoare triple {10993#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(#t~post5 < 50);havoc #t~post5; {10993#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:36:37,978 INFO L272 TraceCheckUtils]: 80: Hoare triple {10993#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10748#true} is VALID [2022-04-27 14:36:37,978 INFO L290 TraceCheckUtils]: 81: Hoare triple {10748#true} ~cond := #in~cond; {10748#true} is VALID [2022-04-27 14:36:37,979 INFO L290 TraceCheckUtils]: 82: Hoare triple {10748#true} assume !(0 == ~cond); {10748#true} is VALID [2022-04-27 14:36:37,979 INFO L290 TraceCheckUtils]: 83: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,979 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {10748#true} {10993#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #51#return; {10993#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:36:37,979 INFO L290 TraceCheckUtils]: 85: Hoare triple {10993#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11018#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-27 14:36:37,980 INFO L290 TraceCheckUtils]: 86: Hoare triple {11018#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11018#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-27 14:36:37,980 INFO L290 TraceCheckUtils]: 87: Hoare triple {11018#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} assume !!(#t~post5 < 50);havoc #t~post5; {11018#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-27 14:36:37,980 INFO L272 TraceCheckUtils]: 88: Hoare triple {11018#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10748#true} is VALID [2022-04-27 14:36:37,980 INFO L290 TraceCheckUtils]: 89: Hoare triple {10748#true} ~cond := #in~cond; {10748#true} is VALID [2022-04-27 14:36:37,980 INFO L290 TraceCheckUtils]: 90: Hoare triple {10748#true} assume !(0 == ~cond); {10748#true} is VALID [2022-04-27 14:36:37,980 INFO L290 TraceCheckUtils]: 91: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,981 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {10748#true} {11018#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} #51#return; {11018#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-27 14:36:37,981 INFO L290 TraceCheckUtils]: 93: Hoare triple {11018#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11043#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:36:37,981 INFO L290 TraceCheckUtils]: 94: Hoare triple {11043#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11043#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:36:37,982 INFO L290 TraceCheckUtils]: 95: Hoare triple {11043#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !!(#t~post5 < 50);havoc #t~post5; {11043#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:36:37,982 INFO L272 TraceCheckUtils]: 96: Hoare triple {11043#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10748#true} is VALID [2022-04-27 14:36:37,982 INFO L290 TraceCheckUtils]: 97: Hoare triple {10748#true} ~cond := #in~cond; {10748#true} is VALID [2022-04-27 14:36:37,982 INFO L290 TraceCheckUtils]: 98: Hoare triple {10748#true} assume !(0 == ~cond); {10748#true} is VALID [2022-04-27 14:36:37,982 INFO L290 TraceCheckUtils]: 99: Hoare triple {10748#true} assume true; {10748#true} is VALID [2022-04-27 14:36:37,982 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {10748#true} {11043#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #51#return; {11043#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:36:37,983 INFO L290 TraceCheckUtils]: 101: Hoare triple {11043#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {11068#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-27 14:36:37,983 INFO L272 TraceCheckUtils]: 102: Hoare triple {11068#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11072#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:37,984 INFO L290 TraceCheckUtils]: 103: Hoare triple {11072#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11076#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:37,984 INFO L290 TraceCheckUtils]: 104: Hoare triple {11076#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10749#false} is VALID [2022-04-27 14:36:37,984 INFO L290 TraceCheckUtils]: 105: Hoare triple {10749#false} assume !false; {10749#false} is VALID [2022-04-27 14:36:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 24 proven. 264 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 14:36:37,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:38,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:38,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947728383] [2022-04-27 14:36:38,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:38,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980909309] [2022-04-27 14:36:38,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980909309] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:38,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:38,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-27 14:36:38,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656829265] [2022-04-27 14:36:38,293 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:38,293 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 106 [2022-04-27 14:36:38,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:38,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:38,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:38,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 14:36:38,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:38,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 14:36:38,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:36:38,354 INFO L87 Difference]: Start difference. First operand 189 states and 200 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:39,885 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2022-04-27 14:36:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:36:39,885 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 106 [2022-04-27 14:36:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-27 14:36:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-27 14:36:39,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 84 transitions. [2022-04-27 14:36:39,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:39,983 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:36:39,984 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:36:39,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:36:39,984 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:39,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 600 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 14:36:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:36:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:36:40,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:40,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:40,081 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:40,083 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:40,087 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2022-04-27 14:36:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2022-04-27 14:36:40,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:40,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:40,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:36:40,088 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:36:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:40,091 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2022-04-27 14:36:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2022-04-27 14:36:40,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:40,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:40,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:40,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 199 transitions. [2022-04-27 14:36:40,096 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 199 transitions. Word has length 106 [2022-04-27 14:36:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:40,097 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 199 transitions. [2022-04-27 14:36:40,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:36:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2022-04-27 14:36:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 14:36:40,098 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:40,098 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:40,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:40,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 14:36:40,303 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:40,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1170284597, now seen corresponding path program 12 times [2022-04-27 14:36:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:40,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808782391] [2022-04-27 14:36:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:40,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:40,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1762192396] [2022-04-27 14:36:40,326 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:36:40,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:40,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:40,327 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:40,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 14:36:40,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-27 14:36:40,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:40,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-27 14:36:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:40,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:41,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {12040#true} call ULTIMATE.init(); {12040#true} is VALID [2022-04-27 14:36:41,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {12040#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12040#true} is VALID [2022-04-27 14:36:41,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12040#true} {12040#true} #57#return; {12040#true} is VALID [2022-04-27 14:36:41,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {12040#true} call #t~ret6 := main(); {12040#true} is VALID [2022-04-27 14:36:41,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {12040#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {12060#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:41,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {12060#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12060#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:41,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {12060#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {12060#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:41,492 INFO L272 TraceCheckUtils]: 8: Hoare triple {12060#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,493 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12040#true} {12060#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {12060#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:41,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {12060#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12085#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:41,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {12085#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12085#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:41,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {12085#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {12085#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:41,494 INFO L272 TraceCheckUtils]: 16: Hoare triple {12085#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,494 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {12040#true} {12085#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {12085#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:36:41,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {12085#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12110#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:41,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {12110#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12110#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:41,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {12110#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 50);havoc #t~post5; {12110#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:41,495 INFO L272 TraceCheckUtils]: 24: Hoare triple {12110#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,496 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12040#true} {12110#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {12110#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:36:41,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {12110#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12135#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:41,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {12135#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12135#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:41,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {12135#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {12135#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:41,497 INFO L272 TraceCheckUtils]: 32: Hoare triple {12135#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,498 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12040#true} {12135#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {12135#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:36:41,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {12135#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12160#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:41,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {12160#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12160#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:41,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {12160#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {12160#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:41,499 INFO L272 TraceCheckUtils]: 40: Hoare triple {12160#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,499 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12040#true} {12160#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #51#return; {12160#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:36:41,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {12160#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12185#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:41,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {12185#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12185#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:41,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {12185#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {12185#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:41,500 INFO L272 TraceCheckUtils]: 48: Hoare triple {12185#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,500 INFO L290 TraceCheckUtils]: 50: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,501 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12040#true} {12185#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} #51#return; {12185#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:41,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {12185#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12210#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:36:41,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {12210#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12210#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:36:41,502 INFO L290 TraceCheckUtils]: 55: Hoare triple {12210#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !!(#t~post5 < 50);havoc #t~post5; {12210#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:36:41,502 INFO L272 TraceCheckUtils]: 56: Hoare triple {12210#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,502 INFO L290 TraceCheckUtils]: 58: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,502 INFO L290 TraceCheckUtils]: 59: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,503 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12040#true} {12210#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #51#return; {12210#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:36:41,503 INFO L290 TraceCheckUtils]: 61: Hoare triple {12210#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12235#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:36:41,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {12235#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12235#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:36:41,504 INFO L290 TraceCheckUtils]: 63: Hoare triple {12235#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {12235#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:36:41,504 INFO L272 TraceCheckUtils]: 64: Hoare triple {12235#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,504 INFO L290 TraceCheckUtils]: 65: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,504 INFO L290 TraceCheckUtils]: 66: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,504 INFO L290 TraceCheckUtils]: 67: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,504 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12040#true} {12235#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} #51#return; {12235#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:36:41,505 INFO L290 TraceCheckUtils]: 69: Hoare triple {12235#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12260#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:36:41,505 INFO L290 TraceCheckUtils]: 70: Hoare triple {12260#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12260#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:36:41,505 INFO L290 TraceCheckUtils]: 71: Hoare triple {12260#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(#t~post5 < 50);havoc #t~post5; {12260#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:36:41,505 INFO L272 TraceCheckUtils]: 72: Hoare triple {12260#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,505 INFO L290 TraceCheckUtils]: 73: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,505 INFO L290 TraceCheckUtils]: 74: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,505 INFO L290 TraceCheckUtils]: 75: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,506 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12040#true} {12260#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #51#return; {12260#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 14:36:41,506 INFO L290 TraceCheckUtils]: 77: Hoare triple {12260#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12285#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:36:41,507 INFO L290 TraceCheckUtils]: 78: Hoare triple {12285#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12285#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:36:41,507 INFO L290 TraceCheckUtils]: 79: Hoare triple {12285#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 50);havoc #t~post5; {12285#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:36:41,507 INFO L272 TraceCheckUtils]: 80: Hoare triple {12285#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,507 INFO L290 TraceCheckUtils]: 81: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,507 INFO L290 TraceCheckUtils]: 82: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,507 INFO L290 TraceCheckUtils]: 83: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,508 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {12040#true} {12285#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #51#return; {12285#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:36:41,508 INFO L290 TraceCheckUtils]: 85: Hoare triple {12285#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12310#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:41,508 INFO L290 TraceCheckUtils]: 86: Hoare triple {12310#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12310#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:41,509 INFO L290 TraceCheckUtils]: 87: Hoare triple {12310#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 50);havoc #t~post5; {12310#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:41,509 INFO L272 TraceCheckUtils]: 88: Hoare triple {12310#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,509 INFO L290 TraceCheckUtils]: 89: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,509 INFO L290 TraceCheckUtils]: 90: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,509 INFO L290 TraceCheckUtils]: 91: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,509 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {12040#true} {12310#(and (= main_~y~0 10) (= main_~c~0 10))} #51#return; {12310#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:36:41,510 INFO L290 TraceCheckUtils]: 93: Hoare triple {12310#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12335#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:36:41,510 INFO L290 TraceCheckUtils]: 94: Hoare triple {12335#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12335#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:36:41,510 INFO L290 TraceCheckUtils]: 95: Hoare triple {12335#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !!(#t~post5 < 50);havoc #t~post5; {12335#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:36:41,510 INFO L272 TraceCheckUtils]: 96: Hoare triple {12335#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,510 INFO L290 TraceCheckUtils]: 97: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,510 INFO L290 TraceCheckUtils]: 98: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,510 INFO L290 TraceCheckUtils]: 99: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,511 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {12040#true} {12335#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #51#return; {12335#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:36:41,511 INFO L290 TraceCheckUtils]: 101: Hoare triple {12335#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12360#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:36:41,512 INFO L290 TraceCheckUtils]: 102: Hoare triple {12360#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12360#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:36:41,512 INFO L290 TraceCheckUtils]: 103: Hoare triple {12360#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {12360#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:36:41,512 INFO L272 TraceCheckUtils]: 104: Hoare triple {12360#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12040#true} is VALID [2022-04-27 14:36:41,512 INFO L290 TraceCheckUtils]: 105: Hoare triple {12040#true} ~cond := #in~cond; {12040#true} is VALID [2022-04-27 14:36:41,512 INFO L290 TraceCheckUtils]: 106: Hoare triple {12040#true} assume !(0 == ~cond); {12040#true} is VALID [2022-04-27 14:36:41,512 INFO L290 TraceCheckUtils]: 107: Hoare triple {12040#true} assume true; {12040#true} is VALID [2022-04-27 14:36:41,513 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {12040#true} {12360#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #51#return; {12360#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:36:41,513 INFO L290 TraceCheckUtils]: 109: Hoare triple {12360#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {12385#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-27 14:36:41,514 INFO L272 TraceCheckUtils]: 110: Hoare triple {12385#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12389#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:41,514 INFO L290 TraceCheckUtils]: 111: Hoare triple {12389#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12393#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:41,514 INFO L290 TraceCheckUtils]: 112: Hoare triple {12393#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12041#false} is VALID [2022-04-27 14:36:41,514 INFO L290 TraceCheckUtils]: 113: Hoare triple {12041#false} assume !false; {12041#false} is VALID [2022-04-27 14:36:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 26 proven. 312 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 14:36:41,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:41,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808782391] [2022-04-27 14:36:41,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762192396] [2022-04-27 14:36:41,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762192396] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:41,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:41,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-27 14:36:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271542786] [2022-04-27 14:36:41,833 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:41,834 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 114 [2022-04-27 14:36:41,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:41,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:41,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:41,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 14:36:41,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:41,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 14:36:41,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:36:41,896 INFO L87 Difference]: Start difference. First operand 189 states and 199 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:43,670 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2022-04-27 14:36:43,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 14:36:43,670 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 114 [2022-04-27 14:36:43,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:43,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-27 14:36:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-27 14:36:43,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 89 transitions. [2022-04-27 14:36:43,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:43,779 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:36:43,779 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:36:43,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:36:43,780 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:43,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 672 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 14:36:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:36:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:36:43,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:43,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:43,893 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:43,893 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:43,896 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2022-04-27 14:36:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 198 transitions. [2022-04-27 14:36:43,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:43,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:43,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:36:43,897 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:36:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:43,902 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2022-04-27 14:36:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 198 transitions. [2022-04-27 14:36:43,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:43,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:43,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:43,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:36:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 198 transitions. [2022-04-27 14:36:43,908 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 198 transitions. Word has length 114 [2022-04-27 14:36:43,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:43,908 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 198 transitions. [2022-04-27 14:36:43,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:36:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 198 transitions. [2022-04-27 14:36:43,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-27 14:36:43,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:43,909 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:43,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:44,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:44,115 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:44,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:44,115 INFO L85 PathProgramCache]: Analyzing trace with hash -966570034, now seen corresponding path program 13 times [2022-04-27 14:36:44,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:44,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900466719] [2022-04-27 14:36:44,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:44,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:44,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:44,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765772987] [2022-04-27 14:36:44,129 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:36:44,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:44,131 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:36:44,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 14:36:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:45,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-27 14:36:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:45,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:45,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {13357#true} call ULTIMATE.init(); {13357#true} is VALID [2022-04-27 14:36:45,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {13357#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13357#true} is VALID [2022-04-27 14:36:45,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13357#true} {13357#true} #57#return; {13357#true} is VALID [2022-04-27 14:36:45,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {13357#true} call #t~ret6 := main(); {13357#true} is VALID [2022-04-27 14:36:45,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {13357#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {13377#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:45,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {13377#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13377#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:45,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {13377#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {13377#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:45,875 INFO L272 TraceCheckUtils]: 8: Hoare triple {13377#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,875 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13357#true} {13377#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {13377#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:45,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {13377#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13402#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:45,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {13402#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13402#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:45,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {13402#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {13402#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:45,876 INFO L272 TraceCheckUtils]: 16: Hoare triple {13402#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,877 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13357#true} {13402#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {13402#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:45,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {13402#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13427#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:36:45,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {13427#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13427#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:36:45,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {13427#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {13427#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:36:45,878 INFO L272 TraceCheckUtils]: 24: Hoare triple {13427#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,879 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13357#true} {13427#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #51#return; {13427#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:36:45,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {13427#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13452#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:36:45,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {13452#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13452#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:36:45,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {13452#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {13452#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:36:45,880 INFO L272 TraceCheckUtils]: 32: Hoare triple {13452#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,880 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13357#true} {13452#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #51#return; {13452#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-27 14:36:45,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {13452#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13477#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-27 14:36:45,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {13477#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13477#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-27 14:36:45,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {13477#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {13477#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-27 14:36:45,881 INFO L272 TraceCheckUtils]: 40: Hoare triple {13477#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,882 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13357#true} {13477#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #51#return; {13477#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-27 14:36:45,886 INFO L290 TraceCheckUtils]: 45: Hoare triple {13477#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13502#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-27 14:36:45,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {13502#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13502#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-27 14:36:45,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {13502#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !!(#t~post5 < 50);havoc #t~post5; {13502#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-27 14:36:45,887 INFO L272 TraceCheckUtils]: 48: Hoare triple {13502#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,887 INFO L290 TraceCheckUtils]: 50: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,887 INFO L290 TraceCheckUtils]: 51: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,888 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13357#true} {13502#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} #51#return; {13502#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-27 14:36:45,888 INFO L290 TraceCheckUtils]: 53: Hoare triple {13502#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13527#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-27 14:36:45,888 INFO L290 TraceCheckUtils]: 54: Hoare triple {13527#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 5)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13527#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-27 14:36:45,889 INFO L290 TraceCheckUtils]: 55: Hoare triple {13527#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 5)) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {13527#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-27 14:36:45,889 INFO L272 TraceCheckUtils]: 56: Hoare triple {13527#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 5)) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,889 INFO L290 TraceCheckUtils]: 57: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,889 INFO L290 TraceCheckUtils]: 58: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,889 INFO L290 TraceCheckUtils]: 59: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,889 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13357#true} {13527#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 5)) 1))} #51#return; {13527#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-27 14:36:45,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {13527#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 5)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13552#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 14:36:45,890 INFO L290 TraceCheckUtils]: 62: Hoare triple {13552#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13552#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 14:36:45,890 INFO L290 TraceCheckUtils]: 63: Hoare triple {13552#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {13552#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 14:36:45,890 INFO L272 TraceCheckUtils]: 64: Hoare triple {13552#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,890 INFO L290 TraceCheckUtils]: 65: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,890 INFO L290 TraceCheckUtils]: 66: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,891 INFO L290 TraceCheckUtils]: 67: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,891 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13357#true} {13552#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 6)) 1))} #51#return; {13552#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 14:36:45,891 INFO L290 TraceCheckUtils]: 69: Hoare triple {13552#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 6)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13577#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:36:45,892 INFO L290 TraceCheckUtils]: 70: Hoare triple {13577#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13577#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:36:45,892 INFO L290 TraceCheckUtils]: 71: Hoare triple {13577#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 50);havoc #t~post5; {13577#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:36:45,892 INFO L272 TraceCheckUtils]: 72: Hoare triple {13577#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,892 INFO L290 TraceCheckUtils]: 73: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,892 INFO L290 TraceCheckUtils]: 74: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,892 INFO L290 TraceCheckUtils]: 75: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,893 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13357#true} {13577#(and (= main_~y~0 8) (= main_~c~0 8))} #51#return; {13577#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:36:45,893 INFO L290 TraceCheckUtils]: 77: Hoare triple {13577#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13602#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:36:45,893 INFO L290 TraceCheckUtils]: 78: Hoare triple {13602#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13602#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:36:45,894 INFO L290 TraceCheckUtils]: 79: Hoare triple {13602#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 50);havoc #t~post5; {13602#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:36:45,894 INFO L272 TraceCheckUtils]: 80: Hoare triple {13602#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,894 INFO L290 TraceCheckUtils]: 81: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,894 INFO L290 TraceCheckUtils]: 82: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,894 INFO L290 TraceCheckUtils]: 83: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,894 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {13357#true} {13602#(and (= main_~y~0 9) (= main_~c~0 9))} #51#return; {13602#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:36:45,895 INFO L290 TraceCheckUtils]: 85: Hoare triple {13602#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13627#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:36:45,895 INFO L290 TraceCheckUtils]: 86: Hoare triple {13627#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13627#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:36:45,895 INFO L290 TraceCheckUtils]: 87: Hoare triple {13627#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(#t~post5 < 50);havoc #t~post5; {13627#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:36:45,895 INFO L272 TraceCheckUtils]: 88: Hoare triple {13627#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,895 INFO L290 TraceCheckUtils]: 89: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,895 INFO L290 TraceCheckUtils]: 90: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,895 INFO L290 TraceCheckUtils]: 91: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,896 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {13357#true} {13627#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #51#return; {13627#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:36:45,896 INFO L290 TraceCheckUtils]: 93: Hoare triple {13627#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13652#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:36:45,897 INFO L290 TraceCheckUtils]: 94: Hoare triple {13652#(and (= main_~c~0 11) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13652#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:36:45,897 INFO L290 TraceCheckUtils]: 95: Hoare triple {13652#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(#t~post5 < 50);havoc #t~post5; {13652#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:36:45,897 INFO L272 TraceCheckUtils]: 96: Hoare triple {13652#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,897 INFO L290 TraceCheckUtils]: 97: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,897 INFO L290 TraceCheckUtils]: 98: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,897 INFO L290 TraceCheckUtils]: 99: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,898 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {13357#true} {13652#(and (= main_~c~0 11) (= main_~y~0 11))} #51#return; {13652#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:36:45,898 INFO L290 TraceCheckUtils]: 101: Hoare triple {13652#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13677#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:36:45,898 INFO L290 TraceCheckUtils]: 102: Hoare triple {13677#(and (= main_~y~0 12) (= main_~c~0 12))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13677#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:36:45,899 INFO L290 TraceCheckUtils]: 103: Hoare triple {13677#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(#t~post5 < 50);havoc #t~post5; {13677#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:36:45,899 INFO L272 TraceCheckUtils]: 104: Hoare triple {13677#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,899 INFO L290 TraceCheckUtils]: 105: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-04-27 14:36:45,899 INFO L290 TraceCheckUtils]: 106: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-04-27 14:36:45,900 INFO L290 TraceCheckUtils]: 107: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-04-27 14:36:45,900 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13357#true} {13677#(and (= main_~y~0 12) (= main_~c~0 12))} #51#return; {13677#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:36:45,901 INFO L290 TraceCheckUtils]: 109: Hoare triple {13677#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13702#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:36:45,901 INFO L290 TraceCheckUtils]: 110: Hoare triple {13702#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13702#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:36:45,902 INFO L290 TraceCheckUtils]: 111: Hoare triple {13702#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !!(#t~post5 < 50);havoc #t~post5; {13702#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:36:45,902 INFO L272 TraceCheckUtils]: 112: Hoare triple {13702#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13357#true} is VALID [2022-04-27 14:36:45,902 INFO L290 TraceCheckUtils]: 113: Hoare triple {13357#true} ~cond := #in~cond; {13715#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:45,902 INFO L290 TraceCheckUtils]: 114: Hoare triple {13715#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13719#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:45,903 INFO L290 TraceCheckUtils]: 115: Hoare triple {13719#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13719#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:45,904 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13719#(not (= |__VERIFIER_assert_#in~cond| 0))} {13702#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #51#return; {13702#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:36:45,904 INFO L290 TraceCheckUtils]: 117: Hoare triple {13702#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {13729#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:36:45,905 INFO L272 TraceCheckUtils]: 118: Hoare triple {13729#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13733#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:45,906 INFO L290 TraceCheckUtils]: 119: Hoare triple {13733#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13737#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:45,906 INFO L290 TraceCheckUtils]: 120: Hoare triple {13737#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13358#false} is VALID [2022-04-27 14:36:45,906 INFO L290 TraceCheckUtils]: 121: Hoare triple {13358#false} assume !false; {13358#false} is VALID [2022-04-27 14:36:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 66 proven. 365 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-27 14:36:45,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:04,312 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) is different from false [2022-04-27 14:37:06,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:06,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900466719] [2022-04-27 14:37:06,384 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:06,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765772987] [2022-04-27 14:37:06,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765772987] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:06,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:06,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-27 14:37:06,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779619646] [2022-04-27 14:37:06,384 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:06,385 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 122 [2022-04-27 14:37:06,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:06,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:06,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:06,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 14:37:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:06,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 14:37:06,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=539, Unknown=1, NotChecked=46, Total=650 [2022-04-27 14:37:06,473 INFO L87 Difference]: Start difference. First operand 189 states and 198 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:08,732 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2022-04-27 14:37:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 14:37:08,733 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 122 [2022-04-27 14:37:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-27 14:37:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-27 14:37:08,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 94 transitions. [2022-04-27 14:37:08,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:08,820 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:37:08,820 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:37:08,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=84, Invalid=675, Unknown=1, NotChecked=52, Total=812 [2022-04-27 14:37:08,822 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:08,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 689 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 14:37:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:37:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:37:08,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:08,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:08,918 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:08,918 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:08,921 INFO L93 Difference]: Finished difference Result 189 states and 197 transitions. [2022-04-27 14:37:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2022-04-27 14:37:08,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:08,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:08,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:08,923 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:08,926 INFO L93 Difference]: Finished difference Result 189 states and 197 transitions. [2022-04-27 14:37:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2022-04-27 14:37:08,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:08,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:08,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:08,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 197 transitions. [2022-04-27 14:37:08,931 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 197 transitions. Word has length 122 [2022-04-27 14:37:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:08,931 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 197 transitions. [2022-04-27 14:37:08,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2022-04-27 14:37:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-27 14:37:08,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:08,933 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:08,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:09,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:09,139 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:09,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:09,140 INFO L85 PathProgramCache]: Analyzing trace with hash 467995857, now seen corresponding path program 14 times [2022-04-27 14:37:09,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:09,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371311209] [2022-04-27 14:37:09,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:09,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:09,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:09,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1882240934] [2022-04-27 14:37:09,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:37:09,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:09,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:09,181 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:09,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-27 14:37:10,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:37:10,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:10,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-27 14:37:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:10,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:10,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {14705#true} call ULTIMATE.init(); {14705#true} is VALID [2022-04-27 14:37:10,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {14705#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14705#true} is VALID [2022-04-27 14:37:10,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14705#true} {14705#true} #57#return; {14705#true} is VALID [2022-04-27 14:37:10,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {14705#true} call #t~ret6 := main(); {14705#true} is VALID [2022-04-27 14:37:10,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {14705#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {14725#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:10,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {14725#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14725#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:10,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {14725#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {14725#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:10,765 INFO L272 TraceCheckUtils]: 8: Hoare triple {14725#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,766 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14705#true} {14725#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {14725#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:10,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {14725#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14750#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:10,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {14750#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14750#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:10,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {14750#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {14750#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:10,767 INFO L272 TraceCheckUtils]: 16: Hoare triple {14750#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,767 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14705#true} {14750#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {14750#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:10,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {14750#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14775#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:10,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {14775#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14775#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:10,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {14775#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {14775#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:10,768 INFO L272 TraceCheckUtils]: 24: Hoare triple {14775#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,769 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {14705#true} {14775#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {14775#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:10,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {14775#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14800#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:10,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {14800#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14800#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:10,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {14800#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {14800#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:10,770 INFO L272 TraceCheckUtils]: 32: Hoare triple {14800#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,770 INFO L290 TraceCheckUtils]: 35: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,771 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14705#true} {14800#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {14800#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:10,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {14800#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14825#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:10,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {14825#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14825#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:10,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {14825#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {14825#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:10,772 INFO L272 TraceCheckUtils]: 40: Hoare triple {14825#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,772 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14705#true} {14825#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #51#return; {14825#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:10,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {14825#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14850#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:10,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {14850#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14850#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:10,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {14850#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {14850#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:10,773 INFO L272 TraceCheckUtils]: 48: Hoare triple {14850#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,774 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14705#true} {14850#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #51#return; {14850#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:10,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {14850#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14875#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:10,775 INFO L290 TraceCheckUtils]: 54: Hoare triple {14875#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14875#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:10,775 INFO L290 TraceCheckUtils]: 55: Hoare triple {14875#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {14875#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:10,775 INFO L272 TraceCheckUtils]: 56: Hoare triple {14875#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,775 INFO L290 TraceCheckUtils]: 57: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,775 INFO L290 TraceCheckUtils]: 58: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,776 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14705#true} {14875#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #51#return; {14875#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:10,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {14875#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14900#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:37:10,776 INFO L290 TraceCheckUtils]: 62: Hoare triple {14900#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14900#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:37:10,777 INFO L290 TraceCheckUtils]: 63: Hoare triple {14900#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 50);havoc #t~post5; {14900#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:37:10,777 INFO L272 TraceCheckUtils]: 64: Hoare triple {14900#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,777 INFO L290 TraceCheckUtils]: 66: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,777 INFO L290 TraceCheckUtils]: 67: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,777 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14705#true} {14900#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #51#return; {14900#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:37:10,778 INFO L290 TraceCheckUtils]: 69: Hoare triple {14900#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14925#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:10,778 INFO L290 TraceCheckUtils]: 70: Hoare triple {14925#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14925#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:10,778 INFO L290 TraceCheckUtils]: 71: Hoare triple {14925#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {14925#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:10,778 INFO L272 TraceCheckUtils]: 72: Hoare triple {14925#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,778 INFO L290 TraceCheckUtils]: 73: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,778 INFO L290 TraceCheckUtils]: 74: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,778 INFO L290 TraceCheckUtils]: 75: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,779 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14705#true} {14925#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #51#return; {14925#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:10,779 INFO L290 TraceCheckUtils]: 77: Hoare triple {14925#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14950#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:10,780 INFO L290 TraceCheckUtils]: 78: Hoare triple {14950#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14950#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:10,780 INFO L290 TraceCheckUtils]: 79: Hoare triple {14950#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 50);havoc #t~post5; {14950#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:10,780 INFO L272 TraceCheckUtils]: 80: Hoare triple {14950#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,780 INFO L290 TraceCheckUtils]: 81: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,780 INFO L290 TraceCheckUtils]: 82: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,780 INFO L290 TraceCheckUtils]: 83: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,780 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {14705#true} {14950#(and (= main_~y~0 9) (= main_~c~0 9))} #51#return; {14950#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:37:10,781 INFO L290 TraceCheckUtils]: 85: Hoare triple {14950#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14975#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:37:10,781 INFO L290 TraceCheckUtils]: 86: Hoare triple {14975#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14975#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:37:10,781 INFO L290 TraceCheckUtils]: 87: Hoare triple {14975#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 50);havoc #t~post5; {14975#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:37:10,782 INFO L272 TraceCheckUtils]: 88: Hoare triple {14975#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,782 INFO L290 TraceCheckUtils]: 89: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,782 INFO L290 TraceCheckUtils]: 90: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,782 INFO L290 TraceCheckUtils]: 91: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,782 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14705#true} {14975#(and (= main_~y~0 10) (= main_~c~0 10))} #51#return; {14975#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:37:10,782 INFO L290 TraceCheckUtils]: 93: Hoare triple {14975#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:37:10,783 INFO L290 TraceCheckUtils]: 94: Hoare triple {15000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:37:10,783 INFO L290 TraceCheckUtils]: 95: Hoare triple {15000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !!(#t~post5 < 50);havoc #t~post5; {15000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:37:10,783 INFO L272 TraceCheckUtils]: 96: Hoare triple {15000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,783 INFO L290 TraceCheckUtils]: 97: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,783 INFO L290 TraceCheckUtils]: 98: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,783 INFO L290 TraceCheckUtils]: 99: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,784 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {14705#true} {15000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #51#return; {15000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:37:10,784 INFO L290 TraceCheckUtils]: 101: Hoare triple {15000#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15025#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:10,784 INFO L290 TraceCheckUtils]: 102: Hoare triple {15025#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15025#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:10,785 INFO L290 TraceCheckUtils]: 103: Hoare triple {15025#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {15025#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:10,785 INFO L272 TraceCheckUtils]: 104: Hoare triple {15025#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,785 INFO L290 TraceCheckUtils]: 105: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,785 INFO L290 TraceCheckUtils]: 106: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,785 INFO L290 TraceCheckUtils]: 107: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,785 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {14705#true} {15025#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} #51#return; {15025#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:10,786 INFO L290 TraceCheckUtils]: 109: Hoare triple {15025#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15050#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:10,786 INFO L290 TraceCheckUtils]: 110: Hoare triple {15050#(and (= main_~c~0 13) (= main_~y~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15050#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:10,786 INFO L290 TraceCheckUtils]: 111: Hoare triple {15050#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(#t~post5 < 50);havoc #t~post5; {15050#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:10,786 INFO L272 TraceCheckUtils]: 112: Hoare triple {15050#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,787 INFO L290 TraceCheckUtils]: 113: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,787 INFO L290 TraceCheckUtils]: 114: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,787 INFO L290 TraceCheckUtils]: 115: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,787 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {14705#true} {15050#(and (= main_~c~0 13) (= main_~y~0 13))} #51#return; {15050#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:37:10,787 INFO L290 TraceCheckUtils]: 117: Hoare triple {15050#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15075#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:37:10,788 INFO L290 TraceCheckUtils]: 118: Hoare triple {15075#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15075#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:37:10,788 INFO L290 TraceCheckUtils]: 119: Hoare triple {15075#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !!(#t~post5 < 50);havoc #t~post5; {15075#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:37:10,788 INFO L272 TraceCheckUtils]: 120: Hoare triple {15075#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14705#true} is VALID [2022-04-27 14:37:10,788 INFO L290 TraceCheckUtils]: 121: Hoare triple {14705#true} ~cond := #in~cond; {14705#true} is VALID [2022-04-27 14:37:10,788 INFO L290 TraceCheckUtils]: 122: Hoare triple {14705#true} assume !(0 == ~cond); {14705#true} is VALID [2022-04-27 14:37:10,788 INFO L290 TraceCheckUtils]: 123: Hoare triple {14705#true} assume true; {14705#true} is VALID [2022-04-27 14:37:10,789 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {14705#true} {15075#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #51#return; {15075#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:37:10,790 INFO L290 TraceCheckUtils]: 125: Hoare triple {15075#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {15100#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-27 14:37:10,790 INFO L272 TraceCheckUtils]: 126: Hoare triple {15100#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15104#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:10,791 INFO L290 TraceCheckUtils]: 127: Hoare triple {15104#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15108#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:10,791 INFO L290 TraceCheckUtils]: 128: Hoare triple {15108#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14706#false} is VALID [2022-04-27 14:37:10,791 INFO L290 TraceCheckUtils]: 129: Hoare triple {14706#false} assume !false; {14706#false} is VALID [2022-04-27 14:37:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 30 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-27 14:37:10,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:11,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371311209] [2022-04-27 14:37:11,177 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:11,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882240934] [2022-04-27 14:37:11,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882240934] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:11,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:11,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-27 14:37:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258036357] [2022-04-27 14:37:11,177 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:11,178 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 130 [2022-04-27 14:37:11,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:11,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:37:11,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:11,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 14:37:11,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:11,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 14:37:11,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:37:11,258 INFO L87 Difference]: Start difference. First operand 189 states and 197 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:37:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:13,637 INFO L93 Difference]: Finished difference Result 194 states and 201 transitions. [2022-04-27 14:37:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 14:37:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 130 [2022-04-27 14:37:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:37:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-04-27 14:37:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:37:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-04-27 14:37:13,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 99 transitions. [2022-04-27 14:37:13,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:13,756 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:37:13,756 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:37:13,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-27 14:37:13,757 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:13,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 828 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 14:37:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:37:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:37:13,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:13,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:13,870 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:13,870 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:13,874 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2022-04-27 14:37:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2022-04-27 14:37:13,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:13,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:13,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:13,875 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:13,878 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2022-04-27 14:37:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2022-04-27 14:37:13,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:13,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:13,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:13,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 196 transitions. [2022-04-27 14:37:13,882 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 196 transitions. Word has length 130 [2022-04-27 14:37:13,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:13,883 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 196 transitions. [2022-04-27 14:37:13,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:37:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2022-04-27 14:37:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-27 14:37:13,884 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:13,884 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:13,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-27 14:37:14,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-27 14:37:14,089 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1557719340, now seen corresponding path program 15 times [2022-04-27 14:37:14,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:14,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976678073] [2022-04-27 14:37:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:14,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:14,108 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:14,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [816403815] [2022-04-27 14:37:14,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:37:14,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:14,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:14,109 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:14,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-27 14:37:14,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-04-27 14:37:14,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:14,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-27 14:37:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:14,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:15,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {16072#true} call ULTIMATE.init(); {16072#true} is VALID [2022-04-27 14:37:15,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {16072#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16072#true} is VALID [2022-04-27 14:37:15,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16072#true} {16072#true} #57#return; {16072#true} is VALID [2022-04-27 14:37:15,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {16072#true} call #t~ret6 := main(); {16072#true} is VALID [2022-04-27 14:37:15,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {16072#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {16092#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:15,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {16092#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16092#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:15,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {16092#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {16092#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:15,595 INFO L272 TraceCheckUtils]: 8: Hoare triple {16092#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,595 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16072#true} {16092#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {16092#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:15,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {16092#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16117#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:15,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {16117#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16117#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:15,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {16117#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {16117#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:15,597 INFO L272 TraceCheckUtils]: 16: Hoare triple {16117#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,597 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16072#true} {16117#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {16117#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:15,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {16117#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16142#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:37:15,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {16142#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16142#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:37:15,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {16142#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {16142#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:37:15,599 INFO L272 TraceCheckUtils]: 24: Hoare triple {16142#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,599 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16072#true} {16142#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {16142#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:37:15,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {16142#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16167#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:37:15,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {16167#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16167#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:37:15,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {16167#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {16167#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:37:15,601 INFO L272 TraceCheckUtils]: 32: Hoare triple {16167#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,602 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16072#true} {16167#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #51#return; {16167#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:37:15,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {16167#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16192#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:37:15,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {16192#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16192#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:37:15,603 INFO L290 TraceCheckUtils]: 39: Hoare triple {16192#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 50);havoc #t~post5; {16192#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:37:15,603 INFO L272 TraceCheckUtils]: 40: Hoare triple {16192#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,603 INFO L290 TraceCheckUtils]: 42: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,604 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16072#true} {16192#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #51#return; {16192#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:37:15,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {16192#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16217#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:15,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {16217#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16217#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:15,605 INFO L290 TraceCheckUtils]: 47: Hoare triple {16217#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {16217#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:15,605 INFO L272 TraceCheckUtils]: 48: Hoare triple {16217#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,606 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16072#true} {16217#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} #51#return; {16217#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:15,606 INFO L290 TraceCheckUtils]: 53: Hoare triple {16217#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16242#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:15,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {16242#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16242#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:15,607 INFO L290 TraceCheckUtils]: 55: Hoare triple {16242#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {16242#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:15,607 INFO L272 TraceCheckUtils]: 56: Hoare triple {16242#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,607 INFO L290 TraceCheckUtils]: 57: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,607 INFO L290 TraceCheckUtils]: 58: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,607 INFO L290 TraceCheckUtils]: 59: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,608 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16072#true} {16242#(and (= main_~y~0 6) (= main_~c~0 6))} #51#return; {16242#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:15,608 INFO L290 TraceCheckUtils]: 61: Hoare triple {16242#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16267#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:15,609 INFO L290 TraceCheckUtils]: 62: Hoare triple {16267#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16267#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:15,609 INFO L290 TraceCheckUtils]: 63: Hoare triple {16267#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {16267#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:15,609 INFO L272 TraceCheckUtils]: 64: Hoare triple {16267#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,609 INFO L290 TraceCheckUtils]: 65: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,610 INFO L290 TraceCheckUtils]: 66: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,610 INFO L290 TraceCheckUtils]: 67: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,610 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16072#true} {16267#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #51#return; {16267#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:15,611 INFO L290 TraceCheckUtils]: 69: Hoare triple {16267#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16292#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:37:15,611 INFO L290 TraceCheckUtils]: 70: Hoare triple {16292#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16292#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:37:15,611 INFO L290 TraceCheckUtils]: 71: Hoare triple {16292#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(#t~post5 < 50);havoc #t~post5; {16292#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:37:15,612 INFO L272 TraceCheckUtils]: 72: Hoare triple {16292#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,612 INFO L290 TraceCheckUtils]: 73: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,612 INFO L290 TraceCheckUtils]: 74: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,612 INFO L290 TraceCheckUtils]: 75: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,612 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16072#true} {16292#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #51#return; {16292#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:37:15,613 INFO L290 TraceCheckUtils]: 77: Hoare triple {16292#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16317#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:15,613 INFO L290 TraceCheckUtils]: 78: Hoare triple {16317#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16317#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:15,614 INFO L290 TraceCheckUtils]: 79: Hoare triple {16317#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {16317#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:15,614 INFO L272 TraceCheckUtils]: 80: Hoare triple {16317#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,614 INFO L290 TraceCheckUtils]: 81: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,614 INFO L290 TraceCheckUtils]: 82: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,614 INFO L290 TraceCheckUtils]: 83: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,614 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {16072#true} {16317#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} #51#return; {16317#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:15,615 INFO L290 TraceCheckUtils]: 85: Hoare triple {16317#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16342#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:37:15,615 INFO L290 TraceCheckUtils]: 86: Hoare triple {16342#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16342#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:37:15,616 INFO L290 TraceCheckUtils]: 87: Hoare triple {16342#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} assume !!(#t~post5 < 50);havoc #t~post5; {16342#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:37:15,616 INFO L272 TraceCheckUtils]: 88: Hoare triple {16342#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,616 INFO L290 TraceCheckUtils]: 89: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,616 INFO L290 TraceCheckUtils]: 90: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,616 INFO L290 TraceCheckUtils]: 91: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,617 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {16072#true} {16342#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} #51#return; {16342#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:37:15,617 INFO L290 TraceCheckUtils]: 93: Hoare triple {16342#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16367#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:37:15,618 INFO L290 TraceCheckUtils]: 94: Hoare triple {16367#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16367#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:37:15,618 INFO L290 TraceCheckUtils]: 95: Hoare triple {16367#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} assume !!(#t~post5 < 50);havoc #t~post5; {16367#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:37:15,618 INFO L272 TraceCheckUtils]: 96: Hoare triple {16367#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,618 INFO L290 TraceCheckUtils]: 97: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,618 INFO L290 TraceCheckUtils]: 98: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,618 INFO L290 TraceCheckUtils]: 99: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,619 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {16072#true} {16367#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} #51#return; {16367#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:37:15,619 INFO L290 TraceCheckUtils]: 101: Hoare triple {16367#(and (= main_~y~0 11) (= 7 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16392#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:37:15,620 INFO L290 TraceCheckUtils]: 102: Hoare triple {16392#(and (= main_~y~0 12) (= main_~c~0 12))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16392#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:37:15,620 INFO L290 TraceCheckUtils]: 103: Hoare triple {16392#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(#t~post5 < 50);havoc #t~post5; {16392#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:37:15,620 INFO L272 TraceCheckUtils]: 104: Hoare triple {16392#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,620 INFO L290 TraceCheckUtils]: 105: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,620 INFO L290 TraceCheckUtils]: 106: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,620 INFO L290 TraceCheckUtils]: 107: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,621 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16072#true} {16392#(and (= main_~y~0 12) (= main_~c~0 12))} #51#return; {16392#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:37:15,621 INFO L290 TraceCheckUtils]: 109: Hoare triple {16392#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16417#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:37:15,622 INFO L290 TraceCheckUtils]: 110: Hoare triple {16417#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16417#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:37:15,622 INFO L290 TraceCheckUtils]: 111: Hoare triple {16417#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !!(#t~post5 < 50);havoc #t~post5; {16417#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:37:15,622 INFO L272 TraceCheckUtils]: 112: Hoare triple {16417#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,622 INFO L290 TraceCheckUtils]: 113: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,622 INFO L290 TraceCheckUtils]: 114: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,622 INFO L290 TraceCheckUtils]: 115: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,623 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {16072#true} {16417#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #51#return; {16417#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:37:15,623 INFO L290 TraceCheckUtils]: 117: Hoare triple {16417#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16442#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:15,624 INFO L290 TraceCheckUtils]: 118: Hoare triple {16442#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16442#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:15,624 INFO L290 TraceCheckUtils]: 119: Hoare triple {16442#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {16442#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:15,624 INFO L272 TraceCheckUtils]: 120: Hoare triple {16442#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,625 INFO L290 TraceCheckUtils]: 121: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,625 INFO L290 TraceCheckUtils]: 122: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,625 INFO L290 TraceCheckUtils]: 123: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,625 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16072#true} {16442#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} #51#return; {16442#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:15,626 INFO L290 TraceCheckUtils]: 125: Hoare triple {16442#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16467#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:37:15,626 INFO L290 TraceCheckUtils]: 126: Hoare triple {16467#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16467#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:37:15,627 INFO L290 TraceCheckUtils]: 127: Hoare triple {16467#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !!(#t~post5 < 50);havoc #t~post5; {16467#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:37:15,627 INFO L272 TraceCheckUtils]: 128: Hoare triple {16467#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16072#true} is VALID [2022-04-27 14:37:15,627 INFO L290 TraceCheckUtils]: 129: Hoare triple {16072#true} ~cond := #in~cond; {16072#true} is VALID [2022-04-27 14:37:15,627 INFO L290 TraceCheckUtils]: 130: Hoare triple {16072#true} assume !(0 == ~cond); {16072#true} is VALID [2022-04-27 14:37:15,627 INFO L290 TraceCheckUtils]: 131: Hoare triple {16072#true} assume true; {16072#true} is VALID [2022-04-27 14:37:15,627 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {16072#true} {16467#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} #51#return; {16467#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:37:15,628 INFO L290 TraceCheckUtils]: 133: Hoare triple {16467#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {16492#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-27 14:37:15,629 INFO L272 TraceCheckUtils]: 134: Hoare triple {16492#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16496#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:15,629 INFO L290 TraceCheckUtils]: 135: Hoare triple {16496#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16500#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:15,630 INFO L290 TraceCheckUtils]: 136: Hoare triple {16500#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16073#false} is VALID [2022-04-27 14:37:15,630 INFO L290 TraceCheckUtils]: 137: Hoare triple {16073#false} assume !false; {16073#false} is VALID [2022-04-27 14:37:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 32 proven. 480 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-27 14:37:15,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:15,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:15,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976678073] [2022-04-27 14:37:15,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:15,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816403815] [2022-04-27 14:37:15,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816403815] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:15,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:15,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-27 14:37:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335768502] [2022-04-27 14:37:15,916 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:15,916 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 138 [2022-04-27 14:37:15,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:15,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:37:15,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:15,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 14:37:15,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:15,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 14:37:15,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:37:15,997 INFO L87 Difference]: Start difference. First operand 189 states and 196 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:37:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:18,566 INFO L93 Difference]: Finished difference Result 194 states and 200 transitions. [2022-04-27 14:37:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 14:37:18,566 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 138 [2022-04-27 14:37:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:37:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 104 transitions. [2022-04-27 14:37:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:37:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 104 transitions. [2022-04-27 14:37:18,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 104 transitions. [2022-04-27 14:37:18,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:18,713 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:37:18,713 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:37:18,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:37:18,714 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:18,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 912 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 14:37:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:37:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:37:18,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:18,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:18,828 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:18,828 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:18,831 INFO L93 Difference]: Finished difference Result 189 states and 195 transitions. [2022-04-27 14:37:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2022-04-27 14:37:18,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:18,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:18,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:18,832 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:18,835 INFO L93 Difference]: Finished difference Result 189 states and 195 transitions. [2022-04-27 14:37:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2022-04-27 14:37:18,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:18,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:18,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:18,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 195 transitions. [2022-04-27 14:37:18,842 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 195 transitions. Word has length 138 [2022-04-27 14:37:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:18,842 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 195 transitions. [2022-04-27 14:37:18,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:37:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2022-04-27 14:37:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-27 14:37:18,843 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:18,843 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:18,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:19,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-27 14:37:19,050 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:19,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:19,050 INFO L85 PathProgramCache]: Analyzing trace with hash 831286743, now seen corresponding path program 16 times [2022-04-27 14:37:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:19,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912217542] [2022-04-27 14:37:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:19,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:19,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:19,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1555942273] [2022-04-27 14:37:19,072 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:37:19,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:19,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:19,073 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:19,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-27 14:37:20,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:37:20,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:20,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-27 14:37:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:20,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:20,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {17464#true} call ULTIMATE.init(); {17464#true} is VALID [2022-04-27 14:37:20,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {17464#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17464#true} is VALID [2022-04-27 14:37:20,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17464#true} {17464#true} #57#return; {17464#true} is VALID [2022-04-27 14:37:20,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {17464#true} call #t~ret6 := main(); {17464#true} is VALID [2022-04-27 14:37:20,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {17464#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {17484#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:20,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {17484#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17484#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:20,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {17484#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {17484#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:20,955 INFO L272 TraceCheckUtils]: 8: Hoare triple {17484#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,956 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17464#true} {17484#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {17484#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:20,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {17484#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17509#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:20,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {17509#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17509#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:20,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {17509#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {17509#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:20,957 INFO L272 TraceCheckUtils]: 16: Hoare triple {17509#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,957 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17464#true} {17509#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {17509#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:20,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {17509#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17534#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:20,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {17534#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17534#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:20,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {17534#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {17534#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:20,958 INFO L272 TraceCheckUtils]: 24: Hoare triple {17534#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,959 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {17464#true} {17534#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #51#return; {17534#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:20,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {17534#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17559#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:37:20,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {17559#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17559#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:37:20,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {17559#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {17559#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:37:20,960 INFO L272 TraceCheckUtils]: 32: Hoare triple {17559#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,961 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {17464#true} {17559#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #51#return; {17559#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 14:37:20,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {17559#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17584#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 14:37:20,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {17584#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17584#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 14:37:20,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {17584#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {17584#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 14:37:20,962 INFO L272 TraceCheckUtils]: 40: Hoare triple {17584#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,962 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17464#true} {17584#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #51#return; {17584#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 14:37:20,963 INFO L290 TraceCheckUtils]: 45: Hoare triple {17584#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17609#(and (= (+ main_~y~0 (- 5)) 0) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:37:20,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {17609#(and (= (+ main_~y~0 (- 5)) 0) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17609#(and (= (+ main_~y~0 (- 5)) 0) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:37:20,963 INFO L290 TraceCheckUtils]: 47: Hoare triple {17609#(and (= (+ main_~y~0 (- 5)) 0) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 50);havoc #t~post5; {17609#(and (= (+ main_~y~0 (- 5)) 0) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:37:20,963 INFO L272 TraceCheckUtils]: 48: Hoare triple {17609#(and (= (+ main_~y~0 (- 5)) 0) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,964 INFO L290 TraceCheckUtils]: 50: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,964 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17464#true} {17609#(and (= (+ main_~y~0 (- 5)) 0) (= (+ (- 1) main_~c~0) 4))} #51#return; {17609#(and (= (+ main_~y~0 (- 5)) 0) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:37:20,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {17609#(and (= (+ main_~y~0 (- 5)) 0) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17634#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:20,965 INFO L290 TraceCheckUtils]: 54: Hoare triple {17634#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17634#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:20,965 INFO L290 TraceCheckUtils]: 55: Hoare triple {17634#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {17634#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:20,965 INFO L272 TraceCheckUtils]: 56: Hoare triple {17634#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,965 INFO L290 TraceCheckUtils]: 59: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,966 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17464#true} {17634#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #51#return; {17634#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:20,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {17634#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17659#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:20,966 INFO L290 TraceCheckUtils]: 62: Hoare triple {17659#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17659#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:20,967 INFO L290 TraceCheckUtils]: 63: Hoare triple {17659#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {17659#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:20,967 INFO L272 TraceCheckUtils]: 64: Hoare triple {17659#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,967 INFO L290 TraceCheckUtils]: 65: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,967 INFO L290 TraceCheckUtils]: 66: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,967 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17464#true} {17659#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #51#return; {17659#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:20,968 INFO L290 TraceCheckUtils]: 69: Hoare triple {17659#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17684#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:37:20,968 INFO L290 TraceCheckUtils]: 70: Hoare triple {17684#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17684#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:37:20,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {17684#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 50);havoc #t~post5; {17684#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:37:20,968 INFO L272 TraceCheckUtils]: 72: Hoare triple {17684#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,968 INFO L290 TraceCheckUtils]: 75: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,969 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17464#true} {17684#(and (= main_~y~0 8) (= main_~c~0 8))} #51#return; {17684#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:37:20,970 INFO L290 TraceCheckUtils]: 77: Hoare triple {17684#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17709#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:37:20,970 INFO L290 TraceCheckUtils]: 78: Hoare triple {17709#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17709#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:37:20,970 INFO L290 TraceCheckUtils]: 79: Hoare triple {17709#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 50);havoc #t~post5; {17709#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:37:20,970 INFO L272 TraceCheckUtils]: 80: Hoare triple {17709#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,970 INFO L290 TraceCheckUtils]: 81: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,971 INFO L290 TraceCheckUtils]: 82: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,971 INFO L290 TraceCheckUtils]: 83: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,971 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {17464#true} {17709#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #51#return; {17709#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 14:37:20,971 INFO L290 TraceCheckUtils]: 85: Hoare triple {17709#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17734#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:37:20,972 INFO L290 TraceCheckUtils]: 86: Hoare triple {17734#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17734#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:37:20,972 INFO L290 TraceCheckUtils]: 87: Hoare triple {17734#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(#t~post5 < 50);havoc #t~post5; {17734#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:37:20,972 INFO L272 TraceCheckUtils]: 88: Hoare triple {17734#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,972 INFO L290 TraceCheckUtils]: 89: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,972 INFO L290 TraceCheckUtils]: 90: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,972 INFO L290 TraceCheckUtils]: 91: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,973 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {17464#true} {17734#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #51#return; {17734#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:37:20,973 INFO L290 TraceCheckUtils]: 93: Hoare triple {17734#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17759#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 14:37:20,973 INFO L290 TraceCheckUtils]: 94: Hoare triple {17759#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17759#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 14:37:20,974 INFO L290 TraceCheckUtils]: 95: Hoare triple {17759#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} assume !!(#t~post5 < 50);havoc #t~post5; {17759#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 14:37:20,975 INFO L272 TraceCheckUtils]: 96: Hoare triple {17759#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,975 INFO L290 TraceCheckUtils]: 97: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,975 INFO L290 TraceCheckUtils]: 98: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,975 INFO L290 TraceCheckUtils]: 99: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,979 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {17464#true} {17759#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} #51#return; {17759#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 14:37:20,979 INFO L290 TraceCheckUtils]: 101: Hoare triple {17759#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-27 14:37:20,980 INFO L290 TraceCheckUtils]: 102: Hoare triple {17784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-27 14:37:20,980 INFO L290 TraceCheckUtils]: 103: Hoare triple {17784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 8))} assume !!(#t~post5 < 50);havoc #t~post5; {17784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-27 14:37:20,980 INFO L272 TraceCheckUtils]: 104: Hoare triple {17784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,980 INFO L290 TraceCheckUtils]: 105: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,980 INFO L290 TraceCheckUtils]: 106: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,980 INFO L290 TraceCheckUtils]: 107: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,980 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17464#true} {17784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 8))} #51#return; {17784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-27 14:37:20,981 INFO L290 TraceCheckUtils]: 109: Hoare triple {17784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17809#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-27 14:37:20,981 INFO L290 TraceCheckUtils]: 110: Hoare triple {17809#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17809#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-27 14:37:20,981 INFO L290 TraceCheckUtils]: 111: Hoare triple {17809#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} assume !!(#t~post5 < 50);havoc #t~post5; {17809#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-27 14:37:20,982 INFO L272 TraceCheckUtils]: 112: Hoare triple {17809#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,982 INFO L290 TraceCheckUtils]: 113: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,982 INFO L290 TraceCheckUtils]: 114: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,982 INFO L290 TraceCheckUtils]: 115: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,982 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17464#true} {17809#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} #51#return; {17809#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-27 14:37:20,982 INFO L290 TraceCheckUtils]: 117: Hoare triple {17809#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17834#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:37:20,983 INFO L290 TraceCheckUtils]: 118: Hoare triple {17834#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17834#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:37:20,983 INFO L290 TraceCheckUtils]: 119: Hoare triple {17834#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !!(#t~post5 < 50);havoc #t~post5; {17834#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:37:20,983 INFO L272 TraceCheckUtils]: 120: Hoare triple {17834#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,983 INFO L290 TraceCheckUtils]: 121: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,983 INFO L290 TraceCheckUtils]: 122: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,983 INFO L290 TraceCheckUtils]: 123: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,984 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17464#true} {17834#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #51#return; {17834#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:37:20,984 INFO L290 TraceCheckUtils]: 125: Hoare triple {17834#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17859#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:37:20,984 INFO L290 TraceCheckUtils]: 126: Hoare triple {17859#(and (= main_~c~0 15) (= main_~y~0 15))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17859#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:37:20,985 INFO L290 TraceCheckUtils]: 127: Hoare triple {17859#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(#t~post5 < 50);havoc #t~post5; {17859#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:37:20,985 INFO L272 TraceCheckUtils]: 128: Hoare triple {17859#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,985 INFO L290 TraceCheckUtils]: 129: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,985 INFO L290 TraceCheckUtils]: 130: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,985 INFO L290 TraceCheckUtils]: 131: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,985 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {17464#true} {17859#(and (= main_~c~0 15) (= main_~y~0 15))} #51#return; {17859#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:37:20,986 INFO L290 TraceCheckUtils]: 133: Hoare triple {17859#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17884#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:37:20,986 INFO L290 TraceCheckUtils]: 134: Hoare triple {17884#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17884#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:37:20,986 INFO L290 TraceCheckUtils]: 135: Hoare triple {17884#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} assume !!(#t~post5 < 50);havoc #t~post5; {17884#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:37:20,986 INFO L272 TraceCheckUtils]: 136: Hoare triple {17884#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17464#true} is VALID [2022-04-27 14:37:20,987 INFO L290 TraceCheckUtils]: 137: Hoare triple {17464#true} ~cond := #in~cond; {17464#true} is VALID [2022-04-27 14:37:20,987 INFO L290 TraceCheckUtils]: 138: Hoare triple {17464#true} assume !(0 == ~cond); {17464#true} is VALID [2022-04-27 14:37:20,987 INFO L290 TraceCheckUtils]: 139: Hoare triple {17464#true} assume true; {17464#true} is VALID [2022-04-27 14:37:20,987 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {17464#true} {17884#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} #51#return; {17884#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:37:20,987 INFO L290 TraceCheckUtils]: 141: Hoare triple {17884#(and (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {17909#(and (<= main_~k~0 16) (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0))} is VALID [2022-04-27 14:37:20,988 INFO L272 TraceCheckUtils]: 142: Hoare triple {17909#(and (<= main_~k~0 16) (= 15 (+ (- 1) main_~y~0)) (< 15 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17913#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:20,988 INFO L290 TraceCheckUtils]: 143: Hoare triple {17913#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17917#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:20,989 INFO L290 TraceCheckUtils]: 144: Hoare triple {17917#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17465#false} is VALID [2022-04-27 14:37:20,989 INFO L290 TraceCheckUtils]: 145: Hoare triple {17465#false} assume !false; {17465#false} is VALID [2022-04-27 14:37:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 34 proven. 544 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-27 14:37:20,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:21,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:21,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912217542] [2022-04-27 14:37:21,286 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:21,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555942273] [2022-04-27 14:37:21,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555942273] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:21,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:21,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-27 14:37:21,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286214332] [2022-04-27 14:37:21,286 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:21,287 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 146 [2022-04-27 14:37:21,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:21,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:37:21,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:21,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 14:37:21,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:21,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 14:37:21,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-27 14:37:21,377 INFO L87 Difference]: Start difference. First operand 189 states and 195 transitions. Second operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:37:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:24,294 INFO L93 Difference]: Finished difference Result 194 states and 199 transitions. [2022-04-27 14:37:24,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:37:24,294 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 146 [2022-04-27 14:37:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:37:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 109 transitions. [2022-04-27 14:37:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:37:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 109 transitions. [2022-04-27 14:37:24,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 109 transitions. [2022-04-27 14:37:24,423 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 14:37:24,426 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:37:24,426 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 14:37:24,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-04-27 14:37:24,427 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:24,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1000 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 14:37:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 14:37:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-27 14:37:24,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:24,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:24,547 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:24,547 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:24,550 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2022-04-27 14:37:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2022-04-27 14:37:24,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:24,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:24,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:24,551 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-27 14:37:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:24,554 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2022-04-27 14:37:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2022-04-27 14:37:24,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:24,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:24,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:24,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:37:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 194 transitions. [2022-04-27 14:37:24,558 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 194 transitions. Word has length 146 [2022-04-27 14:37:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:24,558 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 194 transitions. [2022-04-27 14:37:24,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:37:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2022-04-27 14:37:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-27 14:37:24,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:24,560 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:24,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:24,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:24,766 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:24,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1988619814, now seen corresponding path program 17 times [2022-04-27 14:37:24,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:24,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978408056] [2022-04-27 14:37:24,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:24,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:24,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:24,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134899975] [2022-04-27 14:37:24,789 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:37:24,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:24,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:24,790 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:37:24,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process