/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/ps6-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:53:41,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:53:41,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:53:41,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:53:41,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:53:41,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:53:41,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:53:41,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:53:41,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:53:41,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:53:41,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:53:41,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:53:41,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:53:41,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:53:41,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:53:41,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:53:41,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:53:41,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:53:41,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:53:41,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:53:41,215 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:53:41,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:53:41,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:53:41,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:53:41,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:53:41,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:53:41,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:53:41,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:53:41,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:53:41,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:53:41,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:53:41,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:53:41,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:53:41,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:53:41,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:53:41,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:53:41,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:53:41,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:53:41,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:53:41,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:53:41,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:53:41,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:53:41,243 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:53:41,281 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:53:41,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:53:41,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:53:41,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:53:41,282 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:53:41,283 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:53:41,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:53:41,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:53:41,283 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:53:41,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:53:41,284 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:53:41,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:53:41,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:53:41,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:53:41,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:53:41,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:53:41,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:53:41,286 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:53:41,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:53:41,286 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:53:41,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:53:41,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:53:41,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:53:41,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:53:41,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:53:41,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:53:41,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:53:41,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:53:41,288 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:53:41,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:53:41,288 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:53:41,288 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:53:41,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:53:41,289 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:53:41,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:53:41,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:53:41,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:53:41,535 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:53:41,537 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:53:41,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c [2022-04-27 14:53:41,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba8ba203/14face61bc4e49948d9a0ed7e977e73a/FLAGf251483be [2022-04-27 14:53:41,971 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:53:41,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c [2022-04-27 14:53:41,979 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba8ba203/14face61bc4e49948d9a0ed7e977e73a/FLAGf251483be [2022-04-27 14:53:42,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba8ba203/14face61bc4e49948d9a0ed7e977e73a [2022-04-27 14:53:42,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:53:42,390 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:53:42,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:53:42,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:53:42,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:53:42,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:53:42" (1/1) ... [2022-04-27 14:53:42,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3ede80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:42, skipping insertion in model container [2022-04-27 14:53:42,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:53:42" (1/1) ... [2022-04-27 14:53:42,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:53:42,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:53:42,586 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/ps6-ll_valuebound10.c[458,471] [2022-04-27 14:53:42,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:53:42,622 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:53:42,641 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/ps6-ll_valuebound10.c[458,471] [2022-04-27 14:53:42,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:53:42,671 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:53:42,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:42 WrapperNode [2022-04-27 14:53:42,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:53:42,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:53:42,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:53:42,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:53:42,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:42" (1/1) ... [2022-04-27 14:53:42,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:42" (1/1) ... [2022-04-27 14:53:42,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:42" (1/1) ... [2022-04-27 14:53:42,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:42" (1/1) ... [2022-04-27 14:53:42,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:42" (1/1) ... [2022-04-27 14:53:42,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:42" (1/1) ... [2022-04-27 14:53:42,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:42" (1/1) ... [2022-04-27 14:53:42,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:53:42,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:53:42,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:53:42,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:53:42,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:42" (1/1) ... [2022-04-27 14:53:42,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:53:42,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:42,749 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:53:42,771 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:53:42,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:53:42,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:53:42,787 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:53:42,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:53:42,789 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:53:42,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:53:42,848 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:53:42,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:53:43,023 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:53:43,036 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:53:43,036 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:53:43,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:53:43 BoogieIcfgContainer [2022-04-27 14:53:43,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:53:43,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:53:43,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:53:43,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:53:43,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:53:42" (1/3) ... [2022-04-27 14:53:43,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12535b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:53:43, skipping insertion in model container [2022-04-27 14:53:43,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:42" (2/3) ... [2022-04-27 14:53:43,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12535b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:53:43, skipping insertion in model container [2022-04-27 14:53:43,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:53:43" (3/3) ... [2022-04-27 14:53:43,060 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2022-04-27 14:53:43,071 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:53:43,072 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:53:43,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:53:43,116 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@1cc0debd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@652bfc9c [2022-04-27 14:53:43,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:53:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:53:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:53:43,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:43,131 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:43,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:43,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-27 14:53:43,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:43,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914145036] [2022-04-27 14:53:43,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:43,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:53:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:43,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 14:53:43,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:53:43,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-27 14:53:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:53:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:43,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:53:43,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:53:43,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:53:43,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:53:43,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 14:53:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:43,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:53:43,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:53:43,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:53:43,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 14:53:43,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:53:43,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 14:53:43,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:53:43,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-27 14:53:43,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-27 14:53:43,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#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; {32#true} is VALID [2022-04-27 14:53:43,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {32#true} is VALID [2022-04-27 14:53:43,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:53:43,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:53:43,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:53:43,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:53:43,412 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-27 14:53:43,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:53:43,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:53:43,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:53:43,413 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 14:53:43,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-27 14:53:43,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-27 14:53:43,415 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-27 14:53:43,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 14:53:43,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 14:53:43,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 14:53:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:53:43,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:43,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914145036] [2022-04-27 14:53:43,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914145036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:53:43,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:53:43,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:53:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153914534] [2022-04-27 14:53:43,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:53:43,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:53:43,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:43,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:53:43,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:43,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:53:43,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:43,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:53:43,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:53:43,496 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:53:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:43,756 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 14:53:43,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:53:43,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:53:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:53:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 14:53:43,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:53:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 14:53:43,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-27 14:53:43,855 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:53:43,863 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:53:43,863 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 14:53:43,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:53:43,868 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:43,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:53:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 14:53:43,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 14:53:43,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:43,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:53:43,894 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:53:43,895 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:53:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:43,899 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 14:53:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:53:43,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:43,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:43,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 14:53:43,900 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 14:53:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:43,905 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 14:53:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:53:43,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:43,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:43,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:43,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:53:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 14:53:43,910 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-27 14:53:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:43,911 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 14:53:43,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:53:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:53:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:53:43,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:43,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:43,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:53:43,917 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:43,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:43,918 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-27 14:53:43,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:43,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500384104] [2022-04-27 14:53:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:43,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:43,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:43,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1171813135] [2022-04-27 14:53:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:43,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:43,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:43,964 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:53:43,965 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:53:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:44,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:53:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:44,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:44,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2022-04-27 14:53:44,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#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); {202#true} is VALID [2022-04-27 14:53:44,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:53:44,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #63#return; {202#true} is VALID [2022-04-27 14:53:44,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret5 := main(); {202#true} is VALID [2022-04-27 14:53:44,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#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; {202#true} is VALID [2022-04-27 14:53:44,265 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {202#true} is VALID [2022-04-27 14:53:44,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-27 14:53:44,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-27 14:53:44,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:53:44,265 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} #53#return; {202#true} is VALID [2022-04-27 14:53:44,266 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {202#true} is VALID [2022-04-27 14:53:44,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-27 14:53:44,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-27 14:53:44,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:53:44,267 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} #55#return; {202#true} is VALID [2022-04-27 14:53:44,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:44,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:44,272 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:44,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:44,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {203#false} is VALID [2022-04-27 14:53:44,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-04-27 14:53:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:53:44,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:53:44,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:44,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500384104] [2022-04-27 14:53:44,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:44,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171813135] [2022-04-27 14:53:44,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171813135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:53:44,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:53:44,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:53:44,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932739938] [2022-04-27 14:53:44,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:53:44,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 14:53:44,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:44,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:53:44,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:44,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:53:44,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:44,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:53:44,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:53:44,303 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:53:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:44,666 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 14:53:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:53:44,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 14:53:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:53:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 14:53:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:53:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 14:53:44,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 14:53:44,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:44,715 INFO L225 Difference]: With dead ends: 35 [2022-04-27 14:53:44,715 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:53:44,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:53:44,717 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 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:53:44,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:53:44,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:53:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:53:44,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:44,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:44,725 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:44,725 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:44,727 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 14:53:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:53:44,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:44,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:44,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-27 14:53:44,729 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-27 14:53:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:44,731 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 14:53:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:53:44,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:44,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:44,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:44,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 14:53:44,735 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-27 14:53:44,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:44,735 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 14:53:44,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:53:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:53:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 14:53:44,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:44,737 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:44,764 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:53:44,955 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:53:44,956 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:44,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:44,956 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-27 14:53:44,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:44,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189826650] [2022-04-27 14:53:44,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:44,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:44,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:44,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [977592943] [2022-04-27 14:53:44,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:44,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:44,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:44,982 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:53:44,995 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:53:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:45,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:53:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:45,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:45,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-27 14:53:45,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#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); {434#true} is VALID [2022-04-27 14:53:45,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:45,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-27 14:53:45,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-27 14:53:45,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#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; {434#true} is VALID [2022-04-27 14:53:45,278 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {434#true} is VALID [2022-04-27 14:53:45,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:53:45,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:53:45,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:45,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-27 14:53:45,279 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-27 14:53:45,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:53:45,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:53:45,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:45,280 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-27 14:53:45,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:45,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:45,282 INFO L272 TraceCheckUtils]: 18: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {434#true} is VALID [2022-04-27 14:53:45,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:53:45,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:53:45,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:45,283 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {487#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:45,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#(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 * ~y~0 * ~y~0 + ~x~0; {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-27 14:53:45,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-27 14:53:45,286 INFO L272 TraceCheckUtils]: 25: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:45,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:45,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-27 14:53:45,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 14:53:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:53:45,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:53:45,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 14:53:45,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-27 14:53:45,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:45,519 INFO L272 TraceCheckUtils]: 25: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:45,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:53:45,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 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 * ~y~0 * ~y~0 + ~x~0; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:53:45,582 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #57#return; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:53:45,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:45,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:53:45,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:53:45,583 INFO L272 TraceCheckUtils]: 18: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {434#true} is VALID [2022-04-27 14:53:45,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:53:45,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:53:45,584 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-27 14:53:45,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:45,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:53:45,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:53:45,585 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-27 14:53:45,585 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-27 14:53:45,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:45,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:53:45,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:53:45,586 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {434#true} is VALID [2022-04-27 14:53:45,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#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; {434#true} is VALID [2022-04-27 14:53:45,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-27 14:53:45,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-27 14:53:45,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:45,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#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); {434#true} is VALID [2022-04-27 14:53:45,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-27 14:53:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:53:45,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:45,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189826650] [2022-04-27 14:53:45,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:45,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977592943] [2022-04-27 14:53:45,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977592943] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:53:45,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:53:45,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:53:45,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291349332] [2022-04-27 14:53:45,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:53:45,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 14:53:45,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:45,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:53:45,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:45,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:53:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:45,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:53:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:53:45,746 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:53:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:45,890 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:53:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:53:45,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 14:53:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:53:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:53:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:53:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:53:45,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:53:45,982 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:53:45,983 INFO L225 Difference]: With dead ends: 37 [2022-04-27 14:53:45,983 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 14:53:45,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:53:45,985 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:45,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:53:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 14:53:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 14:53:45,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:45,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:45,994 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:45,994 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:45,996 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 14:53:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:53:46,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:46,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:46,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 14:53:46,000 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 14:53:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:46,002 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 14:53:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:53:46,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:46,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:46,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:46,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-27 14:53:46,005 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-27 14:53:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:46,006 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-27 14:53:46,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:53:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:53:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 14:53:46,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:46,007 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:46,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 14:53:46,208 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:53:46,208 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:46,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:46,209 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-27 14:53:46,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:46,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351241954] [2022-04-27 14:53:46,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:46,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:46,228 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:46,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706363387] [2022-04-27 14:53:46,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:46,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:46,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:46,239 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:53:46,250 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:53:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:46,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:53:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:46,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:46,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2022-04-27 14:53:46,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#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); {784#true} is VALID [2022-04-27 14:53:46,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:53:46,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #63#return; {784#true} is VALID [2022-04-27 14:53:46,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2022-04-27 14:53:46,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#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; {784#true} is VALID [2022-04-27 14:53:46,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {784#true} is VALID [2022-04-27 14:53:46,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:53:46,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:53:46,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:53:46,686 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} #53#return; {784#true} is VALID [2022-04-27 14:53:46,686 INFO L272 TraceCheckUtils]: 11: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {784#true} is VALID [2022-04-27 14:53:46,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:53:46,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:53:46,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:53:46,686 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} #55#return; {784#true} is VALID [2022-04-27 14:53:46,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:46,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:46,688 INFO L272 TraceCheckUtils]: 18: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:53:46,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:53:46,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:53:46,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:53:46,689 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {784#true} {837#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:46,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#(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 * ~y~0 * ~y~0 + ~x~0; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:53:46,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:53:46,690 INFO L272 TraceCheckUtils]: 25: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:53:46,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:53:46,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:53:46,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:53:46,691 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {784#true} {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:53:46,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:53:46,692 INFO L272 TraceCheckUtils]: 31: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:53:46,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:53:46,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:53:46,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:53:46,693 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {784#true} {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:53:46,694 INFO L272 TraceCheckUtils]: 36: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:46,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:46,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {785#false} is VALID [2022-04-27 14:53:46,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-27 14:53:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 14:53:46,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:53:47,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:47,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351241954] [2022-04-27 14:53:47,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:47,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706363387] [2022-04-27 14:53:47,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706363387] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:53:47,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:53:47,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:53:47,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375493289] [2022-04-27 14:53:47,098 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:53:47,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 14:53:47,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:47,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:53:47,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:47,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:53:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:47,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:53:47,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:53:47,127 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:53:47,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:47,364 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 14:53:47,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:53:47,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 14:53:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:53:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 14:53:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:53:47,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 14:53:47,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-27 14:53:47,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:47,412 INFO L225 Difference]: With dead ends: 42 [2022-04-27 14:53:47,412 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:53:47,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:53:47,413 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:47,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:53:47,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:53:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 14:53:47,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:47,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:53:47,423 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:53:47,423 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:53:47,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:47,425 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 14:53:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:53:47,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:47,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:47,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 14:53:47,427 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 14:53:47,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:47,429 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 14:53:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:53:47,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:47,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:47,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:47,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:53:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-27 14:53:47,432 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-27 14:53:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:47,432 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-27 14:53:47,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:53:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:53:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 14:53:47,434 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:47,434 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:47,457 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:53:47,655 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:53:47,656 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:47,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 2 times [2022-04-27 14:53:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:47,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184458885] [2022-04-27 14:53:47,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:47,688 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:47,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119908551] [2022-04-27 14:53:47,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:53:47,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:47,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:47,696 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:53:47,698 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:53:47,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:53:47,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:53:47,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:53:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:47,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:48,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {1160#true} call ULTIMATE.init(); {1160#true} is VALID [2022-04-27 14:53:48,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {1160#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); {1160#true} is VALID [2022-04-27 14:53:48,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:48,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} #63#return; {1160#true} is VALID [2022-04-27 14:53:48,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {1160#true} call #t~ret5 := main(); {1160#true} is VALID [2022-04-27 14:53:48,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {1160#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; {1160#true} is VALID [2022-04-27 14:53:48,127 INFO L272 TraceCheckUtils]: 6: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:53:48,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:53:48,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:53:48,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:48,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1160#true} {1160#true} #53#return; {1160#true} is VALID [2022-04-27 14:53:48,128 INFO L272 TraceCheckUtils]: 11: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:53:48,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:53:48,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:53:48,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:48,128 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1160#true} {1160#true} #55#return; {1160#true} is VALID [2022-04-27 14:53:48,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {1160#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:48,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:48,129 INFO L272 TraceCheckUtils]: 18: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:53:48,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:53:48,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:53:48,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:48,130 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1160#true} {1213#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:48,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {1213#(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 * ~y~0 * ~y~0 + ~x~0; {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:53:48,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:53:48,131 INFO L272 TraceCheckUtils]: 25: Hoare triple {1235#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:53:48,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:53:48,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:53:48,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:48,132 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1160#true} {1235#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:53:48,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {1235#(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 * ~y~0 * ~y~0 + ~x~0; {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:53:48,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:53:48,133 INFO L272 TraceCheckUtils]: 32: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:53:48,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:53:48,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:53:48,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:48,140 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1160#true} {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #57#return; {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:53:48,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 14:53:48,141 INFO L272 TraceCheckUtils]: 38: Hoare triple {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:53:48,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:53:48,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:53:48,142 INFO L290 TraceCheckUtils]: 41: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:48,143 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1160#true} {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} #59#return; {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 14:53:48,144 INFO L272 TraceCheckUtils]: 43: Hoare triple {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:48,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:48,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1161#false} is VALID [2022-04-27 14:53:48,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {1161#false} assume !false; {1161#false} is VALID [2022-04-27 14:53:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 14:53:48,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:53:48,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:48,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184458885] [2022-04-27 14:53:48,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:48,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119908551] [2022-04-27 14:53:48,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119908551] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:53:48,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:53:48,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:53:48,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868104842] [2022-04-27 14:53:48,548 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:53:48,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 14:53:48,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:48,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:53:48,581 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:53:48,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:53:48,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:48,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:53:48,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:53:48,582 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:53:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:48,926 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-27 14:53:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:53:48,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 14:53:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:53:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 14:53:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:53:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 14:53:48,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-27 14:53:48,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:48,971 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:53:48,971 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 14:53:48,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:53:48,972 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:48,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:53:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 14:53:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 14:53:48,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:48,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:53:48,985 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:53:48,985 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:53:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:48,993 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 14:53:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:53:48,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:48,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:48,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-27 14:53:48,994 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-27 14:53:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:48,996 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 14:53:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:53:48,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:48,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:48,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:48,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:53:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-27 14:53:48,999 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-27 14:53:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:48,999 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-27 14:53:49,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:53:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:53:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 14:53:49,001 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:49,001 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:49,017 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:53:49,214 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:53:49,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:49,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 3 times [2022-04-27 14:53:49,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:49,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961853809] [2022-04-27 14:53:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:49,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:49,229 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:49,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1839568416] [2022-04-27 14:53:49,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:53:49,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:49,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:49,230 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:53:49,236 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:53:49,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:53:49,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:53:49,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:53:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:49,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:49,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2022-04-27 14:53:49,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#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); {1574#true} is VALID [2022-04-27 14:53:49,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:49,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #63#return; {1574#true} is VALID [2022-04-27 14:53:49,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret5 := main(); {1574#true} is VALID [2022-04-27 14:53:49,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#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; {1574#true} is VALID [2022-04-27 14:53:49,754 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:49,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:49,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:49,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:49,754 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1574#true} {1574#true} #53#return; {1574#true} is VALID [2022-04-27 14:53:49,754 INFO L272 TraceCheckUtils]: 11: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:49,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:49,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:49,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:49,755 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1574#true} {1574#true} #55#return; {1574#true} is VALID [2022-04-27 14:53:49,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {1574#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1627#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:49,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {1627#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1627#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:49,756 INFO L272 TraceCheckUtils]: 18: Hoare triple {1627#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:49,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:49,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:49,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:49,757 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1574#true} {1627#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1627#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:49,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#(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 * ~y~0 * ~y~0 + ~x~0; {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:53:49,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:53:49,758 INFO L272 TraceCheckUtils]: 25: Hoare triple {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:49,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:49,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:49,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:49,759 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1574#true} {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:53:49,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {1649#(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 * ~y~0 * ~y~0 + ~x~0; {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:53:49,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:53:49,760 INFO L272 TraceCheckUtils]: 32: Hoare triple {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:49,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:49,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:49,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:49,761 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1574#true} {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #57#return; {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:53:49,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {1671#(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 * ~y~0 * ~y~0 + ~x~0; {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:53:49,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:53:49,762 INFO L272 TraceCheckUtils]: 39: Hoare triple {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:49,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:49,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:49,762 INFO L290 TraceCheckUtils]: 42: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:49,763 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1574#true} {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:53:49,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:53:49,764 INFO L272 TraceCheckUtils]: 45: Hoare triple {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:49,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:49,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:49,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:49,768 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1574#true} {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #59#return; {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:53:49,770 INFO L272 TraceCheckUtils]: 50: Hoare triple {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1734#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:49,777 INFO L290 TraceCheckUtils]: 51: Hoare triple {1734#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1738#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:49,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {1738#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1575#false} is VALID [2022-04-27 14:53:49,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-27 14:53:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 14:53:49,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:53:50,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:50,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961853809] [2022-04-27 14:53:50,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:50,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839568416] [2022-04-27 14:53:50,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839568416] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:53:50,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:53:50,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:53:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700510286] [2022-04-27 14:53:50,131 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:53:50,132 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 14:53:50,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:50,133 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:53:50,164 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:53:50,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:53:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:50,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:53:50,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:53:50,166 INFO L87 Difference]: Start difference. First operand 39 states and 43 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:53:50,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:50,612 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-27 14:53:50,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:53:50,612 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 14:53:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:50,613 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:53:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 14:53:50,615 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:53:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 14:53:50,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-27 14:53:50,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:50,661 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:53:50,661 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 14:53:50,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:53:50,662 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:50,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:53:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 14:53:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-27 14:53:50,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:50,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:53:50,676 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:53:50,676 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:53:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:50,679 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 14:53:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:53:50,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:50,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:50,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-27 14:53:50,681 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-27 14:53:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:50,689 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 14:53:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:53:50,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:50,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:50,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:50,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:53:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-27 14:53:50,693 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-27 14:53:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:50,694 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-27 14:53:50,694 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:53:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:53:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 14:53:50,695 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:50,695 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:50,709 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:53:50,906 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:53:50,906 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:50,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:50,907 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 4 times [2022-04-27 14:53:50,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:50,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257955839] [2022-04-27 14:53:50,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:50,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:50,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:50,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857354344] [2022-04-27 14:53:50,923 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:53:50,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:50,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:50,927 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:53:50,939 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:53:50,981 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:53:50,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:53:50,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:53:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:50,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:51,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2026#true} is VALID [2022-04-27 14:53:51,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {2026#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); {2026#true} is VALID [2022-04-27 14:53:51,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:51,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #63#return; {2026#true} is VALID [2022-04-27 14:53:51,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret5 := main(); {2026#true} is VALID [2022-04-27 14:53:51,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {2026#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; {2026#true} is VALID [2022-04-27 14:53:51,418 INFO L272 TraceCheckUtils]: 6: Hoare triple {2026#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:51,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:51,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:51,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:51,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2026#true} {2026#true} #53#return; {2026#true} is VALID [2022-04-27 14:53:51,420 INFO L272 TraceCheckUtils]: 11: Hoare triple {2026#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:51,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:51,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:51,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:51,420 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2026#true} {2026#true} #55#return; {2026#true} is VALID [2022-04-27 14:53:51,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {2026#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:51,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {2079#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:51,422 INFO L272 TraceCheckUtils]: 18: Hoare triple {2079#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:51,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:51,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:51,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:51,422 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2026#true} {2079#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:51,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {2079#(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 * ~y~0 * ~y~0 + ~x~0; {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:53:51,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:53:51,423 INFO L272 TraceCheckUtils]: 25: Hoare triple {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:51,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:51,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:51,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:51,424 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2026#true} {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:53:51,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {2101#(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 * ~y~0 * ~y~0 + ~x~0; {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:53:51,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:53:51,426 INFO L272 TraceCheckUtils]: 32: Hoare triple {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:51,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:51,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:51,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:51,427 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2026#true} {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:53:51,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {2123#(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 * ~y~0 * ~y~0 + ~x~0; {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:53:51,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:53:51,428 INFO L272 TraceCheckUtils]: 39: Hoare triple {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:51,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:51,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:51,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:51,429 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2026#true} {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #57#return; {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:53:51,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ 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 * ~y~0 * ~y~0 + ~x~0; {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:53:51,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:53:51,430 INFO L272 TraceCheckUtils]: 46: Hoare triple {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:51,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:51,430 INFO L290 TraceCheckUtils]: 48: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:51,430 INFO L290 TraceCheckUtils]: 49: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:51,432 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2026#true} {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:53:51,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:53:51,433 INFO L272 TraceCheckUtils]: 52: Hoare triple {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:51,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:51,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:51,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:51,434 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2026#true} {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:53:51,435 INFO L272 TraceCheckUtils]: 57: Hoare triple {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2208#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:51,435 INFO L290 TraceCheckUtils]: 58: Hoare triple {2208#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2212#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:51,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {2212#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2027#false} is VALID [2022-04-27 14:53:51,436 INFO L290 TraceCheckUtils]: 60: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2022-04-27 14:53:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 14:53:51,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:53:52,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:52,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257955839] [2022-04-27 14:53:52,073 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:52,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857354344] [2022-04-27 14:53:52,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857354344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:53:52,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:53:52,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:53:52,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890961995] [2022-04-27 14:53:52,074 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:53:52,074 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 14:53:52,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:52,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:53:52,110 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:53:52,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:53:52,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:52,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:53:52,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:53:52,111 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:53:52,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:52,579 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-27 14:53:52,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:53:52,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 14:53:52,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:53:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 14:53:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:53:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 14:53:52,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-27 14:53:52,639 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:53:52,641 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:53:52,642 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:53:52,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:53:52,644 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:52,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:53:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:53:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:53:52,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:52,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:53:52,667 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:53:52,667 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:53:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:52,670 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:53:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:53:52,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:52,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:52,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 14:53:52,671 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 14:53:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:52,674 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:53:52,674 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:53:52,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:52,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:52,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:52,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:53:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-27 14:53:52,677 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-27 14:53:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:52,677 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-27 14:53:52,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:53:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:53:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 14:53:52,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:52,680 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:52,701 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:53:52,895 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:53:52,896 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:52,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:52,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 5 times [2022-04-27 14:53:52,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:52,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945624077] [2022-04-27 14:53:52,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:52,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:52,910 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:52,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [489727875] [2022-04-27 14:53:52,910 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:53:52,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:52,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:52,911 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:53:52,921 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:53:53,486 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:53:53,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:53:53,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:53:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:53,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:53,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {2516#true} call ULTIMATE.init(); {2516#true} is VALID [2022-04-27 14:53:53,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {2516#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); {2516#true} is VALID [2022-04-27 14:53:53,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:53:53,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2516#true} {2516#true} #63#return; {2516#true} is VALID [2022-04-27 14:53:53,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {2516#true} call #t~ret5 := main(); {2516#true} is VALID [2022-04-27 14:53:53,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {2516#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; {2516#true} is VALID [2022-04-27 14:53:53,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {2516#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:53:53,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:53:53,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:53:53,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:53:53,981 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2516#true} {2516#true} #53#return; {2516#true} is VALID [2022-04-27 14:53:53,981 INFO L272 TraceCheckUtils]: 11: Hoare triple {2516#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:53:53,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:53:53,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:53:53,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:53:53,982 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2516#true} {2516#true} #55#return; {2516#true} is VALID [2022-04-27 14:53:53,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {2516#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2569#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:53,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {2569#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2569#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:53,982 INFO L272 TraceCheckUtils]: 18: Hoare triple {2569#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:53:53,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:53:53,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:53:53,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:53:53,989 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2516#true} {2569#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2569#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:53,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {2569#(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 * ~y~0 * ~y~0 + ~x~0; {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:53:53,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:53:53,990 INFO L272 TraceCheckUtils]: 25: Hoare triple {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:53:53,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:53:53,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:53:53,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:53:53,990 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2516#true} {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:53:53,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {2591#(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 * ~y~0 * ~y~0 + ~x~0; {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:53:53,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:53:53,991 INFO L272 TraceCheckUtils]: 32: Hoare triple {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:53:53,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:53:53,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:53:53,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:53:53,992 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2516#true} {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:53:53,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {2613#(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 * ~y~0 * ~y~0 + ~x~0; {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:53:53,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:53:53,993 INFO L272 TraceCheckUtils]: 39: Hoare triple {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:53:53,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:53:53,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:53:53,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:53:53,994 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2516#true} {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:53:53,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {2635#(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 * ~y~0 * ~y~0 + ~x~0; {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:53:53,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:53:53,995 INFO L272 TraceCheckUtils]: 46: Hoare triple {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:53:53,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:53:53,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:53:53,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:53:53,996 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2516#true} {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:53:53,996 INFO L290 TraceCheckUtils]: 51: Hoare triple {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 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 * ~y~0 * ~y~0 + ~x~0; {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:53:53,997 INFO L290 TraceCheckUtils]: 52: Hoare triple {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:53:53,997 INFO L272 TraceCheckUtils]: 53: Hoare triple {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:53:53,997 INFO L290 TraceCheckUtils]: 54: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:53:53,997 INFO L290 TraceCheckUtils]: 55: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:53:53,997 INFO L290 TraceCheckUtils]: 56: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:53:53,997 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2516#true} {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:53:53,998 INFO L290 TraceCheckUtils]: 58: Hoare triple {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:53:53,998 INFO L272 TraceCheckUtils]: 59: Hoare triple {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:53:53,998 INFO L290 TraceCheckUtils]: 60: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:53:54,001 INFO L290 TraceCheckUtils]: 61: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:53:54,002 INFO L290 TraceCheckUtils]: 62: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:53:54,004 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2516#true} {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #59#return; {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:53:54,005 INFO L272 TraceCheckUtils]: 64: Hoare triple {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:54,006 INFO L290 TraceCheckUtils]: 65: Hoare triple {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:54,006 INFO L290 TraceCheckUtils]: 66: Hoare triple {2724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2517#false} is VALID [2022-04-27 14:53:54,006 INFO L290 TraceCheckUtils]: 67: Hoare triple {2517#false} assume !false; {2517#false} is VALID [2022-04-27 14:53:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-27 14:53:54,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:53:54,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:54,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945624077] [2022-04-27 14:53:54,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:54,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489727875] [2022-04-27 14:53:54,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489727875] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:53:54,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:53:54,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:53:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714000379] [2022-04-27 14:53:54,322 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:53:54,322 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 14:53:54,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:54,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:53:54,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:54,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:53:54,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:54,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:53:54,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:53:54,365 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:53:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:54,963 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 14:53:54,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:53:54,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 14:53:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:53:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 14:53:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:53:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 14:53:54,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-27 14:53:55,023 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:53:55,024 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:53:55,025 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 14:53:55,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 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:53:55,025 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:55,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:53:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 14:53:55,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 14:53:55,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:55,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:53:55,062 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:53:55,064 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:53:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:55,067 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 14:53:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:53:55,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:55,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:55,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-27 14:53:55,071 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-27 14:53:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:55,074 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 14:53:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:53:55,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:55,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:55,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:55,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:53:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-27 14:53:55,078 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-27 14:53:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:55,078 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-27 14:53:55,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:53:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:53:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 14:53:55,080 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:55,080 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:55,092 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:53:55,290 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:53:55,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:55,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 6 times [2022-04-27 14:53:55,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:55,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064481091] [2022-04-27 14:53:55,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:55,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:55,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:55,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636646956] [2022-04-27 14:53:55,305 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:53:55,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:55,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:55,306 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:53:55,307 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:53:55,843 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:53:55,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:53:55,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:53:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:55,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:56,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {3044#true} call ULTIMATE.init(); {3044#true} is VALID [2022-04-27 14:53:56,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {3044#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); {3044#true} is VALID [2022-04-27 14:53:56,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:53:56,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3044#true} {3044#true} #63#return; {3044#true} is VALID [2022-04-27 14:53:56,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {3044#true} call #t~ret5 := main(); {3044#true} is VALID [2022-04-27 14:53:56,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {3044#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; {3044#true} is VALID [2022-04-27 14:53:56,306 INFO L272 TraceCheckUtils]: 6: Hoare triple {3044#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:53:56,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:53:56,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:53:56,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:53:56,306 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3044#true} {3044#true} #53#return; {3044#true} is VALID [2022-04-27 14:53:56,306 INFO L272 TraceCheckUtils]: 11: Hoare triple {3044#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:53:56,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:53:56,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:53:56,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:53:56,310 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3044#true} {3044#true} #55#return; {3044#true} is VALID [2022-04-27 14:53:56,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {3044#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:56,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {3097#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:56,311 INFO L272 TraceCheckUtils]: 18: Hoare triple {3097#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:53:56,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:53:56,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:53:56,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:53:56,312 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3044#true} {3097#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:56,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {3097#(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 * ~y~0 * ~y~0 + ~x~0; {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:53:56,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:53:56,313 INFO L272 TraceCheckUtils]: 25: Hoare triple {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:53:56,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:53:56,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:53:56,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:53:56,314 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3044#true} {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:53:56,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {3119#(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 * ~y~0 * ~y~0 + ~x~0; {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:53:56,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:53:56,315 INFO L272 TraceCheckUtils]: 32: Hoare triple {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:53:56,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:53:56,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:53:56,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:53:56,315 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3044#true} {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:53:56,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {3141#(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 * ~y~0 * ~y~0 + ~x~0; {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:53:56,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:53:56,317 INFO L272 TraceCheckUtils]: 39: Hoare triple {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:53:56,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:53:56,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:53:56,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:53:56,317 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3044#true} {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #57#return; {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:53:56,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {3163#(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 * ~y~0 * ~y~0 + ~x~0; {3185#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:53:56,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {3185#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:53:56,318 INFO L272 TraceCheckUtils]: 46: Hoare triple {3185#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:53:56,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:53:56,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:53:56,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:53:56,323 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3044#true} {3185#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {3185#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:53:56,324 INFO L290 TraceCheckUtils]: 51: Hoare triple {3185#(and (= main_~y~0 4) (= 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 * ~y~0 * ~y~0 + ~x~0; {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:53:56,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:53:56,325 INFO L272 TraceCheckUtils]: 53: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:53:56,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:53:56,325 INFO L290 TraceCheckUtils]: 55: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:53:56,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:53:56,326 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3044#true} {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:53:56,326 INFO L290 TraceCheckUtils]: 58: Hoare triple {3207#(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 * ~y~0 * ~y~0 + ~x~0; {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:53:56,328 INFO L290 TraceCheckUtils]: 59: Hoare triple {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:53:56,328 INFO L272 TraceCheckUtils]: 60: Hoare triple {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:53:56,329 INFO L290 TraceCheckUtils]: 61: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:53:56,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:53:56,329 INFO L290 TraceCheckUtils]: 63: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:53:56,330 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3044#true} {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:53:56,330 INFO L290 TraceCheckUtils]: 65: Hoare triple {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:53:56,330 INFO L272 TraceCheckUtils]: 66: Hoare triple {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:53:56,331 INFO L290 TraceCheckUtils]: 67: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:53:56,331 INFO L290 TraceCheckUtils]: 68: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:53:56,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:53:56,331 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3044#true} {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:53:56,332 INFO L272 TraceCheckUtils]: 71: Hoare triple {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:56,333 INFO L290 TraceCheckUtils]: 72: Hoare triple {3270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:56,333 INFO L290 TraceCheckUtils]: 73: Hoare triple {3274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3045#false} is VALID [2022-04-27 14:53:56,333 INFO L290 TraceCheckUtils]: 74: Hoare triple {3045#false} assume !false; {3045#false} is VALID [2022-04-27 14:53:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-27 14:53:56,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:53:56,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:56,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064481091] [2022-04-27 14:53:56,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:56,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636646956] [2022-04-27 14:53:56,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636646956] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:53:56,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:53:56,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:53:56,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388434790] [2022-04-27 14:53:56,657 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:53:56,657 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-27 14:53:56,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:56,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:53:56,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:56,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:53:56,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:53:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:53:56,720 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:53:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:57,405 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-27 14:53:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:53:57,405 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-27 14:53:57,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:53:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-27 14:53:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:53:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-27 14:53:57,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-27 14:53:57,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:57,465 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:53:57,466 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 14:53:57,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 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:53:57,466 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:57,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 310 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:53:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 14:53:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 14:53:57,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:57,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:53:57,486 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:53:57,487 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:53:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:57,489 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-27 14:53:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 14:53:57,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:57,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:57,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-27 14:53:57,490 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-27 14:53:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:57,492 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-27 14:53:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 14:53:57,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:57,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:57,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:57,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:53:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-27 14:53:57,494 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-27 14:53:57,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:57,494 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-27 14:53:57,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:53:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 14:53:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 14:53:57,495 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:57,495 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:57,506 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:53:57,702 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:53:57,702 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:57,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:57,703 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 7 times [2022-04-27 14:53:57,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:57,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631281744] [2022-04-27 14:53:57,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:57,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:57,726 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:57,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2043043520] [2022-04-27 14:53:57,726 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:53:57,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:57,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:57,729 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:53:57,730 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:55:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:27,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 14:55:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:27,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:27,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {3610#true} call ULTIMATE.init(); {3610#true} is VALID [2022-04-27 14:55:27,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {3610#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); {3610#true} is VALID [2022-04-27 14:55:27,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-27 14:55:27,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3610#true} {3610#true} #63#return; {3610#true} is VALID [2022-04-27 14:55:27,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {3610#true} call #t~ret5 := main(); {3610#true} is VALID [2022-04-27 14:55:27,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {3610#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; {3610#true} is VALID [2022-04-27 14:55:27,920 INFO L272 TraceCheckUtils]: 6: Hoare triple {3610#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3610#true} is VALID [2022-04-27 14:55:27,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-27 14:55:27,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-27 14:55:27,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-27 14:55:27,921 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3610#true} {3610#true} #53#return; {3610#true} is VALID [2022-04-27 14:55:27,921 INFO L272 TraceCheckUtils]: 11: Hoare triple {3610#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3610#true} is VALID [2022-04-27 14:55:27,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-27 14:55:27,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-27 14:55:27,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-27 14:55:27,921 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3610#true} {3610#true} #55#return; {3610#true} is VALID [2022-04-27 14:55:27,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {3610#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3663#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:27,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {3663#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3663#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:27,922 INFO L272 TraceCheckUtils]: 18: Hoare triple {3663#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3610#true} is VALID [2022-04-27 14:55:27,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-27 14:55:27,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-27 14:55:27,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-27 14:55:27,923 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3610#true} {3663#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3663#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:27,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {3663#(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 * ~y~0 * ~y~0 + ~x~0; {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:27,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:27,924 INFO L272 TraceCheckUtils]: 25: Hoare triple {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3610#true} is VALID [2022-04-27 14:55:27,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-27 14:55:27,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-27 14:55:27,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-27 14:55:27,924 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3610#true} {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:27,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {3685#(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 * ~y~0 * ~y~0 + ~x~0; {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:27,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:27,925 INFO L272 TraceCheckUtils]: 32: Hoare triple {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3610#true} is VALID [2022-04-27 14:55:27,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-27 14:55:27,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-27 14:55:27,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-27 14:55:27,926 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3610#true} {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:27,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {3707#(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 * ~y~0 * ~y~0 + ~x~0; {3729#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:55:27,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {3729#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {3729#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:55:27,926 INFO L272 TraceCheckUtils]: 39: Hoare triple {3729#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3610#true} is VALID [2022-04-27 14:55:27,927 INFO L290 TraceCheckUtils]: 40: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-27 14:55:27,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-27 14:55:27,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-27 14:55:27,927 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3610#true} {3729#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {3729#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:55:27,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {3729#(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 * ~y~0 * ~y~0 + ~x~0; {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:55:27,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:55:27,928 INFO L272 TraceCheckUtils]: 46: Hoare triple {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3610#true} is VALID [2022-04-27 14:55:27,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-27 14:55:27,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-27 14:55:27,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-27 14:55:27,929 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3610#true} {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #57#return; {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:55:27,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {3751#(and (= 3 (+ (- 1) main_~y~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 * ~y~0 * ~y~0 + ~x~0; {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:27,929 INFO L290 TraceCheckUtils]: 52: Hoare triple {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:27,929 INFO L272 TraceCheckUtils]: 53: Hoare triple {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3610#true} is VALID [2022-04-27 14:55:27,929 INFO L290 TraceCheckUtils]: 54: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-27 14:55:27,929 INFO L290 TraceCheckUtils]: 55: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-27 14:55:27,929 INFO L290 TraceCheckUtils]: 56: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-27 14:55:27,930 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3610#true} {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #57#return; {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:27,930 INFO L290 TraceCheckUtils]: 58: Hoare triple {3773#(and (= (+ (- 1) main_~c~0) 4) (= 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 * ~y~0 * ~y~0 + ~x~0; {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:27,931 INFO L290 TraceCheckUtils]: 59: Hoare triple {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:27,931 INFO L272 TraceCheckUtils]: 60: Hoare triple {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3610#true} is VALID [2022-04-27 14:55:27,931 INFO L290 TraceCheckUtils]: 61: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-27 14:55:27,931 INFO L290 TraceCheckUtils]: 62: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-27 14:55:27,931 INFO L290 TraceCheckUtils]: 63: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-27 14:55:27,931 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3610#true} {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #57#return; {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:27,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {3795#(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 * ~y~0 * ~y~0 + ~x~0; {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:55:27,932 INFO L290 TraceCheckUtils]: 66: Hoare triple {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !false; {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:55:27,932 INFO L272 TraceCheckUtils]: 67: Hoare triple {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3610#true} is VALID [2022-04-27 14:55:27,932 INFO L290 TraceCheckUtils]: 68: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-27 14:55:27,932 INFO L290 TraceCheckUtils]: 69: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-27 14:55:27,932 INFO L290 TraceCheckUtils]: 70: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-27 14:55:27,936 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3610#true} {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #57#return; {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:55:27,937 INFO L290 TraceCheckUtils]: 72: Hoare triple {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:55:27,937 INFO L272 TraceCheckUtils]: 73: Hoare triple {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3610#true} is VALID [2022-04-27 14:55:27,937 INFO L290 TraceCheckUtils]: 74: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-27 14:55:27,937 INFO L290 TraceCheckUtils]: 75: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-27 14:55:27,937 INFO L290 TraceCheckUtils]: 76: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-27 14:55:27,938 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3610#true} {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #59#return; {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:55:27,938 INFO L272 TraceCheckUtils]: 78: Hoare triple {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:27,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {3858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:27,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {3862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3611#false} is VALID [2022-04-27 14:55:27,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {3611#false} assume !false; {3611#false} is VALID [2022-04-27 14:55:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-27 14:55:27,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:28,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:28,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631281744] [2022-04-27 14:55:28,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:28,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043043520] [2022-04-27 14:55:28,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043043520] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:28,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:28,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:55:28,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968951306] [2022-04-27 14:55:28,235 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:28,236 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-27 14:55:28,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:28,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:55:28,278 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:55:28,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:55:28,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:28,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:55:28,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:55:28,279 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:55:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:29,202 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-27 14:55:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:55:29,203 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-27 14:55:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:55:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-27 14:55:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:55:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-27 14:55:29,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-27 14:55:29,261 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:55:29,262 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:55:29,262 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 14:55:29,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:55:29,263 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:29,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:55:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 14:55:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 14:55:29,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:29,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:55:29,291 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:55:29,291 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:55:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:29,293 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-27 14:55:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:55:29,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:29,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:29,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-27 14:55:29,294 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-27 14:55:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:29,296 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-27 14:55:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:55:29,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:29,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:29,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:29,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:55:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-27 14:55:29,298 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-27 14:55:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:29,299 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-27 14:55:29,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:55:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:55:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-27 14:55:29,300 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:29,300 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:29,347 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:55:29,500 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:55:29,501 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 8 times [2022-04-27 14:55:29,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:29,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186865298] [2022-04-27 14:55:29,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:29,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:29,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951149914] [2022-04-27 14:55:29,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:55:29,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:29,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:29,515 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:55:29,525 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:55:30,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:55:30,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:30,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-27 14:55:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:30,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:31,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {4214#true} call ULTIMATE.init(); {4214#true} is VALID [2022-04-27 14:55:31,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {4214#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); {4214#true} is VALID [2022-04-27 14:55:31,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4214#true} {4214#true} #63#return; {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {4214#true} call #t~ret5 := main(); {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {4214#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; {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L272 TraceCheckUtils]: 6: Hoare triple {4214#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4214#true} {4214#true} #53#return; {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L272 TraceCheckUtils]: 11: Hoare triple {4214#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-27 14:55:31,003 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4214#true} {4214#true} #55#return; {4214#true} is VALID [2022-04-27 14:55:31,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {4214#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4267#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:31,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {4267#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4267#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:31,004 INFO L272 TraceCheckUtils]: 18: Hoare triple {4267#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4214#true} is VALID [2022-04-27 14:55:31,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-27 14:55:31,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-27 14:55:31,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-27 14:55:31,005 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4214#true} {4267#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4267#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:31,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {4267#(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 * ~y~0 * ~y~0 + ~x~0; {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:31,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:31,006 INFO L272 TraceCheckUtils]: 25: Hoare triple {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4214#true} is VALID [2022-04-27 14:55:31,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-27 14:55:31,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-27 14:55:31,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-27 14:55:31,006 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4214#true} {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:31,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {4289#(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 * ~y~0 * ~y~0 + ~x~0; {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:55:31,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:55:31,007 INFO L272 TraceCheckUtils]: 32: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4214#true} is VALID [2022-04-27 14:55:31,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-27 14:55:31,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-27 14:55:31,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-27 14:55:31,010 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4214#true} {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #57#return; {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:55:31,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) 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 * ~y~0 * ~y~0 + ~x~0; {4333#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:55:31,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {4333#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4333#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:55:31,011 INFO L272 TraceCheckUtils]: 39: Hoare triple {4333#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4214#true} is VALID [2022-04-27 14:55:31,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-27 14:55:31,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-27 14:55:31,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-27 14:55:31,012 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4214#true} {4333#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {4333#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:55:31,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {4333#(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 * ~y~0 * ~y~0 + ~x~0; {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:31,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:31,012 INFO L272 TraceCheckUtils]: 46: Hoare triple {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4214#true} is VALID [2022-04-27 14:55:31,012 INFO L290 TraceCheckUtils]: 47: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-27 14:55:31,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-27 14:55:31,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-27 14:55:31,014 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4214#true} {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #57#return; {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:31,014 INFO L290 TraceCheckUtils]: 51: Hoare triple {4355#(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 * ~y~0 * ~y~0 + ~x~0; {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:31,015 INFO L290 TraceCheckUtils]: 52: Hoare triple {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:31,015 INFO L272 TraceCheckUtils]: 53: Hoare triple {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4214#true} is VALID [2022-04-27 14:55:31,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-27 14:55:31,015 INFO L290 TraceCheckUtils]: 55: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-27 14:55:31,015 INFO L290 TraceCheckUtils]: 56: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-27 14:55:31,016 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4214#true} {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:31,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {4377#(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 * ~y~0 * ~y~0 + ~x~0; {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:55:31,017 INFO L290 TraceCheckUtils]: 59: Hoare triple {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:55:31,017 INFO L272 TraceCheckUtils]: 60: Hoare triple {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4214#true} is VALID [2022-04-27 14:55:31,017 INFO L290 TraceCheckUtils]: 61: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-27 14:55:31,017 INFO L290 TraceCheckUtils]: 62: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-27 14:55:31,017 INFO L290 TraceCheckUtils]: 63: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-27 14:55:31,017 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4214#true} {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #57#return; {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:55:31,018 INFO L290 TraceCheckUtils]: 65: Hoare triple {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~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 * ~y~0 * ~y~0 + ~x~0; {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:31,018 INFO L290 TraceCheckUtils]: 66: Hoare triple {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:31,018 INFO L272 TraceCheckUtils]: 67: Hoare triple {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4214#true} is VALID [2022-04-27 14:55:31,018 INFO L290 TraceCheckUtils]: 68: Hoare triple {4214#true} ~cond := #in~cond; {4431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:31,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {4431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:55:31,019 INFO L290 TraceCheckUtils]: 70: Hoare triple {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:55:31,020 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #57#return; {4442#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} is VALID [2022-04-27 14:55:31,020 INFO L290 TraceCheckUtils]: 72: Hoare triple {4442#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 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 * ~y~0 * ~y~0 + ~x~0; {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:55:31,021 INFO L290 TraceCheckUtils]: 73: Hoare triple {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} assume !false; {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:55:31,021 INFO L272 TraceCheckUtils]: 74: Hoare triple {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4214#true} is VALID [2022-04-27 14:55:31,021 INFO L290 TraceCheckUtils]: 75: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-27 14:55:31,021 INFO L290 TraceCheckUtils]: 76: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-27 14:55:31,021 INFO L290 TraceCheckUtils]: 77: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-27 14:55:31,024 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4214#true} {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} #57#return; {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:55:31,025 INFO L290 TraceCheckUtils]: 79: Hoare triple {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} assume !(~c~0 < ~k~0); {4468#(and (< 7 main_~k~0) (= main_~y~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (<= main_~k~0 8))} is VALID [2022-04-27 14:55:31,025 INFO L272 TraceCheckUtils]: 80: Hoare triple {4468#(and (< 7 main_~k~0) (= main_~y~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4214#true} is VALID [2022-04-27 14:55:31,025 INFO L290 TraceCheckUtils]: 81: Hoare triple {4214#true} ~cond := #in~cond; {4431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:31,025 INFO L290 TraceCheckUtils]: 82: Hoare triple {4431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:55:31,026 INFO L290 TraceCheckUtils]: 83: Hoare triple {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:55:31,027 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} {4468#(and (< 7 main_~k~0) (= main_~y~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (<= main_~k~0 8))} #59#return; {4484#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:55:31,027 INFO L272 TraceCheckUtils]: 85: Hoare triple {4484#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:31,028 INFO L290 TraceCheckUtils]: 86: Hoare triple {4488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:31,029 INFO L290 TraceCheckUtils]: 87: Hoare triple {4492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4215#false} is VALID [2022-04-27 14:55:31,029 INFO L290 TraceCheckUtils]: 88: Hoare triple {4215#false} assume !false; {4215#false} is VALID [2022-04-27 14:55:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 63 proven. 113 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-27 14:55:31,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:56:12,113 WARN L833 $PredicateComparison]: unable to prove that (or (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) (* (- 5) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 6) 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)) 12) 0)) (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)))))) is different from false [2022-04-27 14:56:12,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:12,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186865298] [2022-04-27 14:56:12,116 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:12,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951149914] [2022-04-27 14:56:12,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951149914] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:56:12,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:56:12,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-27 14:56:12,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550642315] [2022-04-27 14:56:12,117 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:56:12,117 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-27 14:56:12,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:12,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:56:12,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:12,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 14:56:12,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:12,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 14:56:12,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=434, Unknown=3, NotChecked=42, Total=552 [2022-04-27 14:56:12,171 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:56:13,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:13,954 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-27 14:56:13,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:56:13,954 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-27 14:56:13,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:56:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-04-27 14:56:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:56:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-04-27 14:56:13,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 70 transitions. [2022-04-27 14:56:14,026 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:56:14,027 INFO L225 Difference]: With dead ends: 63 [2022-04-27 14:56:14,027 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 14:56:14,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=94, Invalid=557, Unknown=3, NotChecked=48, Total=702 [2022-04-27 14:56:14,028 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:14,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 383 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 14:56:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 14:56:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-27 14:56:14,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:14,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:56:14,053 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:56:14,054 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:56:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:14,056 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-27 14:56:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 14:56:14,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:14,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:14,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-27 14:56:14,057 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-27 14:56:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:14,058 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-27 14:56:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 14:56:14,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:14,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:14,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:14,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:56:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-27 14:56:14,062 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-27 14:56:14,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:14,062 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-27 14:56:14,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:56:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 14:56:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-27 14:56:14,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:14,068 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:14,075 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:56:14,275 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:56:14,276 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:14,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:14,276 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 9 times [2022-04-27 14:56:14,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:14,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469306843] [2022-04-27 14:56:14,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:14,292 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:14,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434460287] [2022-04-27 14:56:14,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:56:14,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:14,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:14,294 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:56:14,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process