/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:48:05,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:48:05,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:48:05,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:48:05,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:48:05,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:48:05,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:48:05,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:48:05,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:48:05,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:48:05,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:48:05,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:48:05,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:48:05,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:48:05,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:48:05,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:48:05,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:48:05,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:48:05,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:48:05,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:48:05,179 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:48:05,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:48:05,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:48:05,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:48:05,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:48:05,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:48:05,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:48:05,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:48:05,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:48:05,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:48:05,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:48:05,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:48:05,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:48:05,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:48:05,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:48:05,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:48:05,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:48:05,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:48:05,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:48:05,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:48:05,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:48:05,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:48:05,193 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:48:05,215 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:48:05,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:48:05,215 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:48:05,215 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:48:05,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:48:05,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:48:05,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:48:05,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:48:05,217 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:48:05,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:48:05,217 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:48:05,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:48:05,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:48:05,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:48:05,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:48:05,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:48:05,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:48:05,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:48:05,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:48:05,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:48:05,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:48:05,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:48:05,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:48:05,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:48:05,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:48:05,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:48:05,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:48:05,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:48:05,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:48:05,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:48:05,221 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:48:05,221 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:48:05,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:48:05,221 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:48:05,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:48:05,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:48:05,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:48:05,474 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:48:05,476 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:48:05,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c [2022-04-27 14:48:05,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed605f0f9/37871031ac7d44149db6e415806591ec/FLAG71658463a [2022-04-27 14:48:05,988 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:48:05,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c [2022-04-27 14:48:05,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed605f0f9/37871031ac7d44149db6e415806591ec/FLAG71658463a [2022-04-27 14:48:06,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed605f0f9/37871031ac7d44149db6e415806591ec [2022-04-27 14:48:06,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:48:06,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:48:06,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:48:06,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:48:06,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:48:06,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:48:06" (1/1) ... [2022-04-27 14:48:06,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b47d3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:48:06, skipping insertion in model container [2022-04-27 14:48:06,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:48:06" (1/1) ... [2022-04-27 14:48:06,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:48:06,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:48:06,243 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_unwindbound10.c[458,471] [2022-04-27 14:48:06,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:48:06,269 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:48:06,279 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_unwindbound10.c[458,471] [2022-04-27 14:48:06,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:48:06,298 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:48:06,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:48:06 WrapperNode [2022-04-27 14:48:06,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:48:06,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:48:06,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:48:06,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:48:06,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:48:06" (1/1) ... [2022-04-27 14:48:06,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:48:06" (1/1) ... [2022-04-27 14:48:06,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:48:06" (1/1) ... [2022-04-27 14:48:06,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:48:06" (1/1) ... [2022-04-27 14:48:06,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:48:06" (1/1) ... [2022-04-27 14:48:06,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:48:06" (1/1) ... [2022-04-27 14:48:06,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:48:06" (1/1) ... [2022-04-27 14:48:06,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:48:06,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:48:06,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:48:06,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:48:06,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:48:06" (1/1) ... [2022-04-27 14:48:06,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:48:06,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:48:06,352 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:48:06,382 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:48:06,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:48:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:48:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:48:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:48:06,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:48:06,412 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:48:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:48:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:48:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:48:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:48:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:48:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:48:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:48:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:48:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:48:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:48:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:48:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:48:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:48:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:48:06,476 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:48:06,478 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:48:06,662 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:48:06,669 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:48:06,669 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:48:06,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:48:06 BoogieIcfgContainer [2022-04-27 14:48:06,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:48:06,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:48:06,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:48:06,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:48:06,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:48:06" (1/3) ... [2022-04-27 14:48:06,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5ffe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:48:06, skipping insertion in model container [2022-04-27 14:48:06,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:48:06" (2/3) ... [2022-04-27 14:48:06,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5ffe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:48:06, skipping insertion in model container [2022-04-27 14:48:06,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:48:06" (3/3) ... [2022-04-27 14:48:06,678 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound10.c [2022-04-27 14:48:06,690 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:48:06,690 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:48:06,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:48:06,758 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@1d2ed096, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@320c272c [2022-04-27 14:48:06,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:48:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:48:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:48:06,782 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:48:06,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:48:06,783 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:48:06,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:48:06,791 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-27 14:48:06,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:48:06,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339042270] [2022-04-27 14:48:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:48:06,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:48:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:48:07,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:48:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:48:07,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-27 14:48:07,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:48:07,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-27 14:48:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:48:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:48:07,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:48:07,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:48:07,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:48:07,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:48:07,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:48:07,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-27 14:48:07,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:48:07,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-27 14:48:07,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-27 14:48:07,060 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:48:07,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-27 14:48:07,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:48:07,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:48:07,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:48:07,062 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:48:07,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-27 14:48:07,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-27 14:48:07,063 INFO L272 TraceCheckUtils]: 13: 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:48:07,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 14:48:07,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 14:48:07,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 14:48:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:48:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:48:07,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339042270] [2022-04-27 14:48:07,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339042270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:48:07,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:48:07,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:48:07,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355632768] [2022-04-27 14:48:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:48:07,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:48:07,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:48:07,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:48:07,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:48:07,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:48:07,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:48:07,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:48:07,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:48:07,132 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:22,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25m for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 14:49:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:22,313 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-27 14:49:22,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:49:22,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:49:22,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-27 14:49:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-27 14:49:22,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-27 14:49:22,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:22,462 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:49:22,462 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 14:49:22,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:49:22,467 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:22,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 75.0s Time] [2022-04-27 14:49:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 14:49:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-27 14:49:22,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:22,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:22,495 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:22,495 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:22,501 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 14:49:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 14:49:22,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:22,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:22,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 14:49:22,503 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 14:49:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:22,507 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 14:49:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 14:49:22,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:22,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:22,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:22,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 14:49:22,519 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-27 14:49:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:22,526 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 14:49:22,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:49:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 14:49:22,527 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:22,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:22,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:49:22,528 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:22,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:22,528 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-27 14:49:22,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:22,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85340682] [2022-04-27 14:49:22,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:22,568 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:22,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406097333] [2022-04-27 14:49:22,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:22,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:22,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:22,576 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:49:22,585 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:49:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:22,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:49:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:22,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:49:22,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 14:49:22,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:22,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#(<= ~counter~0 0)} assume true; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:22,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#(<= ~counter~0 0)} {196#true} #61#return; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:22,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#(<= ~counter~0 0)} call #t~ret6 := main(); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:22,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:22,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {204#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:22,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#(<= ~counter~0 0)} ~cond := #in~cond; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:22,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(<= ~counter~0 0)} assume !(0 == ~cond); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:22,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#(<= ~counter~0 0)} assume true; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:22,786 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204#(<= ~counter~0 0)} {204#(<= ~counter~0 0)} #53#return; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:22,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:22,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {204#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {238#(<= |main_#t~post5| 0)} is VALID [2022-04-27 14:49:22,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {197#false} is VALID [2022-04-27 14:49:22,788 INFO L272 TraceCheckUtils]: 14: Hoare triple {197#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)); {197#false} is VALID [2022-04-27 14:49:22,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 14:49:22,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 14:49:22,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 14:49:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:49:22,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:49:22,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:49:22,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85340682] [2022-04-27 14:49:22,789 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:49:22,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406097333] [2022-04-27 14:49:22,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406097333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:49:22,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:49:22,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:49:22,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038801436] [2022-04-27 14:49:22,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:49:22,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 14:49:22,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:49:22,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:49:22,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:22,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:49:22,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:49:22,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:49:22,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:49:22,810 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:49:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:22,885 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:49:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:49:22,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 14:49:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:49:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:49:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:49:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:49:22,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 14:49:22,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:22,927 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:49:22,927 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:49:22,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:49:22,928 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:22,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:49:22,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:49:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:49:22,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:22,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:22,937 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:22,937 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:22,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:22,940 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:49:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:49:22,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:22,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:22,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:49:22,941 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:49:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:22,943 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:49:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:49:22,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:22,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:22,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:22,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 14:49:22,946 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-27 14:49:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:22,947 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 14:49:22,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:49:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:49:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 14:49:22,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:22,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:22,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 14:49:23,161 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:49:23,161 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:23,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:23,162 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-27 14:49:23,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:23,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900476894] [2022-04-27 14:49:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:23,177 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:23,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214182352] [2022-04-27 14:49:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:23,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:23,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:23,182 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:49:23,184 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:49:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:23,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:49:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:23,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:49:23,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2022-04-27 14:49:23,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {392#true} is VALID [2022-04-27 14:49:23,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {392#true} assume true; {392#true} is VALID [2022-04-27 14:49:23,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {392#true} {392#true} #61#return; {392#true} is VALID [2022-04-27 14:49:23,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {392#true} call #t~ret6 := main(); {392#true} is VALID [2022-04-27 14:49:23,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#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; {392#true} is VALID [2022-04-27 14:49:23,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {392#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {392#true} is VALID [2022-04-27 14:49:23,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2022-04-27 14:49:23,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2022-04-27 14:49:23,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#true} assume true; {392#true} is VALID [2022-04-27 14:49:23,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {392#true} {392#true} #53#return; {392#true} is VALID [2022-04-27 14:49:23,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {392#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:23,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:23,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:23,380 INFO L272 TraceCheckUtils]: 14: Hoare triple {430#(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)); {440#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:49:23,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {444#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:49:23,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {444#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {393#false} is VALID [2022-04-27 14:49:23,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#false} assume !false; {393#false} is VALID [2022-04-27 14:49:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:49:23,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:49:23,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:49:23,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900476894] [2022-04-27 14:49:23,382 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:49:23,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214182352] [2022-04-27 14:49:23,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214182352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:49:23,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:49:23,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:49:23,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141390586] [2022-04-27 14:49:23,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:49:23,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 14:49:23,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:49:23,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:23,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:23,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:49:23,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:49:23,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:49:23,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:49:23,402 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:23,648 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:49:23,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:49:23,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 14:49:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 14:49:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 14:49:23,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-27 14:49:23,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:23,703 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:49:23,704 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 14:49:23,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:49:23,707 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:23,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:49:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 14:49:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 14:49:23,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:23,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:49:23,722 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:49:23,723 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:49:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:23,725 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 14:49:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:49:23,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:23,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:23,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 14:49:23,726 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 14:49:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:23,728 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 14:49:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:49:23,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:23,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:23,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:23,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:49:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-27 14:49:23,731 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-27 14:49:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:23,731 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-27 14:49:23,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:49:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:49:23,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:23,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:23,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:49:23,959 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:49:23,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-27 14:49:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:23,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406749778] [2022-04-27 14:49:23,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:23,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:23,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784386116] [2022-04-27 14:49:23,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:23,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:23,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:23,978 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:49:23,979 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:49:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:24,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:49:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:24,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:49:24,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2022-04-27 14:49:24,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:24,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#(<= ~counter~0 0)} assume true; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:24,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#(<= ~counter~0 0)} {614#true} #61#return; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:24,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#(<= ~counter~0 0)} call #t~ret6 := main(); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:24,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:24,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {622#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:24,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {622#(<= ~counter~0 0)} ~cond := #in~cond; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:24,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {622#(<= ~counter~0 0)} assume !(0 == ~cond); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:24,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {622#(<= ~counter~0 0)} assume true; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:24,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {622#(<= ~counter~0 0)} {622#(<= ~counter~0 0)} #53#return; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:24,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {622#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:24,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {622#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:24,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:24,215 INFO L272 TraceCheckUtils]: 14: Hoare triple {656#(<= ~counter~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)); {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:24,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {656#(<= ~counter~0 1)} ~cond := #in~cond; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:24,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= ~counter~0 1)} assume !(0 == ~cond); {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:24,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {656#(<= ~counter~0 1)} assume true; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:24,223 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {656#(<= ~counter~0 1)} {656#(<= ~counter~0 1)} #55#return; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:24,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:24,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {681#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:49:24,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {615#false} is VALID [2022-04-27 14:49:24,225 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#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)); {615#false} is VALID [2022-04-27 14:49:24,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-27 14:49:24,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-27 14:49:24,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-27 14:49:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:49:24,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:49:24,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-27 14:49:24,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-27 14:49:24,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-27 14:49:24,408 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#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)); {615#false} is VALID [2022-04-27 14:49:24,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {709#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {615#false} is VALID [2022-04-27 14:49:24,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {713#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {709#(< |main_#t~post5| 10)} is VALID [2022-04-27 14:49:24,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {713#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {713#(< ~counter~0 10)} is VALID [2022-04-27 14:49:24,413 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {614#true} {713#(< ~counter~0 10)} #55#return; {713#(< ~counter~0 10)} is VALID [2022-04-27 14:49:24,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-27 14:49:24,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2022-04-27 14:49:24,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-04-27 14:49:24,416 INFO L272 TraceCheckUtils]: 14: Hoare triple {713#(< ~counter~0 10)} 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)); {614#true} is VALID [2022-04-27 14:49:24,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {713#(< ~counter~0 10)} is VALID [2022-04-27 14:49:24,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {738#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {713#(< ~counter~0 10)} is VALID [2022-04-27 14:49:24,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {738#(< ~counter~0 9)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {738#(< ~counter~0 9)} is VALID [2022-04-27 14:49:24,422 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {614#true} {738#(< ~counter~0 9)} #53#return; {738#(< ~counter~0 9)} is VALID [2022-04-27 14:49:24,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-27 14:49:24,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2022-04-27 14:49:24,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-04-27 14:49:24,427 INFO L272 TraceCheckUtils]: 6: Hoare triple {738#(< ~counter~0 9)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {614#true} is VALID [2022-04-27 14:49:24,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#(< ~counter~0 9)} 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; {738#(< ~counter~0 9)} is VALID [2022-04-27 14:49:24,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#(< ~counter~0 9)} call #t~ret6 := main(); {738#(< ~counter~0 9)} is VALID [2022-04-27 14:49:24,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#(< ~counter~0 9)} {614#true} #61#return; {738#(< ~counter~0 9)} is VALID [2022-04-27 14:49:24,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#(< ~counter~0 9)} assume true; {738#(< ~counter~0 9)} is VALID [2022-04-27 14:49:24,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {738#(< ~counter~0 9)} is VALID [2022-04-27 14:49:24,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2022-04-27 14:49:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:49:24,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:49:24,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406749778] [2022-04-27 14:49:24,432 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:49:24,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784386116] [2022-04-27 14:49:24,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784386116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:49:24,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:49:24,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:49:24,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10037213] [2022-04-27 14:49:24,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:49:24,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-27 14:49:24,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:49:24,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:49:24,482 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:49:24,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:49:24,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:49:24,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:49:24,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:49:24,484 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:49:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:24,719 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-27 14:49:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:49:24,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-27 14:49:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:49:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-27 14:49:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:49:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-27 14:49:24,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 76 transitions. [2022-04-27 14:49:24,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:24,814 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:49:24,814 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:49:24,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:49:24,817 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:24,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:49:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:49:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-04-27 14:49:24,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:24,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:49:24,843 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:49:24,843 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:49:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:24,848 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 14:49:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 14:49:24,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:24,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:24,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-27 14:49:24,849 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-27 14:49:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:24,852 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 14:49:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 14:49:24,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:24,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:24,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:24,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:49:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-27 14:49:24,856 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 26 [2022-04-27 14:49:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:24,856 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-27 14:49:24,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:49:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:49:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:49:24,857 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:24,858 INFO L195 NwaCegarLoop]: trace histogram [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:49:24,877 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:49:25,067 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:49:25,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-27 14:49:25,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:25,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281543189] [2022-04-27 14:49:25,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:25,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:25,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:25,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [22911738] [2022-04-27 14:49:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:25,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:25,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:25,087 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:49:25,099 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:49:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:25,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:49:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:25,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:49:25,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-27 14:49:25,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1072#true} is VALID [2022-04-27 14:49:25,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:49:25,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #61#return; {1072#true} is VALID [2022-04-27 14:49:25,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret6 := main(); {1072#true} is VALID [2022-04-27 14:49:25,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#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; {1072#true} is VALID [2022-04-27 14:49:25,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:49:25,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:49:25,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:49:25,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:49:25,300 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} #53#return; {1072#true} is VALID [2022-04-27 14:49:25,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:25,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:25,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:25,303 INFO L272 TraceCheckUtils]: 14: Hoare triple {1110#(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)); {1072#true} is VALID [2022-04-27 14:49:25,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:49:25,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:49:25,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:49:25,304 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1110#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:25,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {1110#(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; {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:49:25,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:49:25,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:49:25,307 INFO L272 TraceCheckUtils]: 22: Hoare triple {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~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)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:49:25,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:49:25,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1073#false} is VALID [2022-04-27 14:49:25,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-27 14:49:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:49:25,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:49:25,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-27 14:49:25,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1073#false} is VALID [2022-04-27 14:49:25,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:49:25,495 INFO L272 TraceCheckUtils]: 22: Hoare triple {1165#(= (+ (* 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)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:49:25,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#(= (+ (* 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 !!(#t~post5 < 10);havoc #t~post5; {1165#(= (+ (* 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:49:25,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#(= (+ (* 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)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1165#(= (+ (* 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:49:25,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#(= (+ (* 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; {1165#(= (+ (* 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:49:25,617 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1165#(= (+ (* 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)))} #55#return; {1165#(= (+ (* 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:49:25,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:49:25,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:49:25,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:49:25,618 INFO L272 TraceCheckUtils]: 14: Hoare triple {1165#(= (+ (* 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)); {1072#true} is VALID [2022-04-27 14:49:25,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {1165#(= (+ (* 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 !!(#t~post5 < 10);havoc #t~post5; {1165#(= (+ (* 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:49:25,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(= (+ (* 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)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1165#(= (+ (* 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:49:25,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1165#(= (+ (* 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:49:25,620 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} #53#return; {1072#true} is VALID [2022-04-27 14:49:25,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:49:25,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:49:25,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:49:25,620 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:49:25,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#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; {1072#true} is VALID [2022-04-27 14:49:25,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret6 := main(); {1072#true} is VALID [2022-04-27 14:49:25,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #61#return; {1072#true} is VALID [2022-04-27 14:49:25,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:49:25,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1072#true} is VALID [2022-04-27 14:49:25,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-27 14:49:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 14:49:25,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:49:25,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281543189] [2022-04-27 14:49:25,622 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:49:25,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22911738] [2022-04-27 14:49:25,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22911738] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:49:25,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:49:25,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:49:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848002065] [2022-04-27 14:49:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:49:25,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 14:49:25,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:49:25,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:49:25,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:25,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:49:25,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:49:25,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:49:25,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:49:25,700 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:49:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:25,840 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-27 14:49:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:49:25,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 14:49:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:49:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:49:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:49:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:49:25,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:49:26,015 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:49:26,016 INFO L225 Difference]: With dead ends: 68 [2022-04-27 14:49:26,017 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 14:49:26,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:49:26,017 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 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:49:26,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:49:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 14:49:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-27 14:49:26,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:26,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:49:26,045 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:49:26,046 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:49:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:26,051 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 14:49:26,051 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-27 14:49:26,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:26,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:26,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-27 14:49:26,053 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-27 14:49:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:26,055 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 14:49:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-27 14:49:26,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:26,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:26,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:26,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:49:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-04-27 14:49:26,058 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 26 [2022-04-27 14:49:26,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:26,059 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-04-27 14:49:26,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:49:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-27 14:49:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:49:26,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:26,060 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:26,070 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:49:26,268 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:49:26,268 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-27 14:49:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:26,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589098413] [2022-04-27 14:49:26,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:26,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:26,286 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:26,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1221576190] [2022-04-27 14:49:26,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:26,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:26,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:26,288 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:49:26,289 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:49:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:26,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:49:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:26,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:49:26,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1530#true} is VALID [2022-04-27 14:49:26,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1530#true} is VALID [2022-04-27 14:49:26,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:49:26,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1530#true} {1530#true} #61#return; {1530#true} is VALID [2022-04-27 14:49:26,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {1530#true} call #t~ret6 := main(); {1530#true} is VALID [2022-04-27 14:49:26,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {1530#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; {1530#true} is VALID [2022-04-27 14:49:26,688 INFO L272 TraceCheckUtils]: 6: Hoare triple {1530#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1530#true} is VALID [2022-04-27 14:49:26,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:49:26,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:49:26,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:49:26,689 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1530#true} {1530#true} #53#return; {1530#true} is VALID [2022-04-27 14:49:26,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {1530#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:26,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:26,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:26,697 INFO L272 TraceCheckUtils]: 14: Hoare triple {1568#(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)); {1530#true} is VALID [2022-04-27 14:49:26,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:49:26,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:49:26,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:49:26,698 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1530#true} {1568#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:26,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {1568#(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; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:49:26,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:49:26,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:49:26,700 INFO L272 TraceCheckUtils]: 22: Hoare triple {1593#(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)); {1530#true} is VALID [2022-04-27 14:49:26,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:49:26,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:49:26,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:49:26,701 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1530#true} {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:49:26,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:26,702 INFO L272 TraceCheckUtils]: 28: Hoare triple {1618#(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)); {1530#true} is VALID [2022-04-27 14:49:26,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:49:26,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:49:26,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:49:26,703 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1530#true} {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:26,704 INFO L272 TraceCheckUtils]: 33: Hoare triple {1618#(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)); {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:49:26,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:49:26,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {1641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1531#false} is VALID [2022-04-27 14:49:26,704 INFO L290 TraceCheckUtils]: 36: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2022-04-27 14:49:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:49:26,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:49:27,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:49:27,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589098413] [2022-04-27 14:49:27,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:49:27,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221576190] [2022-04-27 14:49:27,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221576190] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:49:27,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:49:27,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:49:27,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245671560] [2022-04-27 14:49:27,116 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:49:27,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:49:27,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:49:27,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:49:27,141 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:49:27,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:49:27,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:49:27,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:49:27,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:49:27,142 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:49:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:27,418 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-27 14:49:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:49:27,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:49:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:49:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 14:49:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:49:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 14:49:27,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-27 14:49:27,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:27,463 INFO L225 Difference]: With dead ends: 59 [2022-04-27 14:49:27,463 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 14:49:27,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 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:49:27,464 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:27,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:49:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 14:49:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-27 14:49:27,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:27,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:49:27,493 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:49:27,494 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:49:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:27,496 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 14:49:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:49:27,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:27,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:27,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 14:49:27,498 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 14:49:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:27,500 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 14:49:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:49:27,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:27,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:27,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:27,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:49:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-27 14:49:27,509 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 37 [2022-04-27 14:49:27,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:27,509 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-27 14:49:27,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:49:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:49:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 14:49:27,512 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:27,513 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:27,533 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:49:27,727 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:49:27,727 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:27,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 2 times [2022-04-27 14:49:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:27,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371726057] [2022-04-27 14:49:27,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:27,741 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:27,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199092468] [2022-04-27 14:49:27,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:49:27,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:27,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:27,742 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:49:27,763 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:49:27,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:49:27,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:49:27,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:49:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:27,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:49:28,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} call ULTIMATE.init(); {1978#true} is VALID [2022-04-27 14:49:28,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1978#true} is VALID [2022-04-27 14:49:28,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:49:28,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} #61#return; {1978#true} is VALID [2022-04-27 14:49:28,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} call #t~ret6 := main(); {1978#true} is VALID [2022-04-27 14:49:28,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#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; {1978#true} is VALID [2022-04-27 14:49:28,207 INFO L272 TraceCheckUtils]: 6: Hoare triple {1978#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:49:28,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:49:28,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:49:28,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:49:28,207 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1978#true} {1978#true} #53#return; {1978#true} is VALID [2022-04-27 14:49:28,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {1978#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:28,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:28,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:28,208 INFO L272 TraceCheckUtils]: 14: Hoare triple {2016#(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)); {1978#true} is VALID [2022-04-27 14:49:28,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:49:28,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:49:28,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:49:28,209 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1978#true} {2016#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:28,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {2016#(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; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:49:28,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:49:28,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:49:28,211 INFO L272 TraceCheckUtils]: 22: Hoare triple {2041#(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)); {1978#true} is VALID [2022-04-27 14:49:28,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:49:28,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:49:28,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:49:28,212 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1978#true} {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:49:28,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {2041#(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; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:49:28,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:49:28,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:49:28,214 INFO L272 TraceCheckUtils]: 30: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 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)); {1978#true} is VALID [2022-04-27 14:49:28,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:49:28,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:49:28,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:49:28,214 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1978#true} {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #55#return; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:49:28,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:49:28,215 INFO L272 TraceCheckUtils]: 36: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= 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)); {1978#true} is VALID [2022-04-27 14:49:28,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:49:28,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:49:28,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:49:28,216 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1978#true} {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} #57#return; {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:49:28,217 INFO L272 TraceCheckUtils]: 41: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:49:28,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2114#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:49:28,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {2114#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1979#false} is VALID [2022-04-27 14:49:28,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {1979#false} assume !false; {1979#false} is VALID [2022-04-27 14:49:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:49:28,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:49:28,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:49:28,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371726057] [2022-04-27 14:49:28,595 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:49:28,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199092468] [2022-04-27 14:49:28,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199092468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:49:28,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:49:28,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:49:28,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053061487] [2022-04-27 14:49:28,595 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:49:28,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-27 14:49:28,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:49:28,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:49:28,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:28,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:49:28,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:49:28,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:49:28,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:49:28,627 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:49:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:28,964 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-27 14:49:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:49:28,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-27 14:49:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:49:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-27 14:49:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:49:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-27 14:49:28,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-27 14:49:29,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:29,008 INFO L225 Difference]: With dead ends: 58 [2022-04-27 14:49:29,008 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:49:29,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:49:29,009 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:29,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:49:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:49:29,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 14:49:29,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:29,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:49:29,035 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:49:29,036 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:49:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:29,037 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:49:29,037 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:49:29,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:29,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:29,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 14:49:29,038 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 14:49:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:29,040 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:49:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:49:29,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:29,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:29,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:29,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:49:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-27 14:49:29,042 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2022-04-27 14:49:29,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:29,043 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-27 14:49:29,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:49:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:49:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 14:49:29,043 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:29,044 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:29,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 14:49:29,248 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:49:29,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:29,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:29,249 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 3 times [2022-04-27 14:49:29,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:29,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123765562] [2022-04-27 14:49:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:29,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:29,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:29,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75621801] [2022-04-27 14:49:29,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:49:29,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:29,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:29,275 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:49:29,276 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:49:29,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:49:29,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:49:29,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:49:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:29,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:49:30,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2022-04-27 14:49:30,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {2445#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2445#true} is VALID [2022-04-27 14:49:30,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:49:30,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #61#return; {2445#true} is VALID [2022-04-27 14:49:30,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret6 := main(); {2445#true} is VALID [2022-04-27 14:49:30,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {2445#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; {2445#true} is VALID [2022-04-27 14:49:30,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {2445#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2445#true} is VALID [2022-04-27 14:49:30,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:49:30,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:49:30,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:49:30,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2445#true} {2445#true} #53#return; {2445#true} is VALID [2022-04-27 14:49:30,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {2445#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:30,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:30,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:30,239 INFO L272 TraceCheckUtils]: 14: Hoare triple {2483#(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)); {2445#true} is VALID [2022-04-27 14:49:30,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:49:30,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:49:30,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:49:30,239 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2445#true} {2483#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:30,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {2483#(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; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:49:30,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:49:30,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:49:30,241 INFO L272 TraceCheckUtils]: 22: Hoare triple {2508#(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)); {2445#true} is VALID [2022-04-27 14:49:30,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:49:30,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:49:30,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:49:30,242 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2445#true} {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:49:30,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {2508#(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; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:49:30,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:49:30,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:49:30,243 INFO L272 TraceCheckUtils]: 30: Hoare triple {2533#(and (= main_~y~0 2) (= 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)); {2445#true} is VALID [2022-04-27 14:49:30,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {2445#true} ~cond := #in~cond; {2546#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:49:30,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {2546#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2550#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:49:30,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {2550#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2550#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:49:30,246 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2550#(not (= |__VERIFIER_assert_#in~cond| 0))} {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #55#return; {2557#(and (= main_~y~0 2) (= (+ (* 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))) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:49:30,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {2557#(and (= main_~y~0 2) (= (+ (* 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))) (= 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; {2561#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (= (+ (* main_~x~0 12) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) 5) (* 2 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) (* 6 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))))) (< 2 main_~k~0))} is VALID [2022-04-27 14:49:30,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {2561#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (= (+ (* main_~x~0 12) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) 5) (* 2 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) (* 6 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))))) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2561#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (= (+ (* main_~x~0 12) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) 5) (* 2 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) (* 6 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))))) (< 2 main_~k~0))} is VALID [2022-04-27 14:49:30,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {2561#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (= (+ (* main_~x~0 12) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) 5) (* 2 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) (* 6 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))))) (< 2 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {2561#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (= (+ (* main_~x~0 12) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) 5) (* 2 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) (* 6 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))))) (< 2 main_~k~0))} is VALID [2022-04-27 14:49:30,251 INFO L272 TraceCheckUtils]: 38: Hoare triple {2561#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (= (+ (* main_~x~0 12) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) 5) (* 2 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) (* 6 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~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)); {2445#true} is VALID [2022-04-27 14:49:30,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {2445#true} ~cond := #in~cond; {2546#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:49:30,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {2546#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2550#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:49:30,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2550#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:49:30,253 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2550#(not (= |__VERIFIER_assert_#in~cond| 0))} {2561#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (= (+ (* main_~x~0 12) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) 5) (* 2 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) (* 6 (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))))) (< 2 main_~k~0))} #55#return; {2583#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:49:30,254 INFO L290 TraceCheckUtils]: 43: Hoare triple {2583#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2587#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:49:30,254 INFO L272 TraceCheckUtils]: 44: Hoare triple {2587#(and (= main_~y~0 3) (<= main_~k~0 3) (< 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)); {2445#true} is VALID [2022-04-27 14:49:30,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:49:30,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:49:30,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:49:30,255 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2445#true} {2587#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} #57#return; {2587#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:49:30,255 INFO L272 TraceCheckUtils]: 49: Hoare triple {2587#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2606#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:49:30,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {2606#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2610#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:49:30,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {2610#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2446#false} is VALID [2022-04-27 14:49:30,256 INFO L290 TraceCheckUtils]: 52: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2022-04-27 14:49:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 14:49:30,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:49:49,183 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:49:49,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:49:49,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123765562] [2022-04-27 14:49:49,186 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:49:49,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75621801] [2022-04-27 14:49:49,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75621801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:49:49,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:49:49,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:49:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106326606] [2022-04-27 14:49:49,187 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:49:49,187 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-27 14:49:49,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:49:49,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:49:49,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:49,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:49:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:49:49,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:49:49,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2022-04-27 14:49:49,246 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:49:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:50,199 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-27 14:49:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:49:50,200 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-27 14:49:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:49:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:49:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:49:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:49:50,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-27 14:49:50,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:50,264 INFO L225 Difference]: With dead ends: 64 [2022-04-27 14:49:50,265 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:49:50,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=79, Invalid=344, Unknown=1, NotChecked=38, Total=462 [2022-04-27 14:49:50,266 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:50,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 248 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:49:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:49:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 14:49:50,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:50,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:49:50,302 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:49:50,304 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:49:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:50,308 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2022-04-27 14:49:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-27 14:49:50,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:50,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:50,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 58 states. [2022-04-27 14:49:50,309 INFO L87 Difference]: Start difference. First operand has 58 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 58 states. [2022-04-27 14:49:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:50,311 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2022-04-27 14:49:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-27 14:49:50,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:50,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:50,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:50,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:49:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-04-27 14:49:50,313 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 53 [2022-04-27 14:49:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:50,314 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-04-27 14:49:50,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:49:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-27 14:49:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 14:49:50,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:50,315 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:50,326 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:49:50,523 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:49:50,524 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:50,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 1 times [2022-04-27 14:49:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:50,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098530647] [2022-04-27 14:49:50,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:50,547 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:50,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797745348] [2022-04-27 14:49:50,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:50,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:50,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:50,548 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:49:50,556 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:49:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:50,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:49:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:50,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:49:50,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {2974#true} call ULTIMATE.init(); {2974#true} is VALID [2022-04-27 14:49:50,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {2974#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2982#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:50,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {2982#(<= ~counter~0 0)} assume true; {2982#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:50,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2982#(<= ~counter~0 0)} {2974#true} #61#return; {2982#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:50,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {2982#(<= ~counter~0 0)} call #t~ret6 := main(); {2982#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:50,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {2982#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2982#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:50,910 INFO L272 TraceCheckUtils]: 6: Hoare triple {2982#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2982#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:50,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {2982#(<= ~counter~0 0)} ~cond := #in~cond; {2982#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:50,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {2982#(<= ~counter~0 0)} assume !(0 == ~cond); {2982#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:50,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {2982#(<= ~counter~0 0)} assume true; {2982#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:50,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2982#(<= ~counter~0 0)} {2982#(<= ~counter~0 0)} #53#return; {2982#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:50,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {2982#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2982#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:50,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {2982#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3016#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:50,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {3016#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {3016#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:50,916 INFO L272 TraceCheckUtils]: 14: Hoare triple {3016#(<= ~counter~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)); {3016#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:50,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {3016#(<= ~counter~0 1)} ~cond := #in~cond; {3016#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:50,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {3016#(<= ~counter~0 1)} assume !(0 == ~cond); {3016#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:50,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {3016#(<= ~counter~0 1)} assume true; {3016#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:50,917 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3016#(<= ~counter~0 1)} {3016#(<= ~counter~0 1)} #55#return; {3016#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:50,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {3016#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3016#(<= ~counter~0 1)} is VALID [2022-04-27 14:49:50,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {3016#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3041#(<= ~counter~0 2)} is VALID [2022-04-27 14:49:50,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {3041#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {3041#(<= ~counter~0 2)} is VALID [2022-04-27 14:49:50,919 INFO L272 TraceCheckUtils]: 22: Hoare triple {3041#(<= ~counter~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)); {3041#(<= ~counter~0 2)} is VALID [2022-04-27 14:49:50,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {3041#(<= ~counter~0 2)} ~cond := #in~cond; {3041#(<= ~counter~0 2)} is VALID [2022-04-27 14:49:50,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {3041#(<= ~counter~0 2)} assume !(0 == ~cond); {3041#(<= ~counter~0 2)} is VALID [2022-04-27 14:49:50,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {3041#(<= ~counter~0 2)} assume true; {3041#(<= ~counter~0 2)} is VALID [2022-04-27 14:49:50,920 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3041#(<= ~counter~0 2)} {3041#(<= ~counter~0 2)} #55#return; {3041#(<= ~counter~0 2)} is VALID [2022-04-27 14:49:50,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {3041#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3041#(<= ~counter~0 2)} is VALID [2022-04-27 14:49:50,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {3041#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3066#(<= ~counter~0 3)} is VALID [2022-04-27 14:49:50,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {3066#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {3066#(<= ~counter~0 3)} is VALID [2022-04-27 14:49:50,922 INFO L272 TraceCheckUtils]: 30: Hoare triple {3066#(<= ~counter~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)); {3066#(<= ~counter~0 3)} is VALID [2022-04-27 14:49:50,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {3066#(<= ~counter~0 3)} ~cond := #in~cond; {3066#(<= ~counter~0 3)} is VALID [2022-04-27 14:49:50,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {3066#(<= ~counter~0 3)} assume !(0 == ~cond); {3066#(<= ~counter~0 3)} is VALID [2022-04-27 14:49:50,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {3066#(<= ~counter~0 3)} assume true; {3066#(<= ~counter~0 3)} is VALID [2022-04-27 14:49:50,928 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3066#(<= ~counter~0 3)} {3066#(<= ~counter~0 3)} #55#return; {3066#(<= ~counter~0 3)} is VALID [2022-04-27 14:49:50,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {3066#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3066#(<= ~counter~0 3)} is VALID [2022-04-27 14:49:50,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {3066#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3091#(<= ~counter~0 4)} is VALID [2022-04-27 14:49:50,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {3091#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {3091#(<= ~counter~0 4)} is VALID [2022-04-27 14:49:50,930 INFO L272 TraceCheckUtils]: 38: Hoare triple {3091#(<= ~counter~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)); {3091#(<= ~counter~0 4)} is VALID [2022-04-27 14:49:50,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {3091#(<= ~counter~0 4)} ~cond := #in~cond; {3091#(<= ~counter~0 4)} is VALID [2022-04-27 14:49:50,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {3091#(<= ~counter~0 4)} assume !(0 == ~cond); {3091#(<= ~counter~0 4)} is VALID [2022-04-27 14:49:50,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {3091#(<= ~counter~0 4)} assume true; {3091#(<= ~counter~0 4)} is VALID [2022-04-27 14:49:50,932 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3091#(<= ~counter~0 4)} {3091#(<= ~counter~0 4)} #55#return; {3091#(<= ~counter~0 4)} is VALID [2022-04-27 14:49:50,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {3091#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3091#(<= ~counter~0 4)} is VALID [2022-04-27 14:49:50,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {3091#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3116#(<= |main_#t~post5| 4)} is VALID [2022-04-27 14:49:50,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {3116#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {2975#false} is VALID [2022-04-27 14:49:50,933 INFO L272 TraceCheckUtils]: 46: Hoare triple {2975#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)); {2975#false} is VALID [2022-04-27 14:49:50,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {2975#false} ~cond := #in~cond; {2975#false} is VALID [2022-04-27 14:49:50,933 INFO L290 TraceCheckUtils]: 48: Hoare triple {2975#false} assume !(0 == ~cond); {2975#false} is VALID [2022-04-27 14:49:50,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {2975#false} assume true; {2975#false} is VALID [2022-04-27 14:49:50,933 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2975#false} {2975#false} #57#return; {2975#false} is VALID [2022-04-27 14:49:50,933 INFO L272 TraceCheckUtils]: 51: Hoare triple {2975#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2975#false} is VALID [2022-04-27 14:49:50,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {2975#false} ~cond := #in~cond; {2975#false} is VALID [2022-04-27 14:49:50,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {2975#false} assume 0 == ~cond; {2975#false} is VALID [2022-04-27 14:49:50,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {2975#false} assume !false; {2975#false} is VALID [2022-04-27 14:49:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 14:49:50,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:49:51,268 INFO L290 TraceCheckUtils]: 54: Hoare triple {2975#false} assume !false; {2975#false} is VALID [2022-04-27 14:49:51,269 INFO L290 TraceCheckUtils]: 53: Hoare triple {2975#false} assume 0 == ~cond; {2975#false} is VALID [2022-04-27 14:49:51,269 INFO L290 TraceCheckUtils]: 52: Hoare triple {2975#false} ~cond := #in~cond; {2975#false} is VALID [2022-04-27 14:49:51,269 INFO L272 TraceCheckUtils]: 51: Hoare triple {2975#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2975#false} is VALID [2022-04-27 14:49:51,269 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2974#true} {2975#false} #57#return; {2975#false} is VALID [2022-04-27 14:49:51,269 INFO L290 TraceCheckUtils]: 49: Hoare triple {2974#true} assume true; {2974#true} is VALID [2022-04-27 14:49:51,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {2974#true} assume !(0 == ~cond); {2974#true} is VALID [2022-04-27 14:49:51,269 INFO L290 TraceCheckUtils]: 47: Hoare triple {2974#true} ~cond := #in~cond; {2974#true} is VALID [2022-04-27 14:49:51,269 INFO L272 TraceCheckUtils]: 46: Hoare triple {2975#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)); {2974#true} is VALID [2022-04-27 14:49:51,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {3174#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {2975#false} is VALID [2022-04-27 14:49:51,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {3178#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3174#(< |main_#t~post5| 10)} is VALID [2022-04-27 14:49:51,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {3178#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3178#(< ~counter~0 10)} is VALID [2022-04-27 14:49:51,272 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2974#true} {3178#(< ~counter~0 10)} #55#return; {3178#(< ~counter~0 10)} is VALID [2022-04-27 14:49:51,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {2974#true} assume true; {2974#true} is VALID [2022-04-27 14:49:51,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {2974#true} assume !(0 == ~cond); {2974#true} is VALID [2022-04-27 14:49:51,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {2974#true} ~cond := #in~cond; {2974#true} is VALID [2022-04-27 14:49:51,272 INFO L272 TraceCheckUtils]: 38: Hoare triple {3178#(< ~counter~0 10)} 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)); {2974#true} is VALID [2022-04-27 14:49:51,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {3178#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {3178#(< ~counter~0 10)} is VALID [2022-04-27 14:49:51,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {3203#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3178#(< ~counter~0 10)} is VALID [2022-04-27 14:49:51,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {3203#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3203#(< ~counter~0 9)} is VALID [2022-04-27 14:49:51,281 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2974#true} {3203#(< ~counter~0 9)} #55#return; {3203#(< ~counter~0 9)} is VALID [2022-04-27 14:49:51,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {2974#true} assume true; {2974#true} is VALID [2022-04-27 14:49:51,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {2974#true} assume !(0 == ~cond); {2974#true} is VALID [2022-04-27 14:49:51,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {2974#true} ~cond := #in~cond; {2974#true} is VALID [2022-04-27 14:49:51,281 INFO L272 TraceCheckUtils]: 30: Hoare triple {3203#(< ~counter~0 9)} 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)); {2974#true} is VALID [2022-04-27 14:49:51,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {3203#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {3203#(< ~counter~0 9)} is VALID [2022-04-27 14:49:51,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {3228#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3203#(< ~counter~0 9)} is VALID [2022-04-27 14:49:51,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {3228#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3228#(< ~counter~0 8)} is VALID [2022-04-27 14:49:51,283 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2974#true} {3228#(< ~counter~0 8)} #55#return; {3228#(< ~counter~0 8)} is VALID [2022-04-27 14:49:51,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {2974#true} assume true; {2974#true} is VALID [2022-04-27 14:49:51,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {2974#true} assume !(0 == ~cond); {2974#true} is VALID [2022-04-27 14:49:51,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {2974#true} ~cond := #in~cond; {2974#true} is VALID [2022-04-27 14:49:51,284 INFO L272 TraceCheckUtils]: 22: Hoare triple {3228#(< ~counter~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)); {2974#true} is VALID [2022-04-27 14:49:51,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {3228#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {3228#(< ~counter~0 8)} is VALID [2022-04-27 14:49:51,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {3253#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3228#(< ~counter~0 8)} is VALID [2022-04-27 14:49:51,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {3253#(< ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3253#(< ~counter~0 7)} is VALID [2022-04-27 14:49:51,286 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2974#true} {3253#(< ~counter~0 7)} #55#return; {3253#(< ~counter~0 7)} is VALID [2022-04-27 14:49:51,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {2974#true} assume true; {2974#true} is VALID [2022-04-27 14:49:51,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {2974#true} assume !(0 == ~cond); {2974#true} is VALID [2022-04-27 14:49:51,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {2974#true} ~cond := #in~cond; {2974#true} is VALID [2022-04-27 14:49:51,286 INFO L272 TraceCheckUtils]: 14: Hoare triple {3253#(< ~counter~0 7)} 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)); {2974#true} is VALID [2022-04-27 14:49:51,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {3253#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {3253#(< ~counter~0 7)} is VALID [2022-04-27 14:49:51,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {3278#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3253#(< ~counter~0 7)} is VALID [2022-04-27 14:49:51,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {3278#(< ~counter~0 6)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3278#(< ~counter~0 6)} is VALID [2022-04-27 14:49:51,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2974#true} {3278#(< ~counter~0 6)} #53#return; {3278#(< ~counter~0 6)} is VALID [2022-04-27 14:49:51,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {2974#true} assume true; {2974#true} is VALID [2022-04-27 14:49:51,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {2974#true} assume !(0 == ~cond); {2974#true} is VALID [2022-04-27 14:49:51,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {2974#true} ~cond := #in~cond; {2974#true} is VALID [2022-04-27 14:49:51,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {3278#(< ~counter~0 6)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2974#true} is VALID [2022-04-27 14:49:51,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {3278#(< ~counter~0 6)} 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; {3278#(< ~counter~0 6)} is VALID [2022-04-27 14:49:51,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {3278#(< ~counter~0 6)} call #t~ret6 := main(); {3278#(< ~counter~0 6)} is VALID [2022-04-27 14:49:51,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3278#(< ~counter~0 6)} {2974#true} #61#return; {3278#(< ~counter~0 6)} is VALID [2022-04-27 14:49:51,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {3278#(< ~counter~0 6)} assume true; {3278#(< ~counter~0 6)} is VALID [2022-04-27 14:49:51,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {2974#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3278#(< ~counter~0 6)} is VALID [2022-04-27 14:49:51,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {2974#true} call ULTIMATE.init(); {2974#true} is VALID [2022-04-27 14:49:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:49:51,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:49:51,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098530647] [2022-04-27 14:49:51,291 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:49:51,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797745348] [2022-04-27 14:49:51,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797745348] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:49:51,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:49:51,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 14:49:51,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554107370] [2022-04-27 14:49:51,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:49:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 55 [2022-04-27 14:49:51,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:49:51,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:49:51,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:51,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:49:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:49:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:49:51,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:49:51,366 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:49:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:51,949 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2022-04-27 14:49:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:49:51,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 55 [2022-04-27 14:49:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:49:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 145 transitions. [2022-04-27 14:49:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:49:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 145 transitions. [2022-04-27 14:49:51,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 145 transitions. [2022-04-27 14:49:52,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:52,083 INFO L225 Difference]: With dead ends: 140 [2022-04-27 14:49:52,084 INFO L226 Difference]: Without dead ends: 130 [2022-04-27 14:49:52,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:49:52,085 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 110 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:52,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 153 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:49:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-27 14:49:52,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2022-04-27 14:49:52,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:52,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:49:52,144 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:49:52,144 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:49:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:52,148 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-27 14:49:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-27 14:49:52,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:52,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:52,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 130 states. [2022-04-27 14:49:52,149 INFO L87 Difference]: Start difference. First operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 130 states. [2022-04-27 14:49:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:52,152 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-27 14:49:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-27 14:49:52,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:52,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:52,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:52,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:49:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-04-27 14:49:52,156 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 55 [2022-04-27 14:49:52,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:52,156 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-04-27 14:49:52,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:49:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-04-27 14:49:52,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 14:49:52,157 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:52,158 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:52,177 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:49:52,367 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:49:52,368 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 4 times [2022-04-27 14:49:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:52,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922003977] [2022-04-27 14:49:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:52,381 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:52,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799269268] [2022-04-27 14:49:52,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:49:52,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:52,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:52,383 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:49:52,395 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:49:52,438 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:49:52,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:49:52,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:49:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:52,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:49:52,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {3944#true} call ULTIMATE.init(); {3944#true} is VALID [2022-04-27 14:49:52,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {3944#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3944#true} is VALID [2022-04-27 14:49:52,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {3944#true} assume true; {3944#true} is VALID [2022-04-27 14:49:52,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3944#true} {3944#true} #61#return; {3944#true} is VALID [2022-04-27 14:49:52,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {3944#true} call #t~ret6 := main(); {3944#true} is VALID [2022-04-27 14:49:52,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {3944#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; {3944#true} is VALID [2022-04-27 14:49:52,863 INFO L272 TraceCheckUtils]: 6: Hoare triple {3944#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3944#true} is VALID [2022-04-27 14:49:52,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {3944#true} ~cond := #in~cond; {3944#true} is VALID [2022-04-27 14:49:52,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {3944#true} assume !(0 == ~cond); {3944#true} is VALID [2022-04-27 14:49:52,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {3944#true} assume true; {3944#true} is VALID [2022-04-27 14:49:52,863 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3944#true} {3944#true} #53#return; {3944#true} is VALID [2022-04-27 14:49:52,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {3944#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:52,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {3982#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:52,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {3982#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {3982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:52,865 INFO L272 TraceCheckUtils]: 14: Hoare triple {3982#(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)); {3944#true} is VALID [2022-04-27 14:49:52,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {3944#true} ~cond := #in~cond; {3944#true} is VALID [2022-04-27 14:49:52,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {3944#true} assume !(0 == ~cond); {3944#true} is VALID [2022-04-27 14:49:52,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {3944#true} assume true; {3944#true} is VALID [2022-04-27 14:49:52,865 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3944#true} {3982#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3982#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:52,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {3982#(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; {4007#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:49:52,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {4007#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4007#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:49:52,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {4007#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {4007#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:49:52,867 INFO L272 TraceCheckUtils]: 22: Hoare triple {4007#(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)); {3944#true} is VALID [2022-04-27 14:49:52,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {3944#true} ~cond := #in~cond; {3944#true} is VALID [2022-04-27 14:49:52,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {3944#true} assume !(0 == ~cond); {3944#true} is VALID [2022-04-27 14:49:52,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {3944#true} assume true; {3944#true} is VALID [2022-04-27 14:49:52,868 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3944#true} {4007#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {4007#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:49:52,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {4007#(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; {4032#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:49:52,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {4032#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4032#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:49:52,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {4032#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {4032#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:49:52,870 INFO L272 TraceCheckUtils]: 30: Hoare triple {4032#(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)); {3944#true} is VALID [2022-04-27 14:49:52,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {3944#true} ~cond := #in~cond; {3944#true} is VALID [2022-04-27 14:49:52,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {3944#true} assume !(0 == ~cond); {3944#true} is VALID [2022-04-27 14:49:52,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {3944#true} assume true; {3944#true} is VALID [2022-04-27 14:49:52,871 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3944#true} {4032#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {4032#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:49:52,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {4032#(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; {4057#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:49:52,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {4057#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4057#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:49:52,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {4057#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {4057#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:49:52,872 INFO L272 TraceCheckUtils]: 38: Hoare triple {4057#(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)); {3944#true} is VALID [2022-04-27 14:49:52,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {3944#true} ~cond := #in~cond; {3944#true} is VALID [2022-04-27 14:49:52,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {3944#true} assume !(0 == ~cond); {3944#true} is VALID [2022-04-27 14:49:52,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {3944#true} assume true; {3944#true} is VALID [2022-04-27 14:49:52,873 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3944#true} {4057#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {4057#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:49:52,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {4057#(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; {4082#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:49:52,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {4082#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4082#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:49:52,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {4082#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {4082#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:49:52,874 INFO L272 TraceCheckUtils]: 46: Hoare triple {4082#(and (= 3 (+ (- 1) main_~y~0)) (< 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)); {3944#true} is VALID [2022-04-27 14:49:52,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {3944#true} ~cond := #in~cond; {3944#true} is VALID [2022-04-27 14:49:52,874 INFO L290 TraceCheckUtils]: 48: Hoare triple {3944#true} assume !(0 == ~cond); {3944#true} is VALID [2022-04-27 14:49:52,874 INFO L290 TraceCheckUtils]: 49: Hoare triple {3944#true} assume true; {3944#true} is VALID [2022-04-27 14:49:52,875 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3944#true} {4082#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {4082#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:49:52,875 INFO L290 TraceCheckUtils]: 51: Hoare triple {4082#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {4107#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:49:52,875 INFO L272 TraceCheckUtils]: 52: Hoare triple {4107#(and (= 3 (+ (- 1) main_~y~0)) (< 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)); {3944#true} is VALID [2022-04-27 14:49:52,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {3944#true} ~cond := #in~cond; {3944#true} is VALID [2022-04-27 14:49:52,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {3944#true} assume !(0 == ~cond); {3944#true} is VALID [2022-04-27 14:49:52,876 INFO L290 TraceCheckUtils]: 55: Hoare triple {3944#true} assume true; {3944#true} is VALID [2022-04-27 14:49:52,876 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3944#true} {4107#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {4107#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:49:52,877 INFO L272 TraceCheckUtils]: 57: Hoare triple {4107#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:49:52,877 INFO L290 TraceCheckUtils]: 58: Hoare triple {4126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:49:52,877 INFO L290 TraceCheckUtils]: 59: Hoare triple {4130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3945#false} is VALID [2022-04-27 14:49:52,877 INFO L290 TraceCheckUtils]: 60: Hoare triple {3945#false} assume !false; {3945#false} is VALID [2022-04-27 14:49:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:49:52,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:49:53,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:49:53,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922003977] [2022-04-27 14:49:53,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:49:53,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799269268] [2022-04-27 14:49:53,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799269268] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:49:53,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:49:53,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:49:53,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80761957] [2022-04-27 14:49:53,208 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:49:53,209 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-27 14:49:53,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:49:53,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:49:53,275 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:49:53,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:49:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:49:53,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:49:53,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:49:53,276 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:49:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:53,777 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 14:49:53,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:49:53,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-27 14:49:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:49:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-27 14:49:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:49:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-27 14:49:53,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-27 14:49:53,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:53,829 INFO L225 Difference]: With dead ends: 110 [2022-04-27 14:49:53,829 INFO L226 Difference]: Without dead ends: 104 [2022-04-27 14:49:53,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:49:53,830 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:53,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 267 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:49:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-27 14:49:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-04-27 14:49:53,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:53,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:49:53,882 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:49:53,882 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:49:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:53,885 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-27 14:49:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-27 14:49:53,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:53,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:53,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 104 states. [2022-04-27 14:49:53,886 INFO L87 Difference]: Start difference. First operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 104 states. [2022-04-27 14:49:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:53,889 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-27 14:49:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-27 14:49:53,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:53,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:53,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:53,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:49:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2022-04-27 14:49:53,892 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 61 [2022-04-27 14:49:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:53,892 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2022-04-27 14:49:53,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:49:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-27 14:49:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 14:49:53,893 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:53,893 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:53,927 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:49:54,107 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:49:54,108 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:54,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:54,108 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 5 times [2022-04-27 14:49:54,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:54,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035691480] [2022-04-27 14:49:54,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:54,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:54,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:54,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801444545] [2022-04-27 14:49:54,124 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:49:54,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:54,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:54,126 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:49:54,132 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:49:54,542 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:49:54,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:49:54,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:49:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:54,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:49:54,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {4713#true} call ULTIMATE.init(); {4713#true} is VALID [2022-04-27 14:49:54,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {4713#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4713#true} is VALID [2022-04-27 14:49:54,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-27 14:49:54,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4713#true} {4713#true} #61#return; {4713#true} is VALID [2022-04-27 14:49:54,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {4713#true} call #t~ret6 := main(); {4713#true} is VALID [2022-04-27 14:49:54,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {4713#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; {4713#true} is VALID [2022-04-27 14:49:54,961 INFO L272 TraceCheckUtils]: 6: Hoare triple {4713#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4713#true} is VALID [2022-04-27 14:49:54,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {4713#true} ~cond := #in~cond; {4713#true} is VALID [2022-04-27 14:49:54,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {4713#true} assume !(0 == ~cond); {4713#true} is VALID [2022-04-27 14:49:54,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-27 14:49:54,961 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4713#true} {4713#true} #53#return; {4713#true} is VALID [2022-04-27 14:49:54,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {4713#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4751#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:54,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {4751#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4751#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:54,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {4751#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4751#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:54,962 INFO L272 TraceCheckUtils]: 14: Hoare triple {4751#(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)); {4713#true} is VALID [2022-04-27 14:49:54,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {4713#true} ~cond := #in~cond; {4713#true} is VALID [2022-04-27 14:49:54,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {4713#true} assume !(0 == ~cond); {4713#true} is VALID [2022-04-27 14:49:54,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-27 14:49:54,963 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4713#true} {4751#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4751#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:54,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {4751#(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; {4776#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:49:54,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {4776#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4776#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:49:54,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {4776#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {4776#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:49:54,968 INFO L272 TraceCheckUtils]: 22: Hoare triple {4776#(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)); {4713#true} is VALID [2022-04-27 14:49:54,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {4713#true} ~cond := #in~cond; {4713#true} is VALID [2022-04-27 14:49:54,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {4713#true} assume !(0 == ~cond); {4713#true} is VALID [2022-04-27 14:49:54,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-27 14:49:54,969 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4713#true} {4776#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {4776#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:49:54,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {4776#(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; {4801#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:49:54,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {4801#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4801#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:49:54,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {4801#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {4801#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:49:54,970 INFO L272 TraceCheckUtils]: 30: Hoare triple {4801#(and (= (+ (- 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)); {4713#true} is VALID [2022-04-27 14:49:54,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {4713#true} ~cond := #in~cond; {4713#true} is VALID [2022-04-27 14:49:54,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {4713#true} assume !(0 == ~cond); {4713#true} is VALID [2022-04-27 14:49:54,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-27 14:49:54,971 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4713#true} {4801#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #55#return; {4801#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:49:54,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {4801#(and (= (+ (- 1) main_~y~0) 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; {4826#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:49:54,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {4826#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4826#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:49:54,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {4826#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {4826#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:49:54,973 INFO L272 TraceCheckUtils]: 38: Hoare triple {4826#(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)); {4713#true} is VALID [2022-04-27 14:49:54,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {4713#true} ~cond := #in~cond; {4713#true} is VALID [2022-04-27 14:49:54,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {4713#true} assume !(0 == ~cond); {4713#true} is VALID [2022-04-27 14:49:54,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-27 14:49:54,974 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4713#true} {4826#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {4826#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:49:54,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {4826#(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; {4851#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:49:54,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {4851#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4851#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:49:54,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {4851#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {4851#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:49:54,975 INFO L272 TraceCheckUtils]: 46: Hoare triple {4851#(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)); {4713#true} is VALID [2022-04-27 14:49:54,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {4713#true} ~cond := #in~cond; {4713#true} is VALID [2022-04-27 14:49:54,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {4713#true} assume !(0 == ~cond); {4713#true} is VALID [2022-04-27 14:49:54,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-27 14:49:54,976 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4713#true} {4851#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {4851#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:49:54,977 INFO L290 TraceCheckUtils]: 51: Hoare triple {4851#(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; {4876#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:49:54,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {4876#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4876#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:49:54,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {4876#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {4876#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:49:54,977 INFO L272 TraceCheckUtils]: 54: Hoare triple {4876#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 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)); {4713#true} is VALID [2022-04-27 14:49:54,977 INFO L290 TraceCheckUtils]: 55: Hoare triple {4713#true} ~cond := #in~cond; {4713#true} is VALID [2022-04-27 14:49:54,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {4713#true} assume !(0 == ~cond); {4713#true} is VALID [2022-04-27 14:49:54,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-27 14:49:54,978 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4713#true} {4876#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #55#return; {4876#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:49:54,979 INFO L290 TraceCheckUtils]: 59: Hoare triple {4876#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {4901#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:49:54,979 INFO L272 TraceCheckUtils]: 60: Hoare triple {4901#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 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)); {4713#true} is VALID [2022-04-27 14:49:54,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {4713#true} ~cond := #in~cond; {4713#true} is VALID [2022-04-27 14:49:54,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {4713#true} assume !(0 == ~cond); {4713#true} is VALID [2022-04-27 14:49:54,979 INFO L290 TraceCheckUtils]: 63: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-27 14:49:54,979 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4713#true} {4901#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {4901#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:49:54,980 INFO L272 TraceCheckUtils]: 65: Hoare triple {4901#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4920#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:49:54,980 INFO L290 TraceCheckUtils]: 66: Hoare triple {4920#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:49:54,981 INFO L290 TraceCheckUtils]: 67: Hoare triple {4924#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4714#false} is VALID [2022-04-27 14:49:54,981 INFO L290 TraceCheckUtils]: 68: Hoare triple {4714#false} assume !false; {4714#false} is VALID [2022-04-27 14:49:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 14:49:54,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:49:55,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:49:55,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035691480] [2022-04-27 14:49:55,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:49:55,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801444545] [2022-04-27 14:49:55,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801444545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:49:55,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:49:55,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:49:55,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905552722] [2022-04-27 14:49:55,286 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:49:55,286 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-27 14:49:55,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:49:55,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:49:55,325 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:49:55,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:49:55,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:49:55,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:49:55,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:49:55,326 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:49:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:55,942 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-04-27 14:49:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:49:55,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-27 14:49:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:49:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-27 14:49:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:49:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-27 14:49:55,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-27 14:49:56,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:56,018 INFO L225 Difference]: With dead ends: 109 [2022-04-27 14:49:56,019 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 14:49:56,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:49:56,019 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:56,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:49:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 14:49:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-27 14:49:56,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:56,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:49:56,068 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:49:56,068 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:49:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:56,070 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-04-27 14:49:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-27 14:49:56,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:56,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:56,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand 103 states. [2022-04-27 14:49:56,071 INFO L87 Difference]: Start difference. First operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand 103 states. [2022-04-27 14:49:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:56,073 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-04-27 14:49:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-27 14:49:56,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:56,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:56,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:56,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:49:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2022-04-27 14:49:56,076 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 69 [2022-04-27 14:49:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:56,076 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2022-04-27 14:49:56,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:49:56,077 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-27 14:49:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 14:49:56,077 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:56,078 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:56,083 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:49:56,283 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:49:56,283 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 6 times [2022-04-27 14:49:56,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:56,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296981405] [2022-04-27 14:49:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:56,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:56,296 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:56,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339538661] [2022-04-27 14:49:56,297 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:49:56,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:56,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:56,298 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:49:56,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 14:50:01,659 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:50:01,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:50:01,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 14:50:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:50:01,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:50:02,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {5501#true} call ULTIMATE.init(); {5501#true} is VALID [2022-04-27 14:50:02,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {5501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5501#true} is VALID [2022-04-27 14:50:02,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {5501#true} assume true; {5501#true} is VALID [2022-04-27 14:50:02,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5501#true} {5501#true} #61#return; {5501#true} is VALID [2022-04-27 14:50:02,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {5501#true} call #t~ret6 := main(); {5501#true} is VALID [2022-04-27 14:50:02,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {5501#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; {5501#true} is VALID [2022-04-27 14:50:02,305 INFO L272 TraceCheckUtils]: 6: Hoare triple {5501#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5501#true} is VALID [2022-04-27 14:50:02,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {5501#true} ~cond := #in~cond; {5501#true} is VALID [2022-04-27 14:50:02,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {5501#true} assume !(0 == ~cond); {5501#true} is VALID [2022-04-27 14:50:02,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {5501#true} assume true; {5501#true} is VALID [2022-04-27 14:50:02,305 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5501#true} {5501#true} #53#return; {5501#true} is VALID [2022-04-27 14:50:02,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {5501#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5539#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:50:02,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {5539#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5539#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:50:02,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {5539#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {5539#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:50:02,306 INFO L272 TraceCheckUtils]: 14: Hoare triple {5539#(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)); {5501#true} is VALID [2022-04-27 14:50:02,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {5501#true} ~cond := #in~cond; {5501#true} is VALID [2022-04-27 14:50:02,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {5501#true} assume !(0 == ~cond); {5501#true} is VALID [2022-04-27 14:50:02,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {5501#true} assume true; {5501#true} is VALID [2022-04-27 14:50:02,307 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5501#true} {5539#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {5539#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:50:02,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {5539#(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; {5564#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:50:02,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {5564#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5564#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:50:02,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {5564#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {5564#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:50:02,309 INFO L272 TraceCheckUtils]: 22: Hoare triple {5564#(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)); {5501#true} is VALID [2022-04-27 14:50:02,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {5501#true} ~cond := #in~cond; {5501#true} is VALID [2022-04-27 14:50:02,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {5501#true} assume !(0 == ~cond); {5501#true} is VALID [2022-04-27 14:50:02,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {5501#true} assume true; {5501#true} is VALID [2022-04-27 14:50:02,309 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5501#true} {5564#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {5564#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:50:02,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {5564#(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; {5589#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:50:02,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {5589#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5589#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:50:02,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {5589#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {5589#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:50:02,310 INFO L272 TraceCheckUtils]: 30: Hoare triple {5589#(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)); {5501#true} is VALID [2022-04-27 14:50:02,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {5501#true} ~cond := #in~cond; {5501#true} is VALID [2022-04-27 14:50:02,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {5501#true} assume !(0 == ~cond); {5501#true} is VALID [2022-04-27 14:50:02,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {5501#true} assume true; {5501#true} is VALID [2022-04-27 14:50:02,311 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5501#true} {5589#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #55#return; {5589#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:50:02,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {5589#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 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; {5614#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:50:02,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {5614#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5614#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:50:02,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {5614#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {5614#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:50:02,312 INFO L272 TraceCheckUtils]: 38: Hoare triple {5614#(and (< 1 main_~k~0) (= 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)); {5501#true} is VALID [2022-04-27 14:50:02,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {5501#true} ~cond := #in~cond; {5501#true} is VALID [2022-04-27 14:50:02,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {5501#true} assume !(0 == ~cond); {5501#true} is VALID [2022-04-27 14:50:02,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {5501#true} assume true; {5501#true} is VALID [2022-04-27 14:50:02,313 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5501#true} {5614#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} #55#return; {5614#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:50:02,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {5614#(and (< 1 main_~k~0) (= 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; {5639#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:50:02,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {5639#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5639#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:50:02,321 INFO L290 TraceCheckUtils]: 45: Hoare triple {5639#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {5639#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:50:02,321 INFO L272 TraceCheckUtils]: 46: Hoare triple {5639#(and (< 1 main_~k~0) (= 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)); {5501#true} is VALID [2022-04-27 14:50:02,321 INFO L290 TraceCheckUtils]: 47: Hoare triple {5501#true} ~cond := #in~cond; {5501#true} is VALID [2022-04-27 14:50:02,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {5501#true} assume !(0 == ~cond); {5501#true} is VALID [2022-04-27 14:50:02,321 INFO L290 TraceCheckUtils]: 49: Hoare triple {5501#true} assume true; {5501#true} is VALID [2022-04-27 14:50:02,322 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5501#true} {5639#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #55#return; {5639#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:50:02,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {5639#(and (< 1 main_~k~0) (= 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; {5664#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:50:02,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {5664#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5664#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:50:02,323 INFO L290 TraceCheckUtils]: 53: Hoare triple {5664#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {5664#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:50:02,324 INFO L272 TraceCheckUtils]: 54: Hoare triple {5664#(and (< 1 main_~k~0) (= (+ (- 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)); {5501#true} is VALID [2022-04-27 14:50:02,324 INFO L290 TraceCheckUtils]: 55: Hoare triple {5501#true} ~cond := #in~cond; {5501#true} is VALID [2022-04-27 14:50:02,324 INFO L290 TraceCheckUtils]: 56: Hoare triple {5501#true} assume !(0 == ~cond); {5501#true} is VALID [2022-04-27 14:50:02,324 INFO L290 TraceCheckUtils]: 57: Hoare triple {5501#true} assume true; {5501#true} is VALID [2022-04-27 14:50:02,324 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5501#true} {5664#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {5664#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:50:02,325 INFO L290 TraceCheckUtils]: 59: Hoare triple {5664#(and (< 1 main_~k~0) (= (+ (- 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; {5689#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:50:02,326 INFO L290 TraceCheckUtils]: 60: Hoare triple {5689#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5689#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:50:02,326 INFO L290 TraceCheckUtils]: 61: Hoare triple {5689#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {5689#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:50:02,326 INFO L272 TraceCheckUtils]: 62: Hoare triple {5689#(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)); {5501#true} is VALID [2022-04-27 14:50:02,326 INFO L290 TraceCheckUtils]: 63: Hoare triple {5501#true} ~cond := #in~cond; {5501#true} is VALID [2022-04-27 14:50:02,326 INFO L290 TraceCheckUtils]: 64: Hoare triple {5501#true} assume !(0 == ~cond); {5501#true} is VALID [2022-04-27 14:50:02,326 INFO L290 TraceCheckUtils]: 65: Hoare triple {5501#true} assume true; {5501#true} is VALID [2022-04-27 14:50:02,327 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5501#true} {5689#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {5689#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:50:02,328 INFO L290 TraceCheckUtils]: 67: Hoare triple {5689#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {5714#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:50:02,328 INFO L272 TraceCheckUtils]: 68: Hoare triple {5714#(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)); {5501#true} is VALID [2022-04-27 14:50:02,328 INFO L290 TraceCheckUtils]: 69: Hoare triple {5501#true} ~cond := #in~cond; {5501#true} is VALID [2022-04-27 14:50:02,328 INFO L290 TraceCheckUtils]: 70: Hoare triple {5501#true} assume !(0 == ~cond); {5501#true} is VALID [2022-04-27 14:50:02,328 INFO L290 TraceCheckUtils]: 71: Hoare triple {5501#true} assume true; {5501#true} is VALID [2022-04-27 14:50:02,329 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5501#true} {5714#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {5714#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:50:02,330 INFO L272 TraceCheckUtils]: 73: Hoare triple {5714#(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)); {5733#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:50:02,330 INFO L290 TraceCheckUtils]: 74: Hoare triple {5733#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5737#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:50:02,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {5737#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5502#false} is VALID [2022-04-27 14:50:02,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {5502#false} assume !false; {5502#false} is VALID [2022-04-27 14:50:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 14:50:02,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:50:03,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:50:03,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296981405] [2022-04-27 14:50:03,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:50:03,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339538661] [2022-04-27 14:50:03,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339538661] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:50:03,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:50:03,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:50:03,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926143396] [2022-04-27 14:50:03,123 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:50:03,123 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-27 14:50:03,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:50:03,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:50:03,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:50:03,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:50:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:50:03,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:50:03,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:50:03,166 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:50:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:50:03,909 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-04-27 14:50:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:50:03,909 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-27 14:50:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:50:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:50:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-27 14:50:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:50:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-27 14:50:03,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-27 14:50:03,977 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:50:03,979 INFO L225 Difference]: With dead ends: 108 [2022-04-27 14:50:03,979 INFO L226 Difference]: Without dead ends: 102 [2022-04-27 14:50:03,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:50:03,979 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:50:03,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 367 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:50:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-27 14:50:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-27 14:50:04,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:50:04,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:50:04,030 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:50:04,030 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:50:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:50:04,032 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-04-27 14:50:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-27 14:50:04,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:50:04,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:50:04,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 102 states. [2022-04-27 14:50:04,033 INFO L87 Difference]: Start difference. First operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 102 states. [2022-04-27 14:50:04,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:50:04,035 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-04-27 14:50:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-27 14:50:04,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:50:04,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:50:04,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:50:04,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:50:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:50:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-04-27 14:50:04,038 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 77 [2022-04-27 14:50:04,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:50:04,038 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-04-27 14:50:04,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:50:04,039 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-27 14:50:04,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 14:50:04,039 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:50:04,039 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:50:04,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-27 14:50:04,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 14:50:04,251 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:50:04,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:50:04,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 7 times [2022-04-27 14:50:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:50:04,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533554277] [2022-04-27 14:50:04,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:50:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:50:04,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:50:04,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865788136] [2022-04-27 14:50:04,267 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:50:04,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:50:04,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:50:04,268 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:50:04,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 14:50:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:50:04,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-27 14:50:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:50:04,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:50:05,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {6408#true} call ULTIMATE.init(); {6408#true} is VALID [2022-04-27 14:50:05,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {6408#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6408#true} is VALID [2022-04-27 14:50:05,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {6408#true} assume true; {6408#true} is VALID [2022-04-27 14:50:05,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6408#true} {6408#true} #61#return; {6408#true} is VALID [2022-04-27 14:50:05,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {6408#true} call #t~ret6 := main(); {6408#true} is VALID [2022-04-27 14:50:05,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {6408#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; {6408#true} is VALID [2022-04-27 14:50:05,707 INFO L272 TraceCheckUtils]: 6: Hoare triple {6408#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6408#true} is VALID [2022-04-27 14:50:05,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {6408#true} ~cond := #in~cond; {6408#true} is VALID [2022-04-27 14:50:05,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {6408#true} assume !(0 == ~cond); {6408#true} is VALID [2022-04-27 14:50:05,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {6408#true} assume true; {6408#true} is VALID [2022-04-27 14:50:05,707 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6408#true} {6408#true} #53#return; {6408#true} is VALID [2022-04-27 14:50:05,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {6408#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6446#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:50:05,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {6446#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6446#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:50:05,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {6446#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6446#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:50:05,709 INFO L272 TraceCheckUtils]: 14: Hoare triple {6446#(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)); {6408#true} is VALID [2022-04-27 14:50:05,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {6408#true} ~cond := #in~cond; {6408#true} is VALID [2022-04-27 14:50:05,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {6408#true} assume !(0 == ~cond); {6408#true} is VALID [2022-04-27 14:50:05,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {6408#true} assume true; {6408#true} is VALID [2022-04-27 14:50:05,709 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6408#true} {6446#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6446#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:50:05,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {6446#(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; {6471#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:50:05,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {6471#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6471#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:50:05,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {6471#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {6471#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:50:05,710 INFO L272 TraceCheckUtils]: 22: Hoare triple {6471#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~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)); {6408#true} is VALID [2022-04-27 14:50:05,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {6408#true} ~cond := #in~cond; {6408#true} is VALID [2022-04-27 14:50:05,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {6408#true} assume !(0 == ~cond); {6408#true} is VALID [2022-04-27 14:50:05,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {6408#true} assume true; {6408#true} is VALID [2022-04-27 14:50:05,711 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6408#true} {6471#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {6471#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:50:05,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {6471#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~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; {6496#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:50:05,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {6496#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6496#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:50:05,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {6496#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {6496#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:50:05,715 INFO L272 TraceCheckUtils]: 30: Hoare triple {6496#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 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)); {6408#true} is VALID [2022-04-27 14:50:05,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {6408#true} ~cond := #in~cond; {6408#true} is VALID [2022-04-27 14:50:05,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {6408#true} assume !(0 == ~cond); {6408#true} is VALID [2022-04-27 14:50:05,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {6408#true} assume true; {6408#true} is VALID [2022-04-27 14:50:05,720 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6408#true} {6496#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #55#return; {6496#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:50:05,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {6496#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6521#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:50:05,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {6521#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6521#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:50:05,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {6521#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {6521#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:50:05,721 INFO L272 TraceCheckUtils]: 38: Hoare triple {6521#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 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)); {6408#true} is VALID [2022-04-27 14:50:05,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {6408#true} ~cond := #in~cond; {6408#true} is VALID [2022-04-27 14:50:05,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {6408#true} assume !(0 == ~cond); {6408#true} is VALID [2022-04-27 14:50:05,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {6408#true} assume true; {6408#true} is VALID [2022-04-27 14:50:05,722 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6408#true} {6521#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} #55#return; {6521#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:50:05,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {6521#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6546#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:50:05,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {6546#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6546#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:50:05,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {6546#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {6546#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:50:05,723 INFO L272 TraceCheckUtils]: 46: Hoare triple {6546#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~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)); {6408#true} is VALID [2022-04-27 14:50:05,724 INFO L290 TraceCheckUtils]: 47: Hoare triple {6408#true} ~cond := #in~cond; {6559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:50:05,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {6559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:50:05,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {6563#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:50:05,725 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6563#(not (= |__VERIFIER_assert_#in~cond| 0))} {6546#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} #55#return; {6570#(and (= (+ (- 1) main_~c~0) 3) (= (+ (* 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))) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:50:05,725 INFO L290 TraceCheckUtils]: 51: Hoare triple {6570#(and (= (+ (- 1) main_~c~0) 3) (= (+ (* 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))) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6574#(and (= (+ (* main_~x~0 12) 16 (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:50:05,726 INFO L290 TraceCheckUtils]: 52: Hoare triple {6574#(and (= (+ (* main_~x~0 12) 16 (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6574#(and (= (+ (* main_~x~0 12) 16 (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:50:05,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {6574#(and (= (+ (* main_~x~0 12) 16 (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {6574#(and (= (+ (* main_~x~0 12) 16 (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:50:05,726 INFO L272 TraceCheckUtils]: 54: Hoare triple {6574#(and (= (+ (* main_~x~0 12) 16 (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 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)); {6408#true} is VALID [2022-04-27 14:50:05,727 INFO L290 TraceCheckUtils]: 55: Hoare triple {6408#true} ~cond := #in~cond; {6408#true} is VALID [2022-04-27 14:50:05,727 INFO L290 TraceCheckUtils]: 56: Hoare triple {6408#true} assume !(0 == ~cond); {6408#true} is VALID [2022-04-27 14:50:05,727 INFO L290 TraceCheckUtils]: 57: Hoare triple {6408#true} assume true; {6408#true} is VALID [2022-04-27 14:50:05,727 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6408#true} {6574#(and (= (+ (* main_~x~0 12) 16 (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} #55#return; {6574#(and (= (+ (* main_~x~0 12) 16 (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:50:05,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {6574#(and (= (+ (* main_~x~0 12) 16 (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6599#(and (= main_~y~0 6) (= (+ (* main_~x~0 12) (- 37484) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:50:05,728 INFO L290 TraceCheckUtils]: 60: Hoare triple {6599#(and (= main_~y~0 6) (= (+ (* main_~x~0 12) (- 37484) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6599#(and (= main_~y~0 6) (= (+ (* main_~x~0 12) (- 37484) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:50:05,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {6599#(and (= main_~y~0 6) (= (+ (* main_~x~0 12) (- 37484) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {6599#(and (= main_~y~0 6) (= (+ (* main_~x~0 12) (- 37484) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:50:05,729 INFO L272 TraceCheckUtils]: 62: Hoare triple {6599#(and (= main_~y~0 6) (= (+ (* main_~x~0 12) (- 37484) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= (+ main_~c~0 (- 3)) 3) (< 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)); {6408#true} is VALID [2022-04-27 14:50:05,729 INFO L290 TraceCheckUtils]: 63: Hoare triple {6408#true} ~cond := #in~cond; {6408#true} is VALID [2022-04-27 14:50:05,729 INFO L290 TraceCheckUtils]: 64: Hoare triple {6408#true} assume !(0 == ~cond); {6408#true} is VALID [2022-04-27 14:50:05,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {6408#true} assume true; {6408#true} is VALID [2022-04-27 14:50:05,729 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6408#true} {6599#(and (= main_~y~0 6) (= (+ (* main_~x~0 12) (- 37484) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} #55#return; {6599#(and (= main_~y~0 6) (= (+ (* main_~x~0 12) (- 37484) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:50:05,730 INFO L290 TraceCheckUtils]: 67: Hoare triple {6599#(and (= main_~y~0 6) (= (+ (* main_~x~0 12) (- 37484) (* 12 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) 15616) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6624#(and (<= main_~c~0 7) (= 7 main_~y~0) (= (* main_~x~0 12) (+ 146412 (* 12 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 6 main_~k~0))} is VALID [2022-04-27 14:50:05,730 INFO L290 TraceCheckUtils]: 68: Hoare triple {6624#(and (<= main_~c~0 7) (= 7 main_~y~0) (= (* main_~x~0 12) (+ 146412 (* 12 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6624#(and (<= main_~c~0 7) (= 7 main_~y~0) (= (* main_~x~0 12) (+ 146412 (* 12 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 6 main_~k~0))} is VALID [2022-04-27 14:50:05,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {6624#(and (<= main_~c~0 7) (= 7 main_~y~0) (= (* main_~x~0 12) (+ 146412 (* 12 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 6 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {6624#(and (<= main_~c~0 7) (= 7 main_~y~0) (= (* main_~x~0 12) (+ 146412 (* 12 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 6 main_~k~0))} is VALID [2022-04-27 14:50:05,731 INFO L272 TraceCheckUtils]: 70: Hoare triple {6624#(and (<= main_~c~0 7) (= 7 main_~y~0) (= (* main_~x~0 12) (+ 146412 (* 12 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 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)); {6408#true} is VALID [2022-04-27 14:50:05,731 INFO L290 TraceCheckUtils]: 71: Hoare triple {6408#true} ~cond := #in~cond; {6408#true} is VALID [2022-04-27 14:50:05,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {6408#true} assume !(0 == ~cond); {6408#true} is VALID [2022-04-27 14:50:05,731 INFO L290 TraceCheckUtils]: 73: Hoare triple {6408#true} assume true; {6408#true} is VALID [2022-04-27 14:50:05,731 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6408#true} {6624#(and (<= main_~c~0 7) (= 7 main_~y~0) (= (* main_~x~0 12) (+ 146412 (* 12 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 6 main_~k~0))} #55#return; {6624#(and (<= main_~c~0 7) (= 7 main_~y~0) (= (* main_~x~0 12) (+ 146412 (* 12 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 6 main_~k~0))} is VALID [2022-04-27 14:50:05,732 INFO L290 TraceCheckUtils]: 75: Hoare triple {6624#(and (<= main_~c~0 7) (= 7 main_~y~0) (= (* main_~x~0 12) (+ 146412 (* 12 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {6649#(and (<= main_~k~0 7) (= 7 main_~y~0) (= (* main_~x~0 12) (+ 146412 (* 12 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 6 main_~k~0))} is VALID [2022-04-27 14:50:05,732 INFO L272 TraceCheckUtils]: 76: Hoare triple {6649#(and (<= main_~k~0 7) (= 7 main_~y~0) (= (* main_~x~0 12) (+ 146412 (* 12 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 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)); {6408#true} is VALID [2022-04-27 14:50:05,732 INFO L290 TraceCheckUtils]: 77: Hoare triple {6408#true} ~cond := #in~cond; {6559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:50:05,733 INFO L290 TraceCheckUtils]: 78: Hoare triple {6559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:50:05,733 INFO L290 TraceCheckUtils]: 79: Hoare triple {6563#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:50:05,734 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6563#(not (= |__VERIFIER_assert_#in~cond| 0))} {6649#(and (<= main_~k~0 7) (= 7 main_~y~0) (= (* main_~x~0 12) (+ 146412 (* 12 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 6 main_~k~0))} #57#return; {6665#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:50:05,734 INFO L272 TraceCheckUtils]: 81: Hoare triple {6665#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6669#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:50:05,734 INFO L290 TraceCheckUtils]: 82: Hoare triple {6669#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6673#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:50:05,735 INFO L290 TraceCheckUtils]: 83: Hoare triple {6673#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6409#false} is VALID [2022-04-27 14:50:05,735 INFO L290 TraceCheckUtils]: 84: Hoare triple {6409#false} assume !false; {6409#false} is VALID [2022-04-27 14:50:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 49 proven. 123 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-04-27 14:50:05,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:50:20,748 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (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) .cse0) 12) 0)) (<= c_main_~k~0 (+ 2 c_main_~c~0)) (< (+ 3 c_main_~c~0) c_main_~k~0) (= (+ (* c_main_~y~0 c_main_~k~0) (* 3 c_main_~k~0)) (+ (* 6 c_main_~y~0) 9 .cse0)))) is different from false [2022-04-27 14:51:29,407 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (<= main_~k~0 (+ 6 c_main_~c~0)) (< (+ 7 c_main_~c~0) main_~k~0) (= (+ (* 7 main_~k~0) (* main_~k~0 c_main_~y~0)) (+ (* 14 c_main_~y~0) 49 (* c_main_~y~0 c_main_~y~0))))) (not (= (mod (let ((.cse0 (+ 4 c_main_~y~0))) (+ (* .cse0 .cse0 .cse0 .cse0 .cse0 (- 6)) (* .cse0 .cse0) (* (- 2) .cse0 .cse0 .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 .cse0 (- 5)))) 12) 0))) is different from false [2022-04-27 14:51:31,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:31,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533554277] [2022-04-27 14:51:31,475 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:31,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865788136] [2022-04-27 14:51:31,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865788136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:31,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:31,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-27 14:51:31,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159546161] [2022-04-27 14:51:31,476 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:31,476 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-27 14:51:31,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:31,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:51:31,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:31,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 14:51:31,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:31,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 14:51:31,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=584, Unknown=3, NotChecked=102, Total=812 [2022-04-27 14:51:31,528 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:51:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:33,141 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-04-27 14:51:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:51:33,141 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-27 14:51:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:51:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2022-04-27 14:51:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:51:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2022-04-27 14:51:33,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 76 transitions. [2022-04-27 14:51:33,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:33,222 INFO L225 Difference]: With dead ends: 107 [2022-04-27 14:51:33,222 INFO L226 Difference]: Without dead ends: 101 [2022-04-27 14:51:33,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=144, Invalid=731, Unknown=3, NotChecked=114, Total=992 [2022-04-27 14:51:33,223 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:33,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 449 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 14:51:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-27 14:51:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-27 14:51:33,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:33,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:51:33,277 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:51:33,277 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:51:33,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:33,279 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-27 14:51:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-27 14:51:33,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:33,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:33,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 101 states. [2022-04-27 14:51:33,280 INFO L87 Difference]: Start difference. First operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 101 states. [2022-04-27 14:51:33,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:33,282 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-27 14:51:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-27 14:51:33,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:33,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:33,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:33,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:51:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2022-04-27 14:51:33,285 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 85 [2022-04-27 14:51:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:33,285 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2022-04-27 14:51:33,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:51:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-27 14:51:33,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-27 14:51:33,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:33,286 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:33,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 14:51:33,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 14:51:33,496 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:33,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:33,496 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 8 times [2022-04-27 14:51:33,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:33,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832866115] [2022-04-27 14:51:33,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:33,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:33,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:33,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629985995] [2022-04-27 14:51:33,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:51:33,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:33,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:33,523 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:51:33,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 14:51:34,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:51:34,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:51:34,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:51:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:51:34,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:51:35,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {7393#true} call ULTIMATE.init(); {7393#true} is VALID [2022-04-27 14:51:35,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {7393#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7393#true} is VALID [2022-04-27 14:51:35,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {7393#true} assume true; {7393#true} is VALID [2022-04-27 14:51:35,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7393#true} {7393#true} #61#return; {7393#true} is VALID [2022-04-27 14:51:35,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {7393#true} call #t~ret6 := main(); {7393#true} is VALID [2022-04-27 14:51:35,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {7393#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; {7393#true} is VALID [2022-04-27 14:51:35,010 INFO L272 TraceCheckUtils]: 6: Hoare triple {7393#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7393#true} is VALID [2022-04-27 14:51:35,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {7393#true} ~cond := #in~cond; {7393#true} is VALID [2022-04-27 14:51:35,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {7393#true} assume !(0 == ~cond); {7393#true} is VALID [2022-04-27 14:51:35,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {7393#true} assume true; {7393#true} is VALID [2022-04-27 14:51:35,011 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7393#true} {7393#true} #53#return; {7393#true} is VALID [2022-04-27 14:51:35,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {7393#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7431#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:35,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {7431#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7431#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:35,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {7431#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {7431#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:35,026 INFO L272 TraceCheckUtils]: 14: Hoare triple {7431#(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)); {7393#true} is VALID [2022-04-27 14:51:35,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {7393#true} ~cond := #in~cond; {7393#true} is VALID [2022-04-27 14:51:35,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {7393#true} assume !(0 == ~cond); {7393#true} is VALID [2022-04-27 14:51:35,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {7393#true} assume true; {7393#true} is VALID [2022-04-27 14:51:35,026 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7393#true} {7431#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {7431#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:51:35,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {7431#(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; {7456#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:51:35,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {7456#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7456#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:51:35,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {7456#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {7456#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:51:35,028 INFO L272 TraceCheckUtils]: 22: Hoare triple {7456#(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)); {7393#true} is VALID [2022-04-27 14:51:35,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {7393#true} ~cond := #in~cond; {7393#true} is VALID [2022-04-27 14:51:35,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {7393#true} assume !(0 == ~cond); {7393#true} is VALID [2022-04-27 14:51:35,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {7393#true} assume true; {7393#true} is VALID [2022-04-27 14:51:35,028 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7393#true} {7456#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {7456#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:51:35,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {7456#(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; {7481#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:51:35,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {7481#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7481#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:51:35,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {7481#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {7481#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:51:35,029 INFO L272 TraceCheckUtils]: 30: Hoare triple {7481#(and (= (+ (- 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)); {7393#true} is VALID [2022-04-27 14:51:35,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {7393#true} ~cond := #in~cond; {7393#true} is VALID [2022-04-27 14:51:35,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {7393#true} assume !(0 == ~cond); {7393#true} is VALID [2022-04-27 14:51:35,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {7393#true} assume true; {7393#true} is VALID [2022-04-27 14:51:35,030 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7393#true} {7481#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #55#return; {7481#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:51:35,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {7481#(and (= (+ (- 1) main_~y~0) 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; {7506#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:51:35,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {7506#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7506#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:51:35,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {7506#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {7506#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:51:35,032 INFO L272 TraceCheckUtils]: 38: Hoare triple {7506#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 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)); {7393#true} is VALID [2022-04-27 14:51:35,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {7393#true} ~cond := #in~cond; {7393#true} is VALID [2022-04-27 14:51:35,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {7393#true} assume !(0 == ~cond); {7393#true} is VALID [2022-04-27 14:51:35,032 INFO L290 TraceCheckUtils]: 41: Hoare triple {7393#true} assume true; {7393#true} is VALID [2022-04-27 14:51:35,033 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7393#true} {7506#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} #55#return; {7506#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:51:35,033 INFO L290 TraceCheckUtils]: 43: Hoare triple {7506#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 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; {7531#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:35,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {7531#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7531#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:35,034 INFO L290 TraceCheckUtils]: 45: Hoare triple {7531#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {7531#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:35,034 INFO L272 TraceCheckUtils]: 46: Hoare triple {7531#(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)); {7393#true} is VALID [2022-04-27 14:51:35,034 INFO L290 TraceCheckUtils]: 47: Hoare triple {7393#true} ~cond := #in~cond; {7393#true} is VALID [2022-04-27 14:51:35,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {7393#true} assume !(0 == ~cond); {7393#true} is VALID [2022-04-27 14:51:35,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {7393#true} assume true; {7393#true} is VALID [2022-04-27 14:51:35,035 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7393#true} {7531#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {7531#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:51:35,035 INFO L290 TraceCheckUtils]: 51: Hoare triple {7531#(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; {7556#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:51:35,036 INFO L290 TraceCheckUtils]: 52: Hoare triple {7556#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7556#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:51:35,036 INFO L290 TraceCheckUtils]: 53: Hoare triple {7556#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {7556#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:51:35,036 INFO L272 TraceCheckUtils]: 54: Hoare triple {7556#(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)); {7393#true} is VALID [2022-04-27 14:51:35,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {7393#true} ~cond := #in~cond; {7393#true} is VALID [2022-04-27 14:51:35,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {7393#true} assume !(0 == ~cond); {7393#true} is VALID [2022-04-27 14:51:35,036 INFO L290 TraceCheckUtils]: 57: Hoare triple {7393#true} assume true; {7393#true} is VALID [2022-04-27 14:51:35,037 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7393#true} {7556#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {7556#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:51:35,038 INFO L290 TraceCheckUtils]: 59: Hoare triple {7556#(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; {7581#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:51:35,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {7581#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7581#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:51:35,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {7581#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {7581#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:51:35,039 INFO L272 TraceCheckUtils]: 62: Hoare triple {7581#(and (= main_~y~0 6) (= 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)); {7393#true} is VALID [2022-04-27 14:51:35,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {7393#true} ~cond := #in~cond; {7393#true} is VALID [2022-04-27 14:51:35,039 INFO L290 TraceCheckUtils]: 64: Hoare triple {7393#true} assume !(0 == ~cond); {7393#true} is VALID [2022-04-27 14:51:35,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {7393#true} assume true; {7393#true} is VALID [2022-04-27 14:51:35,040 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7393#true} {7581#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {7581#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:51:35,040 INFO L290 TraceCheckUtils]: 67: Hoare triple {7581#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7606#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:35,041 INFO L290 TraceCheckUtils]: 68: Hoare triple {7606#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7606#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:35,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {7606#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {7606#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:35,041 INFO L272 TraceCheckUtils]: 70: Hoare triple {7606#(and (= 7 main_~c~0) (= 6 (+ (- 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)); {7393#true} is VALID [2022-04-27 14:51:35,041 INFO L290 TraceCheckUtils]: 71: Hoare triple {7393#true} ~cond := #in~cond; {7393#true} is VALID [2022-04-27 14:51:35,041 INFO L290 TraceCheckUtils]: 72: Hoare triple {7393#true} assume !(0 == ~cond); {7393#true} is VALID [2022-04-27 14:51:35,041 INFO L290 TraceCheckUtils]: 73: Hoare triple {7393#true} assume true; {7393#true} is VALID [2022-04-27 14:51:35,042 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7393#true} {7606#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {7606#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:51:35,043 INFO L290 TraceCheckUtils]: 75: Hoare triple {7606#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7631#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:51:35,043 INFO L290 TraceCheckUtils]: 76: Hoare triple {7631#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7631#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:51:35,044 INFO L290 TraceCheckUtils]: 77: Hoare triple {7631#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {7631#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:51:35,044 INFO L272 TraceCheckUtils]: 78: Hoare triple {7631#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~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)); {7393#true} is VALID [2022-04-27 14:51:35,053 INFO L290 TraceCheckUtils]: 79: Hoare triple {7393#true} ~cond := #in~cond; {7393#true} is VALID [2022-04-27 14:51:35,053 INFO L290 TraceCheckUtils]: 80: Hoare triple {7393#true} assume !(0 == ~cond); {7393#true} is VALID [2022-04-27 14:51:35,053 INFO L290 TraceCheckUtils]: 81: Hoare triple {7393#true} assume true; {7393#true} is VALID [2022-04-27 14:51:35,054 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {7393#true} {7631#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {7631#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:51:35,055 INFO L290 TraceCheckUtils]: 83: Hoare triple {7631#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {7656#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:51:35,055 INFO L272 TraceCheckUtils]: 84: Hoare triple {7656#(and (< 7 main_~k~0) (= main_~y~0 8) (<= 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)); {7393#true} is VALID [2022-04-27 14:51:35,055 INFO L290 TraceCheckUtils]: 85: Hoare triple {7393#true} ~cond := #in~cond; {7393#true} is VALID [2022-04-27 14:51:35,055 INFO L290 TraceCheckUtils]: 86: Hoare triple {7393#true} assume !(0 == ~cond); {7393#true} is VALID [2022-04-27 14:51:35,055 INFO L290 TraceCheckUtils]: 87: Hoare triple {7393#true} assume true; {7393#true} is VALID [2022-04-27 14:51:35,056 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7393#true} {7656#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {7656#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:51:35,057 INFO L272 TraceCheckUtils]: 89: Hoare triple {7656#(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)); {7675#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:51:35,057 INFO L290 TraceCheckUtils]: 90: Hoare triple {7675#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7679#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:51:35,058 INFO L290 TraceCheckUtils]: 91: Hoare triple {7679#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7394#false} is VALID [2022-04-27 14:51:35,058 INFO L290 TraceCheckUtils]: 92: Hoare triple {7394#false} assume !false; {7394#false} is VALID [2022-04-27 14:51:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 14:51:35,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:51:35,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:51:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832866115] [2022-04-27 14:51:35,415 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:51:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629985995] [2022-04-27 14:51:35,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629985995] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:51:35,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:51:35,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:51:35,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448720365] [2022-04-27 14:51:35,416 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:51:35,416 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-27 14:51:35,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:51:35,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:51:35,468 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:51:35,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:51:35,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:51:35,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:51:35,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:51:35,470 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:51:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:36,526 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2022-04-27 14:51:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:51:36,526 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-27 14:51:36,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:51:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:51:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-27 14:51:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:51:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-27 14:51:36,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-27 14:51:36,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:51:36,598 INFO L225 Difference]: With dead ends: 106 [2022-04-27 14:51:36,599 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 14:51:36,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:51:36,600 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:51:36,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 491 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:51:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 14:51:36,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-27 14:51:36,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:51:36,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:51:36,670 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:51:36,670 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:51:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:36,671 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-27 14:51:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 14:51:36,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:36,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:36,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-27 14:51:36,672 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-27 14:51:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:51:36,674 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-27 14:51:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 14:51:36,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:51:36,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:51:36,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:51:36,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:51:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:51:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-27 14:51:36,677 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 93 [2022-04-27 14:51:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:51:36,677 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-27 14:51:36,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:51:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 14:51:36,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 14:51:36,678 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:51:36,679 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:51:36,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 14:51:36,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 14:51:36,886 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:51:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:51:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 9 times [2022-04-27 14:51:36,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:51:36,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447608336] [2022-04-27 14:51:36,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:51:36,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:51:36,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:51:36,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334790118] [2022-04-27 14:51:36,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:51:36,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:51:36,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:51:36,916 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:51:36,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process