/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/ps5-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:42:25,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:42:25,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:42:25,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:42:25,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:42:25,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:42:25,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:42:25,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:42:25,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:42:25,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:42:25,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:42:25,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:42:25,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:42:25,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:42:25,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:42:25,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:42:25,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:42:25,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:42:25,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:42:25,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:42:25,651 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:42:25,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:42:25,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:42:25,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:42:25,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:42:25,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:42:25,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:42:25,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:42:25,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:42:25,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:42:25,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:42:25,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:42:25,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:42:25,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:42:25,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:42:25,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:42:25,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:42:25,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:42:25,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:42:25,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:42:25,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:42:25,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:42:25,665 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:42:25,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:42:25,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:42:25,688 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:42:25,688 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:42:25,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:42:25,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:42:25,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:42:25,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:42:25,689 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:42:25,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:42:25,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:42:25,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:42:25,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:42:25,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:42:25,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:42:25,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:42:25,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:42:25,691 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:42:25,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:42:25,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:42:25,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:42:25,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:42:25,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:42:25,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:42:25,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:42:25,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:42:25,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:42:25,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:42:25,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:42:25,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:42:25,693 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:42:25,693 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:42:25,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:42:25,693 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:42:25,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:42:25,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:42:25,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:42:25,896 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:42:25,896 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:42:25,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound50.c [2022-04-27 14:42:25,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9bc8cd74/099b3be0b3514afca2e6d9de3a09fcdf/FLAGfd1991dc2 [2022-04-27 14:42:26,287 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:42:26,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound50.c [2022-04-27 14:42:26,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9bc8cd74/099b3be0b3514afca2e6d9de3a09fcdf/FLAGfd1991dc2 [2022-04-27 14:42:26,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9bc8cd74/099b3be0b3514afca2e6d9de3a09fcdf [2022-04-27 14:42:26,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:42:26,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:42:26,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:42:26,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:42:26,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:42:26,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:42:26" (1/1) ... [2022-04-27 14:42:26,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dcd0765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:42:26, skipping insertion in model container [2022-04-27 14:42:26,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:42:26" (1/1) ... [2022-04-27 14:42:26,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:42:26,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:42:26,852 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/ps5-ll_valuebound50.c[458,471] [2022-04-27 14:42:26,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:42:26,881 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:42:26,896 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/ps5-ll_valuebound50.c[458,471] [2022-04-27 14:42:26,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:42:26,912 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:42:26,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:42:26 WrapperNode [2022-04-27 14:42:26,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:42:26,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:42:26,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:42:26,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:42:26,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:42:26" (1/1) ... [2022-04-27 14:42:26,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:42:26" (1/1) ... [2022-04-27 14:42:26,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:42:26" (1/1) ... [2022-04-27 14:42:26,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:42:26" (1/1) ... [2022-04-27 14:42:26,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:42:26" (1/1) ... [2022-04-27 14:42:26,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:42:26" (1/1) ... [2022-04-27 14:42:26,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:42:26" (1/1) ... [2022-04-27 14:42:26,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:42:26,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:42:26,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:42:26,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:42:26,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:42:26" (1/1) ... [2022-04-27 14:42:26,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:42:26,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:26,952 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:42:26,969 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:42:26,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:42:26,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:42:26,998 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:42:26,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:42:27,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:42:27,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:42:27,000 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:42:27,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:42:27,001 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:42:27,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:42:27,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:42:27,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:42:27,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:42:27,004 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:42:27,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:42:27,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:42:27,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:42:27,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:42:27,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:42:27,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:42:27,044 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:42:27,045 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:42:27,184 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:42:27,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:42:27,189 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:42:27,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:42:27 BoogieIcfgContainer [2022-04-27 14:42:27,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:42:27,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:42:27,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:42:27,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:42:27,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:42:26" (1/3) ... [2022-04-27 14:42:27,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563741f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:42:27, skipping insertion in model container [2022-04-27 14:42:27,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:42:26" (2/3) ... [2022-04-27 14:42:27,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563741f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:42:27, skipping insertion in model container [2022-04-27 14:42:27,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:42:27" (3/3) ... [2022-04-27 14:42:27,210 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound50.c [2022-04-27 14:42:27,219 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:42:27,220 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:42:27,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:42:27,276 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@5e6a7422, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3bc1c757 [2022-04-27 14:42:27,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:42:27,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:42:27,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:42:27,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:27,286 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:27,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:27,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-27 14:42:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:27,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420979588] [2022-04-27 14:42:27,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:27,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:27,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:42:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:27,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 14:42:27,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:42:27,451 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-27 14:42:27,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:42:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:27,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:42:27,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:42:27,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:42:27,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:42:27,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 14:42:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:27,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:42:27,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:42:27,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:42:27,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 14:42:27,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:42:27,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 14:42:27,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:42:27,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-27 14:42:27,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-27 14:42:27,467 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:42:27,467 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {32#true} is VALID [2022-04-27 14:42:27,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:42:27,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:42:27,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:42:27,468 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:42:27,468 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-27 14:42:27,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:42:27,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:42:27,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:42:27,469 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 14:42:27,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-27 14:42:27,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-27 14:42:27,470 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-27 14:42:27,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 14:42:27,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 14:42:27,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 14:42:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:42:27,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:27,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420979588] [2022-04-27 14:42:27,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420979588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:42:27,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:42:27,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:42:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770091635] [2022-04-27 14:42:27,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:42:27,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:42:27,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:27,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:42:27,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:27,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:42:27,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:27,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:42:27,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:42:27,514 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:42:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:27,641 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 14:42:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:42:27,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:42:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:42:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 14:42:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:42:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 14:42:27,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-27 14:42:27,716 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:42:27,721 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:42:27,721 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 14:42:27,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:42:27,725 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:27,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:42:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 14:42:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 14:42:27,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:27,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:42:27,745 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:42:27,745 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:42:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:27,748 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 14:42:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:42:27,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:27,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:27,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 14:42:27,750 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 14:42:27,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:27,752 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 14:42:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:42:27,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:27,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:27,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:27,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:42:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 14:42:27,756 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-27 14:42:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:27,756 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 14:42:27,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:42:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:42:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:42:27,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:27,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:27,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:42:27,758 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-27 14:42:27,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:27,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080325083] [2022-04-27 14:42:27,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:27,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:27,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:27,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2055509561] [2022-04-27 14:42:27,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:27,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:27,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:27,775 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:42:27,835 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:42:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:27,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:42:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:27,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:28,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2022-04-27 14:42:28,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {202#true} is VALID [2022-04-27 14:42:28,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:42:28,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #63#return; {202#true} is VALID [2022-04-27 14:42:28,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret5 := main(); {202#true} is VALID [2022-04-27 14:42:28,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {202#true} is VALID [2022-04-27 14:42:28,032 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {202#true} is VALID [2022-04-27 14:42:28,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-27 14:42:28,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-27 14:42:28,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:42:28,032 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} #53#return; {202#true} is VALID [2022-04-27 14:42:28,033 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {202#true} is VALID [2022-04-27 14:42:28,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-27 14:42:28,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-27 14:42:28,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:42:28,033 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} #55#return; {202#true} is VALID [2022-04-27 14:42:28,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:28,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:28,037 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:28,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:28,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {203#false} is VALID [2022-04-27 14:42:28,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-04-27 14:42:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:42:28,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:42:28,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:28,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080325083] [2022-04-27 14:42:28,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:28,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055509561] [2022-04-27 14:42:28,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055509561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:42:28,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:42:28,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:42:28,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529534888] [2022-04-27 14:42:28,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:42:28,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 14:42:28,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:28,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:42:28,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:28,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:42:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:28,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:42:28,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:42:28,056 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:42:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:30,334 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 14:42:30,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:42:30,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 14:42:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:42:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 14:42:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:42:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 14:42:30,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 14:42:30,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:30,373 INFO L225 Difference]: With dead ends: 35 [2022-04-27 14:42:30,374 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:42:30,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:42:30,376 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:30,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:42:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:42:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:42:30,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:30,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:42:30,387 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:42:30,388 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:42:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:30,393 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 14:42:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:42:30,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:30,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:30,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-27 14:42:30,395 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-27 14:42:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:30,396 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 14:42:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:42:30,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:30,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:30,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:30,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:42:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 14:42:30,399 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-27 14:42:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:30,399 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 14:42:30,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:42:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:42:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 14:42:30,400 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:30,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:30,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:42:30,600 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:42:30,601 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:30,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:30,601 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-27 14:42:30,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:30,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373718635] [2022-04-27 14:42:30,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:30,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:30,613 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:30,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801597398] [2022-04-27 14:42:30,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:30,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:30,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:30,617 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:42:30,617 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:42:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:30,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:42:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:30,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:30,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-27 14:42:30,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {434#true} is VALID [2022-04-27 14:42:30,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:42:30,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-27 14:42:30,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-27 14:42:30,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {434#true} is VALID [2022-04-27 14:42:30,820 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {434#true} is VALID [2022-04-27 14:42:30,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:42:30,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:42:30,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:42:30,821 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-27 14:42:30,821 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-27 14:42:30,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:42:30,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:42:30,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:42:30,822 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-27 14:42:30,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:30,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:30,823 INFO L272 TraceCheckUtils]: 18: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {434#true} is VALID [2022-04-27 14:42:30,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:42:30,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:42:30,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:42:30,824 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {487#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:30,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {509#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 14:42:30,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {509#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !false; {509#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 14:42:30,826 INFO L272 TraceCheckUtils]: 25: Hoare triple {509#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:30,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:30,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-27 14:42:30,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 14:42:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:42:30,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:33,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 14:42:33,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-27 14:42:33,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:33,777 INFO L272 TraceCheckUtils]: 25: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:33,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:42:33,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:42:33,964 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #57#return; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:42:33,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:42:33,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:42:33,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:42:33,965 INFO L272 TraceCheckUtils]: 18: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {434#true} is VALID [2022-04-27 14:42:33,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:42:33,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:42:33,967 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-27 14:42:33,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:42:33,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:42:33,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:42:33,967 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-27 14:42:33,967 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-27 14:42:33,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:42:33,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:42:33,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:42:33,968 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {434#true} is VALID [2022-04-27 14:42:33,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {434#true} is VALID [2022-04-27 14:42:33,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-27 14:42:33,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-27 14:42:33,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:42:33,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {434#true} is VALID [2022-04-27 14:42:33,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-27 14:42:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:42:33,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:33,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373718635] [2022-04-27 14:42:33,969 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:33,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801597398] [2022-04-27 14:42:33,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801597398] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:33,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:33,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:42:33,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449240775] [2022-04-27 14:42:33,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:42:33,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 14:42:33,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:33,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:42:34,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:34,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:42:34,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:34,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:42:34,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2022-04-27 14:42:34,484 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:42:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:34,589 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:42:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:42:34,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 14:42:34,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:42:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:42:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:42:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:42:34,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:42:36,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:36,617 INFO L225 Difference]: With dead ends: 37 [2022-04-27 14:42:36,617 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 14:42:36,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2022-04-27 14:42:36,618 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:36,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:42:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 14:42:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 14:42:36,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:36,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:42:36,625 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:42:36,625 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:42:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:36,627 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 14:42:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:42:36,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:36,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:36,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 14:42:36,628 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 14:42:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:36,644 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 14:42:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:42:36,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:36,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:36,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:36,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:42:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-27 14:42:36,646 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-27 14:42:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:36,647 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-27 14:42:36,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:42:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:42:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 14:42:36,648 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:36,648 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:36,655 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:42:36,848 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:42:36,849 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:36,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-27 14:42:36,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:36,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075271897] [2022-04-27 14:42:36,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:36,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:36,861 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:36,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512255942] [2022-04-27 14:42:36,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:36,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:36,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:36,871 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:42:36,873 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:42:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:36,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:42:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:36,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:37,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2022-04-27 14:42:37,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {784#true} is VALID [2022-04-27 14:42:37,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:42:37,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #63#return; {784#true} is VALID [2022-04-27 14:42:37,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2022-04-27 14:42:37,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {784#true} is VALID [2022-04-27 14:42:37,153 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {784#true} is VALID [2022-04-27 14:42:37,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:42:37,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:42:37,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:42:37,153 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} #53#return; {784#true} is VALID [2022-04-27 14:42:37,153 INFO L272 TraceCheckUtils]: 11: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {784#true} is VALID [2022-04-27 14:42:37,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:42:37,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:42:37,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:42:37,154 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} #55#return; {784#true} is VALID [2022-04-27 14:42:37,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:37,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:37,155 INFO L272 TraceCheckUtils]: 18: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:42:37,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:42:37,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:42:37,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:42:37,156 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {784#true} {837#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:37,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:42:37,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:42:37,157 INFO L272 TraceCheckUtils]: 25: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:42:37,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:42:37,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:42:37,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:42:37,158 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {784#true} {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:42:37,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:37,159 INFO L272 TraceCheckUtils]: 31: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:42:37,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:42:37,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:42:37,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:42:37,159 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {784#true} {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:37,160 INFO L272 TraceCheckUtils]: 36: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:37,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:37,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {785#false} is VALID [2022-04-27 14:42:37,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-27 14:42:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 14:42:37,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:37,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075271897] [2022-04-27 14:42:37,397 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:37,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512255942] [2022-04-27 14:42:37,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512255942] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:37,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:37,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:42:37,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5173028] [2022-04-27 14:42:37,398 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:37,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 14:42:37,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:37,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:42:37,418 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:42:37,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:42:37,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:37,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:42:37,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:42:37,419 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:42:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:37,638 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 14:42:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:42:37,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 14:42:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:42:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 14:42:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:42:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 14:42:37,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-27 14:42:37,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:37,690 INFO L225 Difference]: With dead ends: 42 [2022-04-27 14:42:37,690 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:42:37,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:42:37,691 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:37,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:42:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:42:37,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 14:42:37,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:37,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:42:37,708 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:42:37,708 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:42:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:37,709 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 14:42:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:42:37,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:37,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:37,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 14:42:37,710 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 14:42:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:37,712 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 14:42:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:42:37,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:37,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:37,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:37,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:42:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-27 14:42:37,714 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-27 14:42:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:37,714 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-27 14:42:37,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:42:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:42:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 14:42:37,715 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:37,715 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:37,744 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:42:37,915 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:42:37,916 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 2 times [2022-04-27 14:42:37,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:37,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899656004] [2022-04-27 14:42:37,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:37,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:37,931 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:37,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500562807] [2022-04-27 14:42:37,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:42:37,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:37,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:37,938 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:42:37,939 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:42:38,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:42:38,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:38,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 14:42:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:38,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:38,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {1160#true} call ULTIMATE.init(); {1160#true} is VALID [2022-04-27 14:42:38,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {1160#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1160#true} is VALID [2022-04-27 14:42:38,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:42:38,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} #63#return; {1160#true} is VALID [2022-04-27 14:42:38,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {1160#true} call #t~ret5 := main(); {1160#true} is VALID [2022-04-27 14:42:38,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {1160#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1160#true} is VALID [2022-04-27 14:42:38,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:42:38,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:42:38,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:42:38,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:42:38,329 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1160#true} {1160#true} #53#return; {1160#true} is VALID [2022-04-27 14:42:38,329 INFO L272 TraceCheckUtils]: 11: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:42:38,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:42:38,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:42:38,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:42:38,330 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1160#true} {1160#true} #55#return; {1160#true} is VALID [2022-04-27 14:42:38,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {1160#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:38,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:38,330 INFO L272 TraceCheckUtils]: 18: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:42:38,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:42:38,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:42:38,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:42:38,339 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1160#true} {1213#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:38,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:38,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:38,341 INFO L272 TraceCheckUtils]: 25: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:42:38,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:42:38,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:42:38,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:42:38,342 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1160#true} {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:38,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-27 14:42:38,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !false; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-27 14:42:38,343 INFO L272 TraceCheckUtils]: 32: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:42:38,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:42:38,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:42:38,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:42:38,343 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1160#true} {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #57#return; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-27 14:42:38,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-27 14:42:38,344 INFO L272 TraceCheckUtils]: 38: Hoare triple {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:42:38,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:42:38,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:42:38,344 INFO L290 TraceCheckUtils]: 41: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:42:38,345 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1160#true} {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #59#return; {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-27 14:42:38,345 INFO L272 TraceCheckUtils]: 43: Hoare triple {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:38,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:38,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1161#false} is VALID [2022-04-27 14:42:38,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {1161#false} assume !false; {1161#false} is VALID [2022-04-27 14:42:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 14:42:38,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:38,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:38,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899656004] [2022-04-27 14:42:38,646 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:38,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500562807] [2022-04-27 14:42:38,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500562807] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:38,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:38,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:42:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859416477] [2022-04-27 14:42:38,647 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:38,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 14:42:38,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:38,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:42:38,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:38,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:42:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:38,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:42:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:42:38,676 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:42:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:38,926 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-27 14:42:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:42:38,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 14:42:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:42:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 14:42:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:42:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 14:42:38,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-27 14:42:38,960 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:42:38,961 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:42:38,961 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 14:42:38,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:42:38,962 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:38,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:42:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 14:42:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 14:42:38,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:38,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:42:38,971 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:42:38,971 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:42:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:38,972 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 14:42:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:42:38,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:38,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:38,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-27 14:42:38,973 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-27 14:42:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:38,975 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 14:42:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:42:38,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:38,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:38,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:38,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:42:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-27 14:42:38,977 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-27 14:42:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:38,977 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-27 14:42:38,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:42:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:42:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 14:42:38,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:38,978 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:38,982 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:42:39,182 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:42:39,182 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:39,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 3 times [2022-04-27 14:42:39,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:39,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451900386] [2022-04-27 14:42:39,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:39,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:39,194 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:39,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783452541] [2022-04-27 14:42:39,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:42:39,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:39,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:39,195 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:42:39,196 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:42:39,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:42:39,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:39,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:42:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:39,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:39,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {1596#true} call ULTIMATE.init(); {1596#true} is VALID [2022-04-27 14:42:39,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {1596#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); {1596#true} is VALID [2022-04-27 14:42:39,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:39,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1596#true} {1596#true} #63#return; {1596#true} is VALID [2022-04-27 14:42:39,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {1596#true} call #t~ret5 := main(); {1596#true} is VALID [2022-04-27 14:42:39,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {1596#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; {1596#true} is VALID [2022-04-27 14:42:39,693 INFO L272 TraceCheckUtils]: 6: Hoare triple {1596#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:39,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:39,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:39,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:39,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1596#true} {1596#true} #53#return; {1596#true} is VALID [2022-04-27 14:42:39,694 INFO L272 TraceCheckUtils]: 11: Hoare triple {1596#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:39,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:39,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:39,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:39,694 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1596#true} {1596#true} #55#return; {1596#true} is VALID [2022-04-27 14:42:39,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {1596#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1649#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:39,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {1649#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1649#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:39,695 INFO L272 TraceCheckUtils]: 18: Hoare triple {1649#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:39,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:39,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:39,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:39,696 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1596#true} {1649#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1649#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:39,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {1649#(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 + ~x~0; {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:39,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:39,696 INFO L272 TraceCheckUtils]: 25: Hoare triple {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:39,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:39,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:39,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:39,697 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1596#true} {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:39,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:42:39,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:42:39,698 INFO L272 TraceCheckUtils]: 32: Hoare triple {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:39,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:39,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:39,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:39,699 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1596#true} {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:42:39,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:42:39,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:42:39,700 INFO L272 TraceCheckUtils]: 39: Hoare triple {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:39,700 INFO L290 TraceCheckUtils]: 40: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:39,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:39,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:39,700 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1596#true} {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #57#return; {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:42:39,701 INFO L290 TraceCheckUtils]: 44: Hoare triple {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:42:39,701 INFO L272 TraceCheckUtils]: 45: Hoare triple {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:39,701 INFO L290 TraceCheckUtils]: 46: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:39,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:39,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:39,702 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1596#true} {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} #59#return; {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:42:39,703 INFO L272 TraceCheckUtils]: 50: Hoare triple {1737#(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)); {1756#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:39,705 INFO L290 TraceCheckUtils]: 51: Hoare triple {1756#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1760#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:39,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {1760#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1597#false} is VALID [2022-04-27 14:42:39,705 INFO L290 TraceCheckUtils]: 53: Hoare triple {1597#false} assume !false; {1597#false} is VALID [2022-04-27 14:42:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 14:42:39,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:39,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:39,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451900386] [2022-04-27 14:42:39,958 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:39,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783452541] [2022-04-27 14:42:39,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783452541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:39,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:39,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:42:39,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636326591] [2022-04-27 14:42:39,958 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:39,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 14:42:39,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:39,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:42:39,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:39,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:42:39,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:39,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:42:39,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:42:39,981 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:42:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:40,204 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-27 14:42:40,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:42:40,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 14:42:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:42:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 14:42:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:42:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 14:42:40,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-27 14:42:40,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:40,233 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:42:40,233 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 14:42:40,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:42:40,234 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:40,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:42:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 14:42:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-27 14:42:40,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:40,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:42:40,242 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:42:40,242 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:42:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:40,243 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 14:42:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:42:40,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:40,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:40,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-27 14:42:40,244 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-27 14:42:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:40,246 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 14:42:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:42:40,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:40,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:40,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:40,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:42:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-27 14:42:40,247 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-27 14:42:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:40,248 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-27 14:42:40,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:42:40,263 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:42:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 14:42:40,264 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:40,264 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:40,270 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:42:40,468 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:42:40,469 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:40,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:40,469 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 4 times [2022-04-27 14:42:40,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:40,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676698639] [2022-04-27 14:42:40,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:40,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:40,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:40,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596406673] [2022-04-27 14:42:40,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:42:40,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:40,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:40,495 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:42:40,505 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:42:40,548 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:42:40,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:40,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:42:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:40,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:40,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {2048#true} call ULTIMATE.init(); {2048#true} is VALID [2022-04-27 14:42:40,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#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); {2048#true} is VALID [2022-04-27 14:42:40,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:40,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2048#true} {2048#true} #63#return; {2048#true} is VALID [2022-04-27 14:42:40,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {2048#true} call #t~ret5 := main(); {2048#true} is VALID [2022-04-27 14:42:40,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {2048#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; {2048#true} is VALID [2022-04-27 14:42:40,909 INFO L272 TraceCheckUtils]: 6: Hoare triple {2048#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:40,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:40,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:40,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:40,909 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2048#true} {2048#true} #53#return; {2048#true} is VALID [2022-04-27 14:42:40,909 INFO L272 TraceCheckUtils]: 11: Hoare triple {2048#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:40,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:40,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:40,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:40,910 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2048#true} {2048#true} #55#return; {2048#true} is VALID [2022-04-27 14:42:40,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {2048#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:40,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {2101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:40,910 INFO L272 TraceCheckUtils]: 18: Hoare triple {2101#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:40,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:40,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:40,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:40,911 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2048#true} {2101#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:40,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {2101#(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 + ~x~0; {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:40,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:40,912 INFO L272 TraceCheckUtils]: 25: Hoare triple {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:40,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:40,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:40,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:40,913 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2048#true} {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:40,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {2123#(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 + ~x~0; {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:42:40,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:42:40,914 INFO L272 TraceCheckUtils]: 32: Hoare triple {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:40,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:40,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:40,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:40,914 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2048#true} {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:42:40,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {2145#(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 + ~x~0; {2167#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:40,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {2167#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2167#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:40,915 INFO L272 TraceCheckUtils]: 39: Hoare triple {2167#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:40,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:40,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:40,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:40,916 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2048#true} {2167#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {2167#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:40,916 INFO L290 TraceCheckUtils]: 44: Hoare triple {2167#(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 + ~x~0; {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:42:40,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:42:40,917 INFO L272 TraceCheckUtils]: 46: Hoare triple {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:40,917 INFO L290 TraceCheckUtils]: 47: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:40,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:40,919 INFO L290 TraceCheckUtils]: 49: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:40,920 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2048#true} {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:42:40,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:42:40,921 INFO L272 TraceCheckUtils]: 52: Hoare triple {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:40,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:40,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:40,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:40,922 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2048#true} {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:42:40,922 INFO L272 TraceCheckUtils]: 57: Hoare triple {2211#(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)); {2230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:40,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {2230#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:40,923 INFO L290 TraceCheckUtils]: 59: Hoare triple {2234#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2049#false} is VALID [2022-04-27 14:42:40,923 INFO L290 TraceCheckUtils]: 60: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2022-04-27 14:42:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 14:42:40,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:41,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:41,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676698639] [2022-04-27 14:42:41,191 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:41,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596406673] [2022-04-27 14:42:41,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596406673] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:41,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:41,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:42:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610610637] [2022-04-27 14:42:41,191 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:41,192 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 14:42:41,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:41,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:42:41,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:41,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:42:41,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:41,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:42:41,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:42:41,223 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:42:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:41,621 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-27 14:42:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:42:41,621 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 14:42:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:42:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 14:42:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:42:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 14:42:41,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-27 14:42:41,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:41,668 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:42:41,668 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:42:41,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 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:42:41,669 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:41,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:42:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:42:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:42:41,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:41,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:42:41,685 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:42:41,685 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:42:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:41,686 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:42:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:42:41,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:41,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:41,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 14:42:41,687 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 14:42:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:41,689 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:42:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:42:41,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:41,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:41,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:41,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:42:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-27 14:42:41,690 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-27 14:42:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:41,691 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-27 14:42:41,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:42:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:42:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 14:42:41,691 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:41,691 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:41,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 14:42:41,908 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:42:41,908 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:41,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 5 times [2022-04-27 14:42:41,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:41,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096445217] [2022-04-27 14:42:41,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:41,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:41,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:41,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101808215] [2022-04-27 14:42:41,919 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:42:41,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:41,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:41,932 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:42:41,933 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:42:56,627 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:42:56,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:56,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:42:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:56,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:57,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {2538#true} call ULTIMATE.init(); {2538#true} is VALID [2022-04-27 14:42:57,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {2538#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); {2538#true} is VALID [2022-04-27 14:42:57,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:57,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2538#true} {2538#true} #63#return; {2538#true} is VALID [2022-04-27 14:42:57,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {2538#true} call #t~ret5 := main(); {2538#true} is VALID [2022-04-27 14:42:57,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {2538#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; {2538#true} is VALID [2022-04-27 14:42:57,021 INFO L272 TraceCheckUtils]: 6: Hoare triple {2538#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:57,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:57,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:57,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:57,021 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2538#true} {2538#true} #53#return; {2538#true} is VALID [2022-04-27 14:42:57,021 INFO L272 TraceCheckUtils]: 11: Hoare triple {2538#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:57,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:57,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:57,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:57,022 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2538#true} {2538#true} #55#return; {2538#true} is VALID [2022-04-27 14:42:57,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2591#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:57,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {2591#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2591#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:57,022 INFO L272 TraceCheckUtils]: 18: Hoare triple {2591#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:57,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:57,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:57,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:57,027 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2538#true} {2591#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2591#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:57,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {2591#(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 + ~x~0; {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:57,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:57,028 INFO L272 TraceCheckUtils]: 25: Hoare triple {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:57,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:57,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:57,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:57,028 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2538#true} {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:57,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:42:57,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:42:57,029 INFO L272 TraceCheckUtils]: 32: Hoare triple {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:57,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:57,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:57,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:57,030 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2538#true} {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:42:57,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {2635#(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 + ~x~0; {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:42:57,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:42:57,031 INFO L272 TraceCheckUtils]: 39: Hoare triple {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:57,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:57,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:57,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:57,031 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2538#true} {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:42:57,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:42:57,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:42:57,032 INFO L272 TraceCheckUtils]: 46: Hoare triple {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:57,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:57,032 INFO L290 TraceCheckUtils]: 48: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:57,032 INFO L290 TraceCheckUtils]: 49: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:57,033 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2538#true} {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:42:57,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:42:57,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:42:57,034 INFO L272 TraceCheckUtils]: 53: Hoare triple {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:57,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:57,034 INFO L290 TraceCheckUtils]: 55: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:57,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:57,034 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2538#true} {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:42:57,035 INFO L290 TraceCheckUtils]: 58: Hoare triple {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:42:57,035 INFO L272 TraceCheckUtils]: 59: Hoare triple {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:57,035 INFO L290 TraceCheckUtils]: 60: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:57,035 INFO L290 TraceCheckUtils]: 61: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:57,035 INFO L290 TraceCheckUtils]: 62: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:57,039 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2538#true} {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #59#return; {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:42:57,040 INFO L272 TraceCheckUtils]: 64: Hoare triple {2723#(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)); {2742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:57,045 INFO L290 TraceCheckUtils]: 65: Hoare triple {2742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:57,046 INFO L290 TraceCheckUtils]: 66: Hoare triple {2746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2539#false} is VALID [2022-04-27 14:42:57,046 INFO L290 TraceCheckUtils]: 67: Hoare triple {2539#false} assume !false; {2539#false} is VALID [2022-04-27 14:42:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-27 14:42:57,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:57,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:57,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096445217] [2022-04-27 14:42:57,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:57,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101808215] [2022-04-27 14:42:57,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101808215] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:57,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:57,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:42:57,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344822158] [2022-04-27 14:42:57,279 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:57,279 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 14:42:57,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:57,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:42:57,310 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:42:57,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:42:57,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:57,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:42:57,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:42:57,311 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:42:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:57,767 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 14:42:57,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:42:57,767 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 14:42:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:42:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 14:42:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:42:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 14:42:57,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-27 14:42:57,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:57,810 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:42:57,810 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 14:42:57,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 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:42:57,810 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:57,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:42:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 14:42:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 14:42:57,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:57,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:42:57,837 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:42:57,837 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:42:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:57,841 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 14:42:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:42:57,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:57,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:57,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-27 14:42:57,842 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-27 14:42:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:57,843 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 14:42:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:42:57,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:57,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:57,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:57,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:42:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-27 14:42:57,845 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-27 14:42:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:57,845 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-27 14:42:57,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:42:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:42:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 14:42:57,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:57,846 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:57,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 14:42:58,055 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:42:58,058 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:58,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 6 times [2022-04-27 14:42:58,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:58,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226509171] [2022-04-27 14:42:58,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:58,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:58,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:58,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253160542] [2022-04-27 14:42:58,083 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:42:58,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:58,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:58,084 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:42:58,085 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:43:10,108 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:43:10,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:43:10,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:43:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:10,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:43:10,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {3066#true} call ULTIMATE.init(); {3066#true} is VALID [2022-04-27 14:43:10,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {3066#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); {3066#true} is VALID [2022-04-27 14:43:10,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:43:10,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3066#true} {3066#true} #63#return; {3066#true} is VALID [2022-04-27 14:43:10,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {3066#true} call #t~ret5 := main(); {3066#true} is VALID [2022-04-27 14:43:10,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {3066#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; {3066#true} is VALID [2022-04-27 14:43:10,526 INFO L272 TraceCheckUtils]: 6: Hoare triple {3066#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:43:10,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:43:10,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:43:10,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:43:10,527 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3066#true} {3066#true} #53#return; {3066#true} is VALID [2022-04-27 14:43:10,527 INFO L272 TraceCheckUtils]: 11: Hoare triple {3066#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:43:10,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:43:10,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:43:10,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:43:10,527 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3066#true} {3066#true} #55#return; {3066#true} is VALID [2022-04-27 14:43:10,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {3066#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:10,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {3119#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:10,528 INFO L272 TraceCheckUtils]: 18: Hoare triple {3119#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:43:10,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:43:10,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:43:10,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:43:10,528 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3066#true} {3119#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:10,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {3119#(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 + ~x~0; {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:43:10,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:43:10,529 INFO L272 TraceCheckUtils]: 25: Hoare triple {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:43:10,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:43:10,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:43:10,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:43:10,530 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3066#true} {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:43:10,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {3141#(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 + ~x~0; {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:10,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:10,530 INFO L272 TraceCheckUtils]: 32: Hoare triple {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:43:10,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:43:10,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:43:10,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:43:10,531 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3066#true} {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #57#return; {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:10,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:43:10,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:43:10,532 INFO L272 TraceCheckUtils]: 39: Hoare triple {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:43:10,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:43:10,532 INFO L290 TraceCheckUtils]: 41: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:43:10,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:43:10,532 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3066#true} {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #57#return; {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:43:10,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:43:10,533 INFO L290 TraceCheckUtils]: 45: Hoare triple {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !false; {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:43:10,533 INFO L272 TraceCheckUtils]: 46: Hoare triple {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:43:10,533 INFO L290 TraceCheckUtils]: 47: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:43:10,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:43:10,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:43:10,534 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3066#true} {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} #57#return; {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:43:10,534 INFO L290 TraceCheckUtils]: 51: Hoare triple {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:43:10,534 INFO L290 TraceCheckUtils]: 52: Hoare triple {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:43:10,534 INFO L272 TraceCheckUtils]: 53: Hoare triple {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:43:10,534 INFO L290 TraceCheckUtils]: 54: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:43:10,534 INFO L290 TraceCheckUtils]: 55: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:43:10,535 INFO L290 TraceCheckUtils]: 56: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:43:10,535 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3066#true} {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #57#return; {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:43:10,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:43:10,536 INFO L290 TraceCheckUtils]: 59: Hoare triple {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:43:10,536 INFO L272 TraceCheckUtils]: 60: Hoare triple {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:43:10,536 INFO L290 TraceCheckUtils]: 61: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:43:10,536 INFO L290 TraceCheckUtils]: 62: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:43:10,536 INFO L290 TraceCheckUtils]: 63: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:43:10,536 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3066#true} {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:43:10,537 INFO L290 TraceCheckUtils]: 65: Hoare triple {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:43:10,537 INFO L272 TraceCheckUtils]: 66: Hoare triple {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:43:10,537 INFO L290 TraceCheckUtils]: 67: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:43:10,537 INFO L290 TraceCheckUtils]: 68: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:43:10,537 INFO L290 TraceCheckUtils]: 69: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:43:10,537 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3066#true} {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:43:10,538 INFO L272 TraceCheckUtils]: 71: Hoare triple {3273#(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)); {3292#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:43:10,538 INFO L290 TraceCheckUtils]: 72: Hoare triple {3292#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3296#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:43:10,538 INFO L290 TraceCheckUtils]: 73: Hoare triple {3296#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3067#false} is VALID [2022-04-27 14:43:10,539 INFO L290 TraceCheckUtils]: 74: Hoare triple {3067#false} assume !false; {3067#false} is VALID [2022-04-27 14:43:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-27 14:43:10,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:43:10,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:43:10,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226509171] [2022-04-27 14:43:10,778 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:43:10,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253160542] [2022-04-27 14:43:10,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253160542] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:43:10,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:43:10,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:43:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356082139] [2022-04-27 14:43:10,778 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:43:10,779 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-27 14:43:10,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:43:10,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:43:10,817 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:43:10,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:43:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:43:10,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:43:10,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:43:10,817 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:43:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:11,445 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-27 14:43:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:43:11,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-27 14:43:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:43:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:43:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-27 14:43:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:43:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-27 14:43:11,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-27 14:43:11,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:11,494 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:43:11,494 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 14:43:11,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:43:11,494 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:43:11,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 310 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:43:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 14:43:11,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 14:43:11,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:43:11,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:43:11,516 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:43:11,516 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:43:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:11,517 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-27 14:43:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 14:43:11,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:11,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:11,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-27 14:43:11,518 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-27 14:43:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:11,519 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-27 14:43:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 14:43:11,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:11,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:11,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:43:11,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:43:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:43:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-27 14:43:11,521 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-27 14:43:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:43:11,521 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-27 14:43:11,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:43:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 14:43:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 14:43:11,523 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:43:11,523 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:43:11,533 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:43:11,731 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:43:11,731 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:43:11,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:43:11,732 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 7 times [2022-04-27 14:43:11,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:43:11,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236956614] [2022-04-27 14:43:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:43:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:43:11,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:43:11,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670037779] [2022-04-27 14:43:11,746 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:43:11,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:11,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:43:11,747 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:43:11,748 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:43:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:12,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 14:43:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:12,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:43:13,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {3632#true} call ULTIMATE.init(); {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {3632#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); {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3632#true} {3632#true} #63#return; {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {3632#true} call #t~ret5 := main(); {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {3632#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; {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {3632#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3632#true} {3632#true} #53#return; {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L272 TraceCheckUtils]: 11: Hoare triple {3632#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 14:43:13,190 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3632#true} {3632#true} #55#return; {3632#true} is VALID [2022-04-27 14:43:13,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {3632#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3685#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:13,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {3685#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3685#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:13,191 INFO L272 TraceCheckUtils]: 18: Hoare triple {3685#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-27 14:43:13,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-27 14:43:13,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-27 14:43:13,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 14:43:13,192 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3632#true} {3685#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3685#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:13,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {3685#(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 + ~x~0; {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:43:13,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:43:13,193 INFO L272 TraceCheckUtils]: 25: Hoare triple {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-27 14:43:13,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-27 14:43:13,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-27 14:43:13,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 14:43:13,193 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3632#true} {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:43:13,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {3707#(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 + ~x~0; {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:43:13,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:43:13,194 INFO L272 TraceCheckUtils]: 32: Hoare triple {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-27 14:43:13,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-27 14:43:13,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-27 14:43:13,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 14:43:13,195 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3632#true} {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:43:13,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:43:13,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:43:13,195 INFO L272 TraceCheckUtils]: 39: Hoare triple {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-27 14:43:13,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-27 14:43:13,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-27 14:43:13,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 14:43:13,196 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3632#true} {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #57#return; {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:43:13,196 INFO L290 TraceCheckUtils]: 44: Hoare triple {3751#(and (= (+ main_~y~0 (- 3)) 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 + ~x~0; {3773#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:43:13,197 INFO L290 TraceCheckUtils]: 45: Hoare triple {3773#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {3773#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:43:13,197 INFO L272 TraceCheckUtils]: 46: Hoare triple {3773#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-27 14:43:13,197 INFO L290 TraceCheckUtils]: 47: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-27 14:43:13,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-27 14:43:13,197 INFO L290 TraceCheckUtils]: 49: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 14:43:13,198 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3632#true} {3773#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {3773#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:43:13,198 INFO L290 TraceCheckUtils]: 51: Hoare triple {3773#(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 + ~x~0; {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:43:13,198 INFO L290 TraceCheckUtils]: 52: Hoare triple {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:43:13,198 INFO L272 TraceCheckUtils]: 53: Hoare triple {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-27 14:43:13,198 INFO L290 TraceCheckUtils]: 54: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-27 14:43:13,198 INFO L290 TraceCheckUtils]: 55: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-27 14:43:13,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 14:43:13,199 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3632#true} {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #57#return; {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:43:13,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:43:13,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:43:13,200 INFO L272 TraceCheckUtils]: 60: Hoare triple {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-27 14:43:13,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-27 14:43:13,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-27 14:43:13,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 14:43:13,200 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3632#true} {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #57#return; {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:43:13,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-27 14:43:13,201 INFO L290 TraceCheckUtils]: 66: Hoare triple {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} assume !false; {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-27 14:43:13,201 INFO L272 TraceCheckUtils]: 67: Hoare triple {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-27 14:43:13,201 INFO L290 TraceCheckUtils]: 68: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-27 14:43:13,201 INFO L290 TraceCheckUtils]: 69: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-27 14:43:13,201 INFO L290 TraceCheckUtils]: 70: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 14:43:13,202 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3632#true} {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} #57#return; {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-27 14:43:13,202 INFO L290 TraceCheckUtils]: 72: Hoare triple {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3861#(and (<= main_~k~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-27 14:43:13,202 INFO L272 TraceCheckUtils]: 73: Hoare triple {3861#(and (<= main_~k~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-27 14:43:13,202 INFO L290 TraceCheckUtils]: 74: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-27 14:43:13,202 INFO L290 TraceCheckUtils]: 75: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-27 14:43:13,202 INFO L290 TraceCheckUtils]: 76: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 14:43:13,203 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3632#true} {3861#(and (<= main_~k~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} #59#return; {3861#(and (<= main_~k~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-27 14:43:13,204 INFO L272 TraceCheckUtils]: 78: Hoare triple {3861#(and (<= main_~k~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3880#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:43:13,204 INFO L290 TraceCheckUtils]: 79: Hoare triple {3880#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3884#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:43:13,204 INFO L290 TraceCheckUtils]: 80: Hoare triple {3884#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3633#false} is VALID [2022-04-27 14:43:13,204 INFO L290 TraceCheckUtils]: 81: Hoare triple {3633#false} assume !false; {3633#false} is VALID [2022-04-27 14:43:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-27 14:43:13,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:43:13,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:43:13,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236956614] [2022-04-27 14:43:13,513 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:43:13,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670037779] [2022-04-27 14:43:13,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670037779] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:43:13,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:43:13,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:43:13,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800661220] [2022-04-27 14:43:13,514 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:43:13,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-27 14:43:13,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:43:13,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:43:13,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:13,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:43:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:43:13,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:43:13,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:43:13,556 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:43:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:14,069 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-27 14:43:14,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:43:14,069 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-27 14:43:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:43:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:43:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-27 14:43:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:43:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-27 14:43:14,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-27 14:43:14,122 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:43:14,123 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:43:14,123 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 14:43:14,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:43:14,124 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:43:14,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:43:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 14:43:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 14:43:14,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:43:14,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:43:14,147 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:43:14,147 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:43:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:14,148 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-27 14:43:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:43:14,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:14,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:14,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-27 14:43:14,149 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-27 14:43:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:14,150 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-27 14:43:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:43:14,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:14,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:14,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:43:14,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:43:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:43:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-27 14:43:14,151 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-27 14:43:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:43:14,151 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-27 14:43:14,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:43:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:43:14,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-27 14:43:14,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:43:14,152 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:43:14,173 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:43:14,352 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:43:14,353 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:43:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:43:14,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 8 times [2022-04-27 14:43:14,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:43:14,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125568467] [2022-04-27 14:43:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:43:14,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:43:14,363 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:43:14,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1453708885] [2022-04-27 14:43:14,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:43:14,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:14,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:43:14,365 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:43:14,371 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:44:11,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:44:11,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:44:11,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:44:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:44:11,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:44:11,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {4236#true} call ULTIMATE.init(); {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {4236#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); {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4236#true} {4236#true} #63#return; {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {4236#true} call #t~ret5 := main(); {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {4236#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; {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L272 TraceCheckUtils]: 6: Hoare triple {4236#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4236#true} {4236#true} #53#return; {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L272 TraceCheckUtils]: 11: Hoare triple {4236#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,746 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4236#true} {4236#true} #55#return; {4236#true} is VALID [2022-04-27 14:44:11,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {4236#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4289#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:11,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {4289#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4289#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:11,747 INFO L272 TraceCheckUtils]: 18: Hoare triple {4289#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-27 14:44:11,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-27 14:44:11,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-27 14:44:11,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,748 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4236#true} {4289#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4289#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:11,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {4289#(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 + ~x~0; {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:44:11,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:44:11,749 INFO L272 TraceCheckUtils]: 25: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-27 14:44:11,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-27 14:44:11,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-27 14:44:11,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,749 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4236#true} {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:44:11,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {4311#(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 + ~x~0; {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:11,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:11,750 INFO L272 TraceCheckUtils]: 32: Hoare triple {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-27 14:44:11,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-27 14:44:11,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-27 14:44:11,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,752 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4236#true} {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #57#return; {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:11,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:44:11,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !false; {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:44:11,752 INFO L272 TraceCheckUtils]: 39: Hoare triple {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-27 14:44:11,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-27 14:44:11,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-27 14:44:11,753 INFO L290 TraceCheckUtils]: 42: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,753 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4236#true} {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #57#return; {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:44:11,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4377#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:44:11,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {4377#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {4377#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:44:11,754 INFO L272 TraceCheckUtils]: 46: Hoare triple {4377#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-27 14:44:11,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-27 14:44:11,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-27 14:44:11,754 INFO L290 TraceCheckUtils]: 49: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,754 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4236#true} {4377#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {4377#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:44:11,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {4377#(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 + ~x~0; {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:44:11,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:44:11,756 INFO L272 TraceCheckUtils]: 53: Hoare triple {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-27 14:44:11,756 INFO L290 TraceCheckUtils]: 54: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-27 14:44:11,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-27 14:44:11,756 INFO L290 TraceCheckUtils]: 56: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,756 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4236#true} {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #57#return; {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:44:11,757 INFO L290 TraceCheckUtils]: 58: Hoare triple {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 14:44:11,757 INFO L290 TraceCheckUtils]: 59: Hoare triple {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !false; {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 14:44:11,757 INFO L272 TraceCheckUtils]: 60: Hoare triple {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-27 14:44:11,757 INFO L290 TraceCheckUtils]: 61: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-27 14:44:11,757 INFO L290 TraceCheckUtils]: 62: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-27 14:44:11,757 INFO L290 TraceCheckUtils]: 63: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,758 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4236#true} {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} #57#return; {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 14:44:11,758 INFO L290 TraceCheckUtils]: 65: Hoare triple {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:44:11,759 INFO L290 TraceCheckUtils]: 66: Hoare triple {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:44:11,759 INFO L272 TraceCheckUtils]: 67: Hoare triple {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-27 14:44:11,759 INFO L290 TraceCheckUtils]: 68: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-27 14:44:11,759 INFO L290 TraceCheckUtils]: 69: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-27 14:44:11,759 INFO L290 TraceCheckUtils]: 70: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,759 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4236#true} {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} #57#return; {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:44:11,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:44:11,760 INFO L290 TraceCheckUtils]: 73: Hoare triple {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:44:11,760 INFO L272 TraceCheckUtils]: 74: Hoare triple {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-27 14:44:11,760 INFO L290 TraceCheckUtils]: 75: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-27 14:44:11,760 INFO L290 TraceCheckUtils]: 76: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-27 14:44:11,760 INFO L290 TraceCheckUtils]: 77: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,761 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4236#true} {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #57#return; {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:44:11,761 INFO L290 TraceCheckUtils]: 79: Hoare triple {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4487#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:44:11,761 INFO L272 TraceCheckUtils]: 80: Hoare triple {4487#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-27 14:44:11,761 INFO L290 TraceCheckUtils]: 81: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-27 14:44:11,762 INFO L290 TraceCheckUtils]: 82: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-27 14:44:11,762 INFO L290 TraceCheckUtils]: 83: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-27 14:44:11,762 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4236#true} {4487#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #59#return; {4487#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:44:11,763 INFO L272 TraceCheckUtils]: 85: Hoare triple {4487#(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)); {4506#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:44:11,763 INFO L290 TraceCheckUtils]: 86: Hoare triple {4506#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4510#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:44:11,763 INFO L290 TraceCheckUtils]: 87: Hoare triple {4510#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4237#false} is VALID [2022-04-27 14:44:11,763 INFO L290 TraceCheckUtils]: 88: Hoare triple {4237#false} assume !false; {4237#false} is VALID [2022-04-27 14:44:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-27 14:44:11,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:44:12,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:44:12,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125568467] [2022-04-27 14:44:12,002 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:44:12,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453708885] [2022-04-27 14:44:12,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453708885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:44:12,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:44:12,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:44:12,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804375618] [2022-04-27 14:44:12,003 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:44:12,003 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-27 14:44:12,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:44:12,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:44:12,043 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:44:12,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:44:12,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:44:12,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:44:12,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:44:12,044 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:44:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:12,856 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-27 14:44:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:44:12,857 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-27 14:44:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:44:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:44:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-27 14:44:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:44:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-27 14:44:12,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-27 14:44:12,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:44:12,924 INFO L225 Difference]: With dead ends: 63 [2022-04-27 14:44:12,924 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 14:44:12,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:44:12,925 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:44:12,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:44:12,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 14:44:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-27 14:44:12,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:44:12,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:44:12,947 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:44:12,947 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:44:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:12,948 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-27 14:44:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 14:44:12,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:12,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:12,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-27 14:44:12,950 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-27 14:44:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:12,951 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-27 14:44:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 14:44:12,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:12,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:12,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:44:12,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:44:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:44:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-27 14:44:12,953 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-27 14:44:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:44:12,953 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-27 14:44:12,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:44:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 14:44:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-27 14:44:12,954 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:44:12,954 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:44:12,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-27 14:44:13,170 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:44:13,170 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:44:13,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:44:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 9 times [2022-04-27 14:44:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:44:13,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902586143] [2022-04-27 14:44:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:44:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:44:13,191 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:44:13,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [78958869] [2022-04-27 14:44:13,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:44:13,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:44:13,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:44:13,195 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:44:13,196 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:54:42,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 14:54:42,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:42,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-27 14:54:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:42,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:42,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {4878#true} call ULTIMATE.init(); {4878#true} is VALID [2022-04-27 14:54:42,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {4878#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); {4878#true} is VALID [2022-04-27 14:54:42,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4878#true} {4878#true} #63#return; {4878#true} is VALID [2022-04-27 14:54:42,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {4878#true} call #t~ret5 := main(); {4878#true} is VALID [2022-04-27 14:54:42,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {4878#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; {4878#true} is VALID [2022-04-27 14:54:42,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {4878#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4878#true} {4878#true} #53#return; {4878#true} is VALID [2022-04-27 14:54:42,776 INFO L272 TraceCheckUtils]: 11: Hoare triple {4878#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,776 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4878#true} {4878#true} #55#return; {4878#true} is VALID [2022-04-27 14:54:42,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {4878#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4931#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:42,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {4931#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4931#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:42,791 INFO L272 TraceCheckUtils]: 18: Hoare triple {4931#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,792 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4878#true} {4931#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4931#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:42,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {4931#(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 + ~x~0; {4953#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:54:42,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {4953#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {4953#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:54:42,793 INFO L272 TraceCheckUtils]: 25: Hoare triple {4953#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,793 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4878#true} {4953#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #57#return; {4953#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:54:42,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {4953#(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 + ~x~0; {4975#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {4975#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !false; {4975#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,794 INFO L272 TraceCheckUtils]: 32: Hoare triple {4975#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,795 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4878#true} {4975#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #57#return; {4975#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {4975#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 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 + ~x~0; {4997#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {4997#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !false; {4997#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,796 INFO L272 TraceCheckUtils]: 39: Hoare triple {4997#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,796 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4878#true} {4997#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #57#return; {4997#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {4997#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 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 + ~x~0; {5019#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {5019#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} assume !false; {5019#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,797 INFO L272 TraceCheckUtils]: 46: Hoare triple {5019#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,797 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4878#true} {5019#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} #57#return; {5019#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,798 INFO L290 TraceCheckUtils]: 51: Hoare triple {5019#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 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 + ~x~0; {5041#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,798 INFO L290 TraceCheckUtils]: 52: Hoare triple {5041#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {5041#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,798 INFO L272 TraceCheckUtils]: 53: Hoare triple {5041#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,798 INFO L290 TraceCheckUtils]: 54: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,798 INFO L290 TraceCheckUtils]: 55: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,798 INFO L290 TraceCheckUtils]: 56: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,798 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4878#true} {5041#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0) (< 0 main_~k~0))} #57#return; {5041#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,799 INFO L290 TraceCheckUtils]: 58: Hoare triple {5041#(and (= 2 (+ main_~c~0 (- 3))) (= 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 + ~x~0; {5063#(and (= 2 (+ main_~c~0 (- 4))) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:54:42,799 INFO L290 TraceCheckUtils]: 59: Hoare triple {5063#(and (= 2 (+ main_~c~0 (- 4))) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {5063#(and (= 2 (+ main_~c~0 (- 4))) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:54:42,799 INFO L272 TraceCheckUtils]: 60: Hoare triple {5063#(and (= 2 (+ main_~c~0 (- 4))) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,799 INFO L290 TraceCheckUtils]: 63: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,800 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4878#true} {5063#(and (= 2 (+ main_~c~0 (- 4))) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #57#return; {5063#(and (= 2 (+ main_~c~0 (- 4))) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:54:42,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {5063#(and (= 2 (+ main_~c~0 (- 4))) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5085#(and (= (+ (- 2) main_~y~0) 5) (= 2 (+ main_~c~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,800 INFO L290 TraceCheckUtils]: 66: Hoare triple {5085#(and (= (+ (- 2) main_~y~0) 5) (= 2 (+ main_~c~0 (- 5))) (< 0 main_~k~0))} assume !false; {5085#(and (= (+ (- 2) main_~y~0) 5) (= 2 (+ main_~c~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,800 INFO L272 TraceCheckUtils]: 67: Hoare triple {5085#(and (= (+ (- 2) main_~y~0) 5) (= 2 (+ main_~c~0 (- 5))) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,801 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4878#true} {5085#(and (= (+ (- 2) main_~y~0) 5) (= 2 (+ main_~c~0 (- 5))) (< 0 main_~k~0))} #57#return; {5085#(and (= (+ (- 2) main_~y~0) 5) (= 2 (+ main_~c~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,801 INFO L290 TraceCheckUtils]: 72: Hoare triple {5085#(and (= (+ (- 2) main_~y~0) 5) (= 2 (+ main_~c~0 (- 5))) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5107#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,801 INFO L290 TraceCheckUtils]: 73: Hoare triple {5107#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))) (< 0 main_~k~0))} assume !false; {5107#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,801 INFO L272 TraceCheckUtils]: 74: Hoare triple {5107#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,801 INFO L290 TraceCheckUtils]: 75: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,801 INFO L290 TraceCheckUtils]: 76: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,802 INFO L290 TraceCheckUtils]: 77: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,802 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4878#true} {5107#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))) (< 0 main_~k~0))} #57#return; {5107#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:42,802 INFO L290 TraceCheckUtils]: 79: Hoare triple {5107#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))) (< 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 + ~x~0; {5129#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:54:42,802 INFO L290 TraceCheckUtils]: 80: Hoare triple {5129#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5129#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:54:42,802 INFO L272 TraceCheckUtils]: 81: Hoare triple {5129#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,802 INFO L290 TraceCheckUtils]: 82: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,803 INFO L290 TraceCheckUtils]: 83: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,803 INFO L290 TraceCheckUtils]: 84: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,803 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {4878#true} {5129#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #57#return; {5129#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:54:42,804 INFO L290 TraceCheckUtils]: 86: Hoare triple {5129#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5151#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:54:42,804 INFO L272 TraceCheckUtils]: 87: Hoare triple {5151#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4878#true} is VALID [2022-04-27 14:54:42,804 INFO L290 TraceCheckUtils]: 88: Hoare triple {4878#true} ~cond := #in~cond; {4878#true} is VALID [2022-04-27 14:54:42,804 INFO L290 TraceCheckUtils]: 89: Hoare triple {4878#true} assume !(0 == ~cond); {4878#true} is VALID [2022-04-27 14:54:42,804 INFO L290 TraceCheckUtils]: 90: Hoare triple {4878#true} assume true; {4878#true} is VALID [2022-04-27 14:54:42,804 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {4878#true} {5151#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #59#return; {5151#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:54:42,805 INFO L272 TraceCheckUtils]: 92: Hoare triple {5151#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5170#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:42,805 INFO L290 TraceCheckUtils]: 93: Hoare triple {5170#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5174#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:42,805 INFO L290 TraceCheckUtils]: 94: Hoare triple {5174#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4879#false} is VALID [2022-04-27 14:54:42,805 INFO L290 TraceCheckUtils]: 95: Hoare triple {4879#false} assume !false; {4879#false} is VALID [2022-04-27 14:54:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 22 proven. 135 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-27 14:54:42,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:43,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:43,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902586143] [2022-04-27 14:54:43,530 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:43,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78958869] [2022-04-27 14:54:43,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78958869] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:43,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:43,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 14:54:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533080119] [2022-04-27 14:54:43,531 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:43,531 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-27 14:54:43,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:43,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:54:43,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:43,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 14:54:43,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:43,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 14:54:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:54:43,561 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:54:44,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:44,387 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-27 14:54:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 14:54:44,387 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-27 14:54:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:54:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-27 14:54:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:54:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-27 14:54:44,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2022-04-27 14:54:44,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:44,437 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:54:44,437 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 14:54:44,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-04-27 14:54:44,437 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:44,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 423 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:54:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 14:54:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-27 14:54:44,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:44,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:54:44,487 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:54:44,487 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:54:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:44,488 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 14:54:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 14:54:44,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:44,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:44,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-27 14:54:44,489 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-27 14:54:44,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:44,490 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 14:54:44,490 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 14:54:44,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:44,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:44,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:44,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:54:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-04-27 14:54:44,492 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 96 [2022-04-27 14:54:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:44,492 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-04-27 14:54:44,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:54:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 14:54:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-27 14:54:44,493 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:44,493 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:44,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 14:54:44,693 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:54:44,693 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:44,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 10 times [2022-04-27 14:54:44,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:44,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964096947] [2022-04-27 14:54:44,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:44,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:44,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:44,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145767040] [2022-04-27 14:54:44,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:54:44,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:44,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:44,706 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:54:44,707 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:54:44,768 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:54:44,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:44,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 14:54:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:44,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:45,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {5734#true} call ULTIMATE.init(); {5734#true} is VALID [2022-04-27 14:54:45,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {5734#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); {5734#true} is VALID [2022-04-27 14:54:45,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5734#true} {5734#true} #63#return; {5734#true} is VALID [2022-04-27 14:54:45,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {5734#true} call #t~ret5 := main(); {5734#true} is VALID [2022-04-27 14:54:45,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {5734#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; {5734#true} is VALID [2022-04-27 14:54:45,249 INFO L272 TraceCheckUtils]: 6: Hoare triple {5734#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,250 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5734#true} {5734#true} #53#return; {5734#true} is VALID [2022-04-27 14:54:45,250 INFO L272 TraceCheckUtils]: 11: Hoare triple {5734#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,250 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5734#true} {5734#true} #55#return; {5734#true} is VALID [2022-04-27 14:54:45,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {5734#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5787#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:45,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {5787#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5787#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:45,251 INFO L272 TraceCheckUtils]: 18: Hoare triple {5787#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,251 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5734#true} {5787#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {5787#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:45,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {5787#(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 + ~x~0; {5809#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:45,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {5809#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {5809#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:45,252 INFO L272 TraceCheckUtils]: 25: Hoare triple {5809#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,252 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5734#true} {5809#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {5809#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:45,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {5809#(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 + ~x~0; {5831#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:45,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {5831#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {5831#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:45,253 INFO L272 TraceCheckUtils]: 32: Hoare triple {5831#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,254 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5734#true} {5831#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #57#return; {5831#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:45,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {5831#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5853#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:54:45,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {5853#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {5853#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:54:45,255 INFO L272 TraceCheckUtils]: 39: Hoare triple {5853#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,255 INFO L290 TraceCheckUtils]: 40: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,255 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5734#true} {5853#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #57#return; {5853#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:54:45,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {5853#(and (= (+ main_~y~0 (- 3)) 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 + ~x~0; {5875#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:54:45,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {5875#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !false; {5875#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:54:45,256 INFO L272 TraceCheckUtils]: 46: Hoare triple {5875#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,256 INFO L290 TraceCheckUtils]: 47: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,256 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5734#true} {5875#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} #57#return; {5875#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:54:45,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {5875#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5897#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:54:45,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {5897#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {5897#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:54:45,257 INFO L272 TraceCheckUtils]: 53: Hoare triple {5897#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,258 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {5734#true} {5897#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {5897#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:54:45,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {5897#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5919#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:54:45,258 INFO L290 TraceCheckUtils]: 59: Hoare triple {5919#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {5919#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:54:45,259 INFO L272 TraceCheckUtils]: 60: Hoare triple {5919#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,259 INFO L290 TraceCheckUtils]: 61: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,259 INFO L290 TraceCheckUtils]: 62: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,259 INFO L290 TraceCheckUtils]: 63: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,259 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5734#true} {5919#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #57#return; {5919#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:54:45,259 INFO L290 TraceCheckUtils]: 65: Hoare triple {5919#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5941#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:54:45,260 INFO L290 TraceCheckUtils]: 66: Hoare triple {5941#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {5941#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:54:45,260 INFO L272 TraceCheckUtils]: 67: Hoare triple {5941#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,260 INFO L290 TraceCheckUtils]: 68: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,260 INFO L290 TraceCheckUtils]: 69: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,260 INFO L290 TraceCheckUtils]: 70: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,260 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5734#true} {5941#(and (= 7 main_~y~0) (= 7 main_~c~0))} #57#return; {5941#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:54:45,261 INFO L290 TraceCheckUtils]: 72: Hoare triple {5941#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5963#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:54:45,261 INFO L290 TraceCheckUtils]: 73: Hoare triple {5963#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {5963#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:54:45,261 INFO L272 TraceCheckUtils]: 74: Hoare triple {5963#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,261 INFO L290 TraceCheckUtils]: 75: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,261 INFO L290 TraceCheckUtils]: 76: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,261 INFO L290 TraceCheckUtils]: 77: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,262 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5734#true} {5963#(and (= main_~y~0 8) (= main_~c~0 8))} #57#return; {5963#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:54:45,262 INFO L290 TraceCheckUtils]: 79: Hoare triple {5963#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5985#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:54:45,262 INFO L290 TraceCheckUtils]: 80: Hoare triple {5985#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {5985#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:54:45,262 INFO L272 TraceCheckUtils]: 81: Hoare triple {5985#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,262 INFO L290 TraceCheckUtils]: 82: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,263 INFO L290 TraceCheckUtils]: 83: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,263 INFO L290 TraceCheckUtils]: 84: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,263 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5734#true} {5985#(and (= main_~y~0 9) (= main_~c~0 9))} #57#return; {5985#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:54:45,263 INFO L290 TraceCheckUtils]: 86: Hoare triple {5985#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6007#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:54:45,264 INFO L290 TraceCheckUtils]: 87: Hoare triple {6007#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {6007#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:54:45,264 INFO L272 TraceCheckUtils]: 88: Hoare triple {6007#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,264 INFO L290 TraceCheckUtils]: 89: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,264 INFO L290 TraceCheckUtils]: 90: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,264 INFO L290 TraceCheckUtils]: 91: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,264 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {5734#true} {6007#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #57#return; {6007#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:54:45,265 INFO L290 TraceCheckUtils]: 93: Hoare triple {6007#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {6029#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:54:45,265 INFO L272 TraceCheckUtils]: 94: Hoare triple {6029#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5734#true} is VALID [2022-04-27 14:54:45,265 INFO L290 TraceCheckUtils]: 95: Hoare triple {5734#true} ~cond := #in~cond; {5734#true} is VALID [2022-04-27 14:54:45,265 INFO L290 TraceCheckUtils]: 96: Hoare triple {5734#true} assume !(0 == ~cond); {5734#true} is VALID [2022-04-27 14:54:45,265 INFO L290 TraceCheckUtils]: 97: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-27 14:54:45,265 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {5734#true} {6029#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} #59#return; {6029#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:54:45,266 INFO L272 TraceCheckUtils]: 99: Hoare triple {6029#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6048#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:45,266 INFO L290 TraceCheckUtils]: 100: Hoare triple {6048#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6052#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:45,267 INFO L290 TraceCheckUtils]: 101: Hoare triple {6052#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5735#false} is VALID [2022-04-27 14:54:45,267 INFO L290 TraceCheckUtils]: 102: Hoare triple {5735#false} assume !false; {5735#false} is VALID [2022-04-27 14:54:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-27 14:54:45,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:45,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:45,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964096947] [2022-04-27 14:54:45,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:45,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145767040] [2022-04-27 14:54:45,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145767040] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:45,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:45,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 14:54:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932949713] [2022-04-27 14:54:45,516 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:45,516 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-27 14:54:45,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:45,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-27 14:54:45,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:45,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:54:45,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:45,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:54:45,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:54:45,565 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-27 14:54:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:46,720 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-27 14:54:46,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:54:46,720 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-27 14:54:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-27 14:54:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-27 14:54:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-27 14:54:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-27 14:54:46,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 78 transitions. [2022-04-27 14:54:46,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:46,781 INFO L225 Difference]: With dead ends: 69 [2022-04-27 14:54:46,781 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 14:54:46,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:54:46,783 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:46,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 486 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 14:54:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 14:54:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-27 14:54:46,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:46,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:54:46,811 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:54:46,811 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:54:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:46,813 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-27 14:54:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-27 14:54:46,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:46,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:46,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-27 14:54:46,813 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-27 14:54:46,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:46,814 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-27 14:54:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-27 14:54:46,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:46,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:46,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:46,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:54:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-04-27 14:54:46,816 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 103 [2022-04-27 14:54:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:46,816 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-04-27 14:54:46,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-27 14:54:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-27 14:54:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 14:54:46,817 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:46,817 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:46,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-27 14:54:47,033 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:54:47,034 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:47,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 11 times [2022-04-27 14:54:47,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:47,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927429403] [2022-04-27 14:54:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:47,045 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:47,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [536458278] [2022-04-27 14:54:47,045 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:54:47,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:47,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:47,046 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:54:47,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process