/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:33:18,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:33:18,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:33:18,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:33:18,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:33:18,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:33:18,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:33:18,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:33:18,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:33:18,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:33:18,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:33:18,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:33:18,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:33:18,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:33:18,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:33:18,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:33:18,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:33:18,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:33:18,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:33:18,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:33:18,881 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:33:18,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:33:18,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:33:18,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:33:18,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:33:18,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:33:18,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:33:18,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:33:18,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:33:18,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:33:18,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:33:18,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:33:18,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:33:18,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:33:18,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:33:18,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:33:18,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:33:18,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:33:18,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:33:18,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:33:18,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:33:18,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:33:18,902 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:33:18,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:33:18,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:33:18,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:33:18,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:33:18,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:33:18,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:33:18,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:33:18,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:33:18,933 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:33:18,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:33:18,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:33:18,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:33:18,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:33:18,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:33:18,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:33:18,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:33:18,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:33:18,935 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:33:18,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:33:18,936 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:33:18,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:33:18,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:33:18,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:33:18,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:33:18,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:33:18,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:33:18,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:33:18,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:33:18,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:33:18,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:33:18,937 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:33:18,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:33:18,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:33:18,938 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:33:19,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:33:19,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:33:19,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:33:19,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:33:19,169 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:33:19,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-04-27 14:33:19,211 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2860dec17/cfb4b35eaa5f44d7ae04f3440eaf8f51/FLAGcf7ea71de [2022-04-27 14:33:19,555 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:33:19,555 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-04-27 14:33:19,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2860dec17/cfb4b35eaa5f44d7ae04f3440eaf8f51/FLAGcf7ea71de [2022-04-27 14:33:19,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2860dec17/cfb4b35eaa5f44d7ae04f3440eaf8f51 [2022-04-27 14:33:19,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:33:19,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:33:19,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:33:19,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:33:19,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:33:19,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:33:19" (1/1) ... [2022-04-27 14:33:19,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38abf3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:19, skipping insertion in model container [2022-04-27 14:33:19,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:33:19" (1/1) ... [2022-04-27 14:33:19,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:33:19,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:33:19,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c[458,471] [2022-04-27 14:33:19,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:33:19,782 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:33:19,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c[458,471] [2022-04-27 14:33:19,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:33:19,820 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:33:19,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:19 WrapperNode [2022-04-27 14:33:19,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:33:19,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:33:19,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:33:19,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:33:19,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:19" (1/1) ... [2022-04-27 14:33:19,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:19" (1/1) ... [2022-04-27 14:33:19,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:19" (1/1) ... [2022-04-27 14:33:19,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:19" (1/1) ... [2022-04-27 14:33:19,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:19" (1/1) ... [2022-04-27 14:33:19,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:19" (1/1) ... [2022-04-27 14:33:19,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:19" (1/1) ... [2022-04-27 14:33:19,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:33:19,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:33:19,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:33:19,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:33:19,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:19" (1/1) ... [2022-04-27 14:33:19,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:33:19,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:19,878 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:33:19,890 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:33:19,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:33:19,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:33:19,910 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:33:19,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:33:19,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:33:19,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:33:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:33:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:33:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:33:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:33:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:33:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:33:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:33:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:33:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:33:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:33:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:33:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:33:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:33:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:33:19,957 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:33:19,958 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:33:20,077 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:33:20,083 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:33:20,083 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:33:20,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:33:20 BoogieIcfgContainer [2022-04-27 14:33:20,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:33:20,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:33:20,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:33:20,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:33:20,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:33:19" (1/3) ... [2022-04-27 14:33:20,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9590fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:33:20, skipping insertion in model container [2022-04-27 14:33:20,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:33:19" (2/3) ... [2022-04-27 14:33:20,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9590fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:33:20, skipping insertion in model container [2022-04-27 14:33:20,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:33:20" (3/3) ... [2022-04-27 14:33:20,091 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound10.c [2022-04-27 14:33:20,103 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:33:20,103 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:33:20,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:33:20,144 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@2592eba0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32efb928 [2022-04-27 14:33:20,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:33:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:20,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 14:33:20,157 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:20,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:20,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:20,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:20,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times [2022-04-27 14:33:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:20,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287357186] [2022-04-27 14:33:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:20,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:33:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:20,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-27 14:33:20,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 14:33:20,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-27 14:33:20,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:33:20,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-27 14:33:20,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 14:33:20,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-27 14:33:20,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-27 14:33:20,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {26#true} is VALID [2022-04-27 14:33:20,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-27 14:33:20,416 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27#false} is VALID [2022-04-27 14:33:20,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-27 14:33:20,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-27 14:33:20,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-27 14:33:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:20,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287357186] [2022-04-27 14:33:20,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287357186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:33:20,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:33:20,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:33:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042275844] [2022-04-27 14:33:20,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:33:20,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:33:20,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:20,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:20,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:20,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:33:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:20,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:33:20,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:33:20,496 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:20,626 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-27 14:33:20,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:33:20,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:33:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 14:33:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 14:33:20,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-27 14:33:20,717 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:33:20,727 INFO L225 Difference]: With dead ends: 41 [2022-04-27 14:33:20,728 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 14:33:20,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:33:20,734 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:20,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:33:20,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 14:33:20,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-27 14:33:20,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:20,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:20,757 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:20,757 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:20,760 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 14:33:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 14:33:20,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:20,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:20,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 14:33:20,761 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 14:33:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:20,764 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 14:33:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 14:33:20,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:20,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:20,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:20,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-27 14:33:20,767 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-27 14:33:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:20,768 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-27 14:33:20,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 14:33:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:33:20,769 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:20,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:20,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:33:20,769 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:20,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:20,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times [2022-04-27 14:33:20,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:20,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874091975] [2022-04-27 14:33:20,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:20,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:20,791 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:20,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866835190] [2022-04-27 14:33:20,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:20,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:20,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:20,794 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:33:20,795 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:33:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:20,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:33:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:20,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:21,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {155#true} is VALID [2022-04-27 14:33:21,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:21,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(<= ~counter~0 0)} assume true; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:21,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#(<= ~counter~0 0)} {155#true} #57#return; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:21,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#(<= ~counter~0 0)} call #t~ret6 := main(); {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:21,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {163#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:21,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {179#(<= |main_#t~post5| 0)} is VALID [2022-04-27 14:33:21,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {156#false} is VALID [2022-04-27 14:33:21,013 INFO L272 TraceCheckUtils]: 8: Hoare triple {156#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {156#false} is VALID [2022-04-27 14:33:21,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#false} ~cond := #in~cond; {156#false} is VALID [2022-04-27 14:33:21,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {156#false} assume 0 == ~cond; {156#false} is VALID [2022-04-27 14:33:21,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#false} assume !false; {156#false} is VALID [2022-04-27 14:33:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:21,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:33:21,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:21,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874091975] [2022-04-27 14:33:21,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:21,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866835190] [2022-04-27 14:33:21,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866835190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:33:21,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:33:21,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:33:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797549300] [2022-04-27 14:33:21,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:33:21,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:33:21,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:21,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:21,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:21,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:33:21,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:21,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:33:21,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:33:21,038 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:21,089 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 14:33:21,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:33:21,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:33:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 14:33:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 14:33:21,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-27 14:33:21,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:21,138 INFO L225 Difference]: With dead ends: 28 [2022-04-27 14:33:21,138 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 14:33:21,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:33:21,142 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:21,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:33:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 14:33:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 14:33:21,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:21,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:21,154 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:21,154 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:21,156 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 14:33:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:33:21,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:21,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:21,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 14:33:21,157 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 14:33:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:21,159 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 14:33:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:33:21,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:21,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:21,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:21,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 14:33:21,163 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-27 14:33:21,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:21,163 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 14:33:21,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 14:33:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:33:21,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:21,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:21,189 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:33:21,379 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:33:21,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times [2022-04-27 14:33:21,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:21,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156320806] [2022-04-27 14:33:21,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:21,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:21,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:21,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186592140] [2022-04-27 14:33:21,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:21,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:21,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:21,402 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:33:21,410 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:33:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:21,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:33:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:21,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:21,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {305#true} is VALID [2022-04-27 14:33:21,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {305#true} is VALID [2022-04-27 14:33:21,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 14:33:21,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #57#return; {305#true} is VALID [2022-04-27 14:33:21,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} call #t~ret6 := main(); {305#true} is VALID [2022-04-27 14:33:21,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:21,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:21,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:21,588 INFO L272 TraceCheckUtils]: 8: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:21,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:21,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {306#false} is VALID [2022-04-27 14:33:21,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#false} assume !false; {306#false} is VALID [2022-04-27 14:33:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:21,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:33:21,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:21,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156320806] [2022-04-27 14:33:21,600 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:21,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186592140] [2022-04-27 14:33:21,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186592140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:33:21,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:33:21,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:33:21,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774476092] [2022-04-27 14:33:21,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:33:21,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:33:21,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:21,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:21,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:21,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:33:21,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:21,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:33:21,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:33:21,614 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:21,743 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 14:33:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:33:21,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:33:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 14:33:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 14:33:21,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-27 14:33:21,776 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:33:21,777 INFO L225 Difference]: With dead ends: 30 [2022-04-27 14:33:21,777 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:33:21,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:33:21,779 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:21,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:33:21,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:33:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:33:21,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:21,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:21,786 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:21,786 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:21,788 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:33:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:33:21,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:21,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:21,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:33:21,789 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:33:21,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:21,791 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:33:21,791 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:33:21,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:21,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:21,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:21,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 14:33:21,793 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-27 14:33:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:21,793 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 14:33:21,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:33:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:33:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:33:21,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:21,794 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:21,819 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:33:22,011 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:33:22,012 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:22,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times [2022-04-27 14:33:22,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:22,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332814261] [2022-04-27 14:33:22,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:22,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:22,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [891812943] [2022-04-27 14:33:22,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:22,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:22,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:22,027 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:33:22,047 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:33:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:22,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:33:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:22,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:22,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-27 14:33:22,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:22,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(<= ~counter~0 0)} assume true; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:22,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#(<= ~counter~0 0)} {481#true} #57#return; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:22,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#(<= ~counter~0 0)} call #t~ret6 := main(); {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:22,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {489#(<= ~counter~0 0)} is VALID [2022-04-27 14:33:22,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:22,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:22,215 INFO L272 TraceCheckUtils]: 8: Hoare triple {505#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:22,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(<= ~counter~0 1)} ~cond := #in~cond; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:22,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= ~counter~0 1)} assume !(0 == ~cond); {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:22,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#(<= ~counter~0 1)} assume true; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:22,219 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {505#(<= ~counter~0 1)} {505#(<= ~counter~0 1)} #51#return; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:22,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {505#(<= ~counter~0 1)} is VALID [2022-04-27 14:33:22,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {530#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:33:22,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {482#false} is VALID [2022-04-27 14:33:22,221 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {482#false} is VALID [2022-04-27 14:33:22,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-27 14:33:22,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-27 14:33:22,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-27 14:33:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:22,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:33:22,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-27 14:33:22,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-27 14:33:22,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-27 14:33:22,358 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {482#false} is VALID [2022-04-27 14:33:22,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {558#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {482#false} is VALID [2022-04-27 14:33:22,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {558#(< |main_#t~post5| 10)} is VALID [2022-04-27 14:33:22,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {562#(< ~counter~0 10)} is VALID [2022-04-27 14:33:22,360 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {481#true} {562#(< ~counter~0 10)} #51#return; {562#(< ~counter~0 10)} is VALID [2022-04-27 14:33:22,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-27 14:33:22,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#true} assume !(0 == ~cond); {481#true} is VALID [2022-04-27 14:33:22,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#true} ~cond := #in~cond; {481#true} is VALID [2022-04-27 14:33:22,360 INFO L272 TraceCheckUtils]: 8: Hoare triple {562#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {481#true} is VALID [2022-04-27 14:33:22,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {562#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {562#(< ~counter~0 10)} is VALID [2022-04-27 14:33:22,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {587#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {562#(< ~counter~0 10)} is VALID [2022-04-27 14:33:22,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#(< ~counter~0 9)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {587#(< ~counter~0 9)} is VALID [2022-04-27 14:33:22,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#(< ~counter~0 9)} call #t~ret6 := main(); {587#(< ~counter~0 9)} is VALID [2022-04-27 14:33:22,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#(< ~counter~0 9)} {481#true} #57#return; {587#(< ~counter~0 9)} is VALID [2022-04-27 14:33:22,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#(< ~counter~0 9)} assume true; {587#(< ~counter~0 9)} is VALID [2022-04-27 14:33:22,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {587#(< ~counter~0 9)} is VALID [2022-04-27 14:33:22,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-27 14:33:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:22,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:22,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332814261] [2022-04-27 14:33:22,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:22,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891812943] [2022-04-27 14:33:22,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891812943] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:33:22,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:33:22,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:33:22,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286830543] [2022-04-27 14:33:22,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:33:22,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 14:33:22,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:22,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:33:22,393 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:33:22,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:33:22,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:22,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:33:22,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:33:22,394 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:33:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:22,602 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-27 14:33:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:33:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 14:33:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:33:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-27 14:33:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:33:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-27 14:33:22,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 70 transitions. [2022-04-27 14:33:22,689 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:33:22,695 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:33:22,695 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:33:22,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:33:22,699 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:22,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:33:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:33:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-27 14:33:22,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:22,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:33:22,725 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:33:22,725 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:33:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:22,736 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:33:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:33:22,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:22,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:22,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-27 14:33:22,739 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-27 14:33:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:22,741 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:33:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:33:22,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:22,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:22,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:22,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:33:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-27 14:33:22,744 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 20 [2022-04-27 14:33:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:22,744 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-27 14:33:22,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:33:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-27 14:33:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:33:22,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:22,745 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:22,770 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:33:22,945 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:33:22,946 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:22,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times [2022-04-27 14:33:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:22,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825323939] [2022-04-27 14:33:22,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:22,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:22,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:22,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860655545] [2022-04-27 14:33:22,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:22,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:22,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:22,960 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:33:22,963 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:33:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:22,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:33:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:23,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:23,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {875#true} call ULTIMATE.init(); {875#true} is VALID [2022-04-27 14:33:23,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {875#true} is VALID [2022-04-27 14:33:23,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:33:23,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} #57#return; {875#true} is VALID [2022-04-27 14:33:23,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} call #t~ret6 := main(); {875#true} is VALID [2022-04-27 14:33:23,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:23,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:23,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:23,131 INFO L272 TraceCheckUtils]: 8: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {875#true} is VALID [2022-04-27 14:33:23,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#true} ~cond := #in~cond; {875#true} is VALID [2022-04-27 14:33:23,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {875#true} assume !(0 == ~cond); {875#true} is VALID [2022-04-27 14:33:23,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:33:23,132 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {875#true} {895#(and (= main_~x~0 0) (= main_~y~0 0))} #51#return; {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:23,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:33:23,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:33:23,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:33:23,134 INFO L272 TraceCheckUtils]: 16: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:23,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:23,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {876#false} is VALID [2022-04-27 14:33:23,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#false} assume !false; {876#false} is VALID [2022-04-27 14:33:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:33:23,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:33:23,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#false} assume !false; {876#false} is VALID [2022-04-27 14:33:23,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {876#false} is VALID [2022-04-27 14:33:23,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:23,374 INFO L272 TraceCheckUtils]: 16: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:23,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:23,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:23,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:23,427 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {875#true} {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #51#return; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:23,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:33:23,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {875#true} assume !(0 == ~cond); {875#true} is VALID [2022-04-27 14:33:23,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#true} ~cond := #in~cond; {875#true} is VALID [2022-04-27 14:33:23,428 INFO L272 TraceCheckUtils]: 8: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {875#true} is VALID [2022-04-27 14:33:23,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:23,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:23,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:33:23,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} call #t~ret6 := main(); {875#true} is VALID [2022-04-27 14:33:23,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} #57#return; {875#true} is VALID [2022-04-27 14:33:23,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} assume true; {875#true} is VALID [2022-04-27 14:33:23,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {875#true} is VALID [2022-04-27 14:33:23,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {875#true} call ULTIMATE.init(); {875#true} is VALID [2022-04-27 14:33:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 14:33:23,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:23,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825323939] [2022-04-27 14:33:23,431 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:23,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860655545] [2022-04-27 14:33:23,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860655545] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:33:23,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:33:23,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:33:23,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225456880] [2022-04-27 14:33:23,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:33:23,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 14:33:23,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:23,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:33:23,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:23,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:33:23,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:23,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:33:23,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:33:23,929 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:33:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:24,041 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-27 14:33:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:33:24,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 14:33:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:33:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 14:33:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:33:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 14:33:24,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-27 14:33:24,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:24,527 INFO L225 Difference]: With dead ends: 62 [2022-04-27 14:33:24,527 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 14:33:24,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:33:24,528 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:24,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:33:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 14:33:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-04-27 14:33:24,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:24,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:24,550 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:24,550 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:24,553 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-27 14:33:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-27 14:33:24,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:24,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:24,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 14:33:24,557 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 14:33:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:24,561 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-27 14:33:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-27 14:33:24,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:24,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:24,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:24,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-04-27 14:33:24,563 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2022-04-27 14:33:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:24,564 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-04-27 14:33:24,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:33:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-27 14:33:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:33:24,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:24,566 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:24,591 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:33:24,779 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:33:24,779 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:24,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times [2022-04-27 14:33:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:24,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720623654] [2022-04-27 14:33:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:24,790 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:24,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1012542755] [2022-04-27 14:33:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:24,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:24,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:24,792 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:33:24,797 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:33:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:24,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 14:33:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:24,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:25,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1257#true} is VALID [2022-04-27 14:33:25,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1257#true} is VALID [2022-04-27 14:33:25,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-27 14:33:25,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} #57#return; {1257#true} is VALID [2022-04-27 14:33:25,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} call #t~ret6 := main(); {1257#true} is VALID [2022-04-27 14:33:25,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:25,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:25,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:25,268 INFO L272 TraceCheckUtils]: 8: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1257#true} is VALID [2022-04-27 14:33:25,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {1257#true} ~cond := #in~cond; {1257#true} is VALID [2022-04-27 14:33:25,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {1257#true} assume !(0 == ~cond); {1257#true} is VALID [2022-04-27 14:33:25,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-27 14:33:25,269 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1257#true} {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:25,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:33:25,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:33:25,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:33:25,271 INFO L272 TraceCheckUtils]: 16: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1257#true} is VALID [2022-04-27 14:33:25,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {1257#true} ~cond := #in~cond; {1315#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:25,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {1315#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:33:25,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:33:25,273 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} #51#return; {1326#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:33:25,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {1326#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1330#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:33:25,274 INFO L272 TraceCheckUtils]: 22: Hoare triple {1330#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1334#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:25,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {1334#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1338#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:25,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {1338#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1258#false} is VALID [2022-04-27 14:33:25,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2022-04-27 14:33:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 14:33:25,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:33:57,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:57,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720623654] [2022-04-27 14:33:57,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:57,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012542755] [2022-04-27 14:33:57,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012542755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:33:57,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:33:57,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:33:57,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991989831] [2022-04-27 14:33:57,732 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:33:57,732 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 14:33:57,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:57,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:57,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:57,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:33:57,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:57,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:33:57,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=162, Unknown=2, NotChecked=0, Total=210 [2022-04-27 14:33:57,757 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:58,085 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-27 14:33:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:33:58,086 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 14:33:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 14:33:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-27 14:33:58,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-27 14:33:58,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:58,124 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:33:58,124 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:33:58,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=67, Invalid=237, Unknown=2, NotChecked=0, Total=306 [2022-04-27 14:33:58,126 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:58,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:33:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:33:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:33:58,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:58,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:58,150 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:58,150 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:58,152 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-27 14:33:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:33:58,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:58,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:58,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:33:58,153 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:33:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:58,154 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-27 14:33:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:33:58,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:58,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:58,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:58,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-27 14:33:58,159 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 26 [2022-04-27 14:33:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:58,159 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-27 14:33:58,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:33:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 14:33:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:33:58,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:58,160 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:58,185 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:33:58,383 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:33:58,383 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 2 times [2022-04-27 14:33:58,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:58,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598143298] [2022-04-27 14:33:58,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:58,395 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:58,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443339996] [2022-04-27 14:33:58,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:33:58,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:58,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:58,396 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:33:58,399 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:33:58,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:33:58,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:33:58,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:33:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:58,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:58,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-27 14:33:58,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1622#true} is VALID [2022-04-27 14:33:58,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:33:58,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1622#true} {1622#true} #57#return; {1622#true} is VALID [2022-04-27 14:33:58,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {1622#true} call #t~ret6 := main(); {1622#true} is VALID [2022-04-27 14:33:58,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {1622#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:58,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:58,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:58,776 INFO L272 TraceCheckUtils]: 8: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1622#true} is VALID [2022-04-27 14:33:58,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:33:58,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:33:58,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:33:58,777 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1622#true} {1642#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:33:58,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:33:58,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:33:58,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:33:58,778 INFO L272 TraceCheckUtils]: 16: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1622#true} is VALID [2022-04-27 14:33:58,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:33:58,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:33:58,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:33:58,779 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1622#true} {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:33:58,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:33:58,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:33:58,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:33:58,781 INFO L272 TraceCheckUtils]: 24: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1622#true} is VALID [2022-04-27 14:33:58,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-27 14:33:58,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-27 14:33:58,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-27 14:33:58,782 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1622#true} {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #51#return; {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:33:58,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1717#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:33:58,783 INFO L272 TraceCheckUtils]: 30: Hoare triple {1717#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1721#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:58,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {1721#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1725#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:58,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {1725#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1623#false} is VALID [2022-04-27 14:33:58,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-27 14:33:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:33:58,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:33:59,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:59,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598143298] [2022-04-27 14:33:59,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:59,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443339996] [2022-04-27 14:33:59,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443339996] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:33:59,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:33:59,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:33:59,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641532101] [2022-04-27 14:33:59,102 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:33:59,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-27 14:33:59,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:59,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:59,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:59,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:33:59,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:59,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:33:59,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:33:59,127 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:59,363 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-27 14:33:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:33:59,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-27 14:33:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:33:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 14:33:59,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 14:33:59,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-27 14:33:59,403 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:33:59,404 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:33:59,404 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:33:59,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:33:59,405 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:33:59,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:33:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:33:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:33:59,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:33:59,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:59,431 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:59,431 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:59,433 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-27 14:33:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:33:59,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:59,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:59,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:33:59,433 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 14:33:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:33:59,435 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-27 14:33:59,435 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:33:59,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:33:59,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:33:59,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:33:59,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:33:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:33:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-27 14:33:59,437 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 34 [2022-04-27 14:33:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:33:59,437 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-27 14:33:59,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:33:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 14:33:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 14:33:59,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:33:59,438 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:33:59,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 14:33:59,651 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:33:59,651 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:33:59,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:33:59,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 3 times [2022-04-27 14:33:59,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:33:59,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182997785] [2022-04-27 14:33:59,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:33:59,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:33:59,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:33:59,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [234412066] [2022-04-27 14:33:59,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:33:59,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:33:59,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:33:59,671 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:33:59,677 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:33:59,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:33:59,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:33:59,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:33:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:33:59,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:00,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {2005#true} call ULTIMATE.init(); {2005#true} is VALID [2022-04-27 14:34:00,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2005#true} is VALID [2022-04-27 14:34:00,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:34:00,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2005#true} {2005#true} #57#return; {2005#true} is VALID [2022-04-27 14:34:00,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {2005#true} call #t~ret6 := main(); {2005#true} is VALID [2022-04-27 14:34:00,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {2005#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:00,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:00,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:00,120 INFO L272 TraceCheckUtils]: 8: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:34:00,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:34:00,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:34:00,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:34:00,121 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2005#true} {2025#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:00,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:34:00,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:34:00,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:34:00,122 INFO L272 TraceCheckUtils]: 16: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:34:00,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:34:00,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:34:00,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:34:00,123 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2005#true} {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:34:00,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:00,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:00,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:00,127 INFO L272 TraceCheckUtils]: 24: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:34:00,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:34:00,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:34:00,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:34:00,128 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2005#true} {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #51#return; {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:00,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:34:00,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:34:00,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:34:00,129 INFO L272 TraceCheckUtils]: 32: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2005#true} is VALID [2022-04-27 14:34:00,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-04-27 14:34:00,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-04-27 14:34:00,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-04-27 14:34:00,130 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2005#true} {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #51#return; {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:34:00,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2125#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:34:00,131 INFO L272 TraceCheckUtils]: 38: Hoare triple {2125#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:00,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:00,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {2133#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2006#false} is VALID [2022-04-27 14:34:00,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {2006#false} assume !false; {2006#false} is VALID [2022-04-27 14:34:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:34:00,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:00,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:00,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182997785] [2022-04-27 14:34:00,419 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:00,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234412066] [2022-04-27 14:34:00,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234412066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:00,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:00,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:34:00,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169683393] [2022-04-27 14:34:00,420 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:00,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-27 14:34:00,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:00,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:34:00,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:00,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:34:00,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:00,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:34:00,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:34:00,450 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:34:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:00,776 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:34:00,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:34:00,776 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-27 14:34:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:34:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:34:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:34:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:34:00,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-27 14:34:00,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:00,815 INFO L225 Difference]: With dead ends: 52 [2022-04-27 14:34:00,815 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 14:34:00,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:34:00,816 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:00,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:34:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 14:34:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 14:34:00,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:00,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:00,839 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:00,840 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:00,841 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-27 14:34:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:34:00,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:00,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:00,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-27 14:34:00,842 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-27 14:34:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:00,843 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-27 14:34:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:34:00,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:00,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:00,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:00,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-27 14:34:00,845 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-27 14:34:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:00,846 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-27 14:34:00,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:34:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 14:34:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 14:34:00,847 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:00,847 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:00,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 14:34:01,063 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:34:01,064 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:01,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:01,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 2 times [2022-04-27 14:34:01,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:01,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734787527] [2022-04-27 14:34:01,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:01,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:01,080 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:01,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1787662934] [2022-04-27 14:34:01,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:34:01,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:01,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:01,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:34:01,102 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:34:01,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:34:01,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:34:01,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:34:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:01,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:01,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2423#true} is VALID [2022-04-27 14:34:01,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:01,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {2431#(<= ~counter~0 0)} assume true; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:01,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2431#(<= ~counter~0 0)} {2423#true} #57#return; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:01,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {2431#(<= ~counter~0 0)} call #t~ret6 := main(); {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:01,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {2431#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2431#(<= ~counter~0 0)} is VALID [2022-04-27 14:34:01,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {2431#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:01,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:01,402 INFO L272 TraceCheckUtils]: 8: Hoare triple {2447#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:01,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {2447#(<= ~counter~0 1)} ~cond := #in~cond; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:01,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {2447#(<= ~counter~0 1)} assume !(0 == ~cond); {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:01,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {2447#(<= ~counter~0 1)} assume true; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:01,404 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2447#(<= ~counter~0 1)} {2447#(<= ~counter~0 1)} #51#return; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:01,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {2447#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2447#(<= ~counter~0 1)} is VALID [2022-04-27 14:34:01,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {2447#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:34:01,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:34:01,406 INFO L272 TraceCheckUtils]: 16: Hoare triple {2472#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:34:01,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {2472#(<= ~counter~0 2)} ~cond := #in~cond; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:34:01,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#(<= ~counter~0 2)} assume !(0 == ~cond); {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:34:01,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {2472#(<= ~counter~0 2)} assume true; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:34:01,407 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2472#(<= ~counter~0 2)} {2472#(<= ~counter~0 2)} #51#return; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:34:01,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2472#(<= ~counter~0 2)} is VALID [2022-04-27 14:34:01,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {2472#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:34:01,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {2497#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:34:01,416 INFO L272 TraceCheckUtils]: 24: Hoare triple {2497#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:34:01,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {2497#(<= ~counter~0 3)} ~cond := #in~cond; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:34:01,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {2497#(<= ~counter~0 3)} assume !(0 == ~cond); {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:34:01,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {2497#(<= ~counter~0 3)} assume true; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:34:01,422 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2497#(<= ~counter~0 3)} {2497#(<= ~counter~0 3)} #51#return; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:34:01,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {2497#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2497#(<= ~counter~0 3)} is VALID [2022-04-27 14:34:01,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {2497#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:34:01,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {2522#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:34:01,426 INFO L272 TraceCheckUtils]: 32: Hoare triple {2522#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:34:01,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {2522#(<= ~counter~0 4)} ~cond := #in~cond; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:34:01,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {2522#(<= ~counter~0 4)} assume !(0 == ~cond); {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:34:01,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {2522#(<= ~counter~0 4)} assume true; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:34:01,431 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2522#(<= ~counter~0 4)} {2522#(<= ~counter~0 4)} #51#return; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:34:01,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {2522#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2522#(<= ~counter~0 4)} is VALID [2022-04-27 14:34:01,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {2522#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2547#(<= |main_#t~post5| 4)} is VALID [2022-04-27 14:34:01,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {2547#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {2424#false} is VALID [2022-04-27 14:34:01,433 INFO L272 TraceCheckUtils]: 40: Hoare triple {2424#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2424#false} is VALID [2022-04-27 14:34:01,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {2424#false} ~cond := #in~cond; {2424#false} is VALID [2022-04-27 14:34:01,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#false} assume 0 == ~cond; {2424#false} is VALID [2022-04-27 14:34:01,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2022-04-27 14:34:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:34:01,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:01,762 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2022-04-27 14:34:01,762 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#false} assume 0 == ~cond; {2424#false} is VALID [2022-04-27 14:34:01,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {2424#false} ~cond := #in~cond; {2424#false} is VALID [2022-04-27 14:34:01,762 INFO L272 TraceCheckUtils]: 40: Hoare triple {2424#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2424#false} is VALID [2022-04-27 14:34:01,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {2575#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {2424#false} is VALID [2022-04-27 14:34:01,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {2579#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2575#(< |main_#t~post5| 10)} is VALID [2022-04-27 14:34:01,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {2579#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2579#(< ~counter~0 10)} is VALID [2022-04-27 14:34:01,764 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2423#true} {2579#(< ~counter~0 10)} #51#return; {2579#(< ~counter~0 10)} is VALID [2022-04-27 14:34:01,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:34:01,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:34:01,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:34:01,765 INFO L272 TraceCheckUtils]: 32: Hoare triple {2579#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:34:01,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {2579#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {2579#(< ~counter~0 10)} is VALID [2022-04-27 14:34:01,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {2604#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2579#(< ~counter~0 10)} is VALID [2022-04-27 14:34:01,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {2604#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2604#(< ~counter~0 9)} is VALID [2022-04-27 14:34:01,769 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2423#true} {2604#(< ~counter~0 9)} #51#return; {2604#(< ~counter~0 9)} is VALID [2022-04-27 14:34:01,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:34:01,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:34:01,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:34:01,769 INFO L272 TraceCheckUtils]: 24: Hoare triple {2604#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:34:01,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {2604#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {2604#(< ~counter~0 9)} is VALID [2022-04-27 14:34:01,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {2629#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2604#(< ~counter~0 9)} is VALID [2022-04-27 14:34:01,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {2629#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2629#(< ~counter~0 8)} is VALID [2022-04-27 14:34:01,772 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2423#true} {2629#(< ~counter~0 8)} #51#return; {2629#(< ~counter~0 8)} is VALID [2022-04-27 14:34:01,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:34:01,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:34:01,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:34:01,772 INFO L272 TraceCheckUtils]: 16: Hoare triple {2629#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:34:01,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {2629#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {2629#(< ~counter~0 8)} is VALID [2022-04-27 14:34:01,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {2654#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2629#(< ~counter~0 8)} is VALID [2022-04-27 14:34:01,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {2654#(< ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2654#(< ~counter~0 7)} is VALID [2022-04-27 14:34:01,773 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2423#true} {2654#(< ~counter~0 7)} #51#return; {2654#(< ~counter~0 7)} is VALID [2022-04-27 14:34:01,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {2423#true} assume true; {2423#true} is VALID [2022-04-27 14:34:01,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {2423#true} assume !(0 == ~cond); {2423#true} is VALID [2022-04-27 14:34:01,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {2423#true} ~cond := #in~cond; {2423#true} is VALID [2022-04-27 14:34:01,774 INFO L272 TraceCheckUtils]: 8: Hoare triple {2654#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2423#true} is VALID [2022-04-27 14:34:01,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {2654#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {2654#(< ~counter~0 7)} is VALID [2022-04-27 14:34:01,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {2679#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2654#(< ~counter~0 7)} is VALID [2022-04-27 14:34:01,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {2679#(< ~counter~0 6)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2679#(< ~counter~0 6)} is VALID [2022-04-27 14:34:01,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {2679#(< ~counter~0 6)} call #t~ret6 := main(); {2679#(< ~counter~0 6)} is VALID [2022-04-27 14:34:01,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2679#(< ~counter~0 6)} {2423#true} #57#return; {2679#(< ~counter~0 6)} is VALID [2022-04-27 14:34:01,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {2679#(< ~counter~0 6)} assume true; {2679#(< ~counter~0 6)} is VALID [2022-04-27 14:34:01,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2679#(< ~counter~0 6)} is VALID [2022-04-27 14:34:01,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2423#true} is VALID [2022-04-27 14:34:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:34:01,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:01,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734787527] [2022-04-27 14:34:01,778 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:01,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787662934] [2022-04-27 14:34:01,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787662934] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:34:01,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:34:01,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 14:34:01,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708085980] [2022-04-27 14:34:01,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:01,779 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2022-04-27 14:34:01,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:01,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:34:01,838 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:34:01,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:34:01,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:01,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:34:01,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:34:01,839 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:34:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:02,275 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2022-04-27 14:34:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:34:02,275 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2022-04-27 14:34:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:34:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-27 14:34:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:34:02,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-27 14:34:02,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 123 transitions. [2022-04-27 14:34:02,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:02,388 INFO L225 Difference]: With dead ends: 123 [2022-04-27 14:34:02,388 INFO L226 Difference]: Without dead ends: 118 [2022-04-27 14:34:02,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:34:02,389 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 120 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:02,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 148 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:34:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-27 14:34:02,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 93. [2022-04-27 14:34:02,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:02,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:02,434 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:02,434 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:02,437 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-27 14:34:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-27 14:34:02,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:02,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:02,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 118 states. [2022-04-27 14:34:02,438 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 118 states. [2022-04-27 14:34:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:02,440 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-27 14:34:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-27 14:34:02,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:02,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:02,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:02,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-04-27 14:34:02,443 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 44 [2022-04-27 14:34:02,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:02,443 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-04-27 14:34:02,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:34:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-04-27 14:34:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 14:34:02,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:02,444 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:02,466 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:34:02,661 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:34:02,661 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:02,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 4 times [2022-04-27 14:34:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:02,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455896021] [2022-04-27 14:34:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:02,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:02,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886405145] [2022-04-27 14:34:02,687 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:34:02,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:02,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:02,688 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:34:02,712 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:34:02,781 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:34:02,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:34:02,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 14:34:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:02,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:03,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {3256#true} call ULTIMATE.init(); {3256#true} is VALID [2022-04-27 14:34:03,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {3256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3256#true} is VALID [2022-04-27 14:34:03,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:34:03,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3256#true} {3256#true} #57#return; {3256#true} is VALID [2022-04-27 14:34:03,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {3256#true} call #t~ret6 := main(); {3256#true} is VALID [2022-04-27 14:34:03,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {3256#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:03,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:03,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:03,220 INFO L272 TraceCheckUtils]: 8: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:34:03,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:34:03,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:34:03,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:34:03,220 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3256#true} {3276#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:03,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:34:03,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:34:03,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:34:03,222 INFO L272 TraceCheckUtils]: 16: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:34:03,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:34:03,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:34:03,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:34:03,222 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3256#true} {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #51#return; {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:34:03,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {3301#(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 + ~x~0; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:03,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:03,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:03,224 INFO L272 TraceCheckUtils]: 24: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:34:03,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:34:03,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:34:03,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:34:03,224 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3256#true} {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #51#return; {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:03,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {3326#(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 + ~x~0; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:03,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:03,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:03,226 INFO L272 TraceCheckUtils]: 32: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:34:03,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:34:03,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:34:03,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:34:03,226 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3256#true} {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #51#return; {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:03,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 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 + ~x~0; {3376#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:34:03,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {3376#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3376#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:34:03,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {3376#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {3376#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:34:03,228 INFO L272 TraceCheckUtils]: 40: Hoare triple {3376#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3256#true} is VALID [2022-04-27 14:34:03,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {3256#true} ~cond := #in~cond; {3256#true} is VALID [2022-04-27 14:34:03,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {3256#true} assume !(0 == ~cond); {3256#true} is VALID [2022-04-27 14:34:03,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {3256#true} assume true; {3256#true} is VALID [2022-04-27 14:34:03,228 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3256#true} {3376#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #51#return; {3376#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:34:03,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {3376#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {3401#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:34:03,229 INFO L272 TraceCheckUtils]: 46: Hoare triple {3401#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3405#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:03,230 INFO L290 TraceCheckUtils]: 47: Hoare triple {3405#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3409#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:03,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {3409#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3257#false} is VALID [2022-04-27 14:34:03,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {3257#false} assume !false; {3257#false} is VALID [2022-04-27 14:34:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:34:03,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:03,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:03,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455896021] [2022-04-27 14:34:03,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:03,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886405145] [2022-04-27 14:34:03,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886405145] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:03,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:03,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:34:03,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112642037] [2022-04-27 14:34:03,818 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:03,819 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-27 14:34:03,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:03,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:03,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:03,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:34:03,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:34:03,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:34:03,847 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:04,262 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-04-27 14:34:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:34:04,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-27 14:34:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-27 14:34:04,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-27 14:34:04,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-27 14:34:04,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:04,308 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:34:04,308 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:34:04,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:34:04,309 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:04,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:34:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:34:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:34:04,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:04,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:04,370 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:04,370 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:04,372 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-27 14:34:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 14:34:04,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:04,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:04,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:04,373 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:04,375 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-27 14:34:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 14:34:04,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:04,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:04,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:04,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2022-04-27 14:34:04,377 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 50 [2022-04-27 14:34:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:04,378 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2022-04-27 14:34:04,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:34:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 14:34:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 14:34:04,378 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:04,378 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:04,402 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:34:04,599 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:34:04,599 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:04,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 5 times [2022-04-27 14:34:04,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:04,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360358269] [2022-04-27 14:34:04,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:04,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:04,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177207691] [2022-04-27 14:34:04,615 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:34:04,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:04,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:04,617 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:34:04,627 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:34:04,796 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:34:04,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:34:04,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:34:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:04,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:05,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {3992#true} call ULTIMATE.init(); {3992#true} is VALID [2022-04-27 14:34:05,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {3992#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3992#true} is VALID [2022-04-27 14:34:05,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-04-27 14:34:05,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3992#true} {3992#true} #57#return; {3992#true} is VALID [2022-04-27 14:34:05,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {3992#true} call #t~ret6 := main(); {3992#true} is VALID [2022-04-27 14:34:05,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {3992#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:05,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {4012#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:05,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {4012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:05,177 INFO L272 TraceCheckUtils]: 8: Hoare triple {4012#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3992#true} is VALID [2022-04-27 14:34:05,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {3992#true} ~cond := #in~cond; {3992#true} is VALID [2022-04-27 14:34:05,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {3992#true} assume !(0 == ~cond); {3992#true} is VALID [2022-04-27 14:34:05,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-04-27 14:34:05,178 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3992#true} {4012#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {4012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:05,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {4012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:34:05,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {4037#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:34:05,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {4037#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {4037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:34:05,184 INFO L272 TraceCheckUtils]: 16: Hoare triple {4037#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3992#true} is VALID [2022-04-27 14:34:05,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {3992#true} ~cond := #in~cond; {3992#true} is VALID [2022-04-27 14:34:05,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {3992#true} assume !(0 == ~cond); {3992#true} is VALID [2022-04-27 14:34:05,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-04-27 14:34:05,185 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3992#true} {4037#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {4037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:34:05,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {4037#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:34:05,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {4062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:34:05,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {4062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {4062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:34:05,186 INFO L272 TraceCheckUtils]: 24: Hoare triple {4062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3992#true} is VALID [2022-04-27 14:34:05,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {3992#true} ~cond := #in~cond; {3992#true} is VALID [2022-04-27 14:34:05,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {3992#true} assume !(0 == ~cond); {3992#true} is VALID [2022-04-27 14:34:05,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-04-27 14:34:05,187 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3992#true} {4062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #51#return; {4062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:34:05,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {4062#(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 + ~x~0; {4087#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:34:05,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {4087#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4087#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:34:05,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {4087#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {4087#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:34:05,189 INFO L272 TraceCheckUtils]: 32: Hoare triple {4087#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3992#true} is VALID [2022-04-27 14:34:05,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {3992#true} ~cond := #in~cond; {3992#true} is VALID [2022-04-27 14:34:05,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {3992#true} assume !(0 == ~cond); {3992#true} is VALID [2022-04-27 14:34:05,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-04-27 14:34:05,189 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3992#true} {4087#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {4087#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:34:05,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {4087#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4112#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:34:05,191 INFO L290 TraceCheckUtils]: 38: Hoare triple {4112#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4112#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:34:05,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {4112#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {4112#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:34:05,191 INFO L272 TraceCheckUtils]: 40: Hoare triple {4112#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3992#true} is VALID [2022-04-27 14:34:05,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {3992#true} ~cond := #in~cond; {3992#true} is VALID [2022-04-27 14:34:05,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {3992#true} assume !(0 == ~cond); {3992#true} is VALID [2022-04-27 14:34:05,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-04-27 14:34:05,192 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3992#true} {4112#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #51#return; {4112#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:34:05,193 INFO L290 TraceCheckUtils]: 45: Hoare triple {4112#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4137#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:34:05,193 INFO L290 TraceCheckUtils]: 46: Hoare triple {4137#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4137#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:34:05,199 INFO L290 TraceCheckUtils]: 47: Hoare triple {4137#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {4137#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:34:05,200 INFO L272 TraceCheckUtils]: 48: Hoare triple {4137#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3992#true} is VALID [2022-04-27 14:34:05,200 INFO L290 TraceCheckUtils]: 49: Hoare triple {3992#true} ~cond := #in~cond; {3992#true} is VALID [2022-04-27 14:34:05,200 INFO L290 TraceCheckUtils]: 50: Hoare triple {3992#true} assume !(0 == ~cond); {3992#true} is VALID [2022-04-27 14:34:05,200 INFO L290 TraceCheckUtils]: 51: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-04-27 14:34:05,200 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3992#true} {4137#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #51#return; {4137#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:34:05,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {4137#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {4162#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:34:05,201 INFO L272 TraceCheckUtils]: 54: Hoare triple {4162#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4166#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:05,202 INFO L290 TraceCheckUtils]: 55: Hoare triple {4166#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4170#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:05,202 INFO L290 TraceCheckUtils]: 56: Hoare triple {4170#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3993#false} is VALID [2022-04-27 14:34:05,202 INFO L290 TraceCheckUtils]: 57: Hoare triple {3993#false} assume !false; {3993#false} is VALID [2022-04-27 14:34:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:34:05,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:05,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:05,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360358269] [2022-04-27 14:34:05,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:05,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177207691] [2022-04-27 14:34:05,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177207691] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:05,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:05,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:34:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916208951] [2022-04-27 14:34:05,450 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:05,451 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-27 14:34:05,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:05,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:34:05,483 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:34:05,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:34:05,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:05,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:34:05,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:34:05,484 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:34:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:05,984 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-04-27 14:34:05,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:34:05,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-27 14:34:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:34:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-27 14:34:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:34:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-27 14:34:05,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-27 14:34:06,028 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:34:06,029 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:34:06,029 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:34:06,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 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:34:06,030 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:06,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:34:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:34:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:34:06,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:06,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:06,079 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:06,079 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:06,081 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-27 14:34:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 14:34:06,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:06,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:06,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:06,082 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:06,083 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-27 14:34:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 14:34:06,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:06,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:06,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:06,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-04-27 14:34:06,086 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 58 [2022-04-27 14:34:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:06,086 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-04-27 14:34:06,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:34:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 14:34:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 14:34:06,087 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:06,087 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:06,095 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:34:06,292 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:34:06,292 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 6 times [2022-04-27 14:34:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:06,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808462157] [2022-04-27 14:34:06,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:06,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:06,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:06,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [609081121] [2022-04-27 14:34:06,304 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:34:06,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:06,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:06,305 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:34:06,307 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:34:06,646 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:34:06,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:34:06,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:34:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:06,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:07,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {4678#true} call ULTIMATE.init(); {4678#true} is VALID [2022-04-27 14:34:07,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {4678#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4678#true} is VALID [2022-04-27 14:34:07,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {4678#true} assume true; {4678#true} is VALID [2022-04-27 14:34:07,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4678#true} {4678#true} #57#return; {4678#true} is VALID [2022-04-27 14:34:07,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {4678#true} call #t~ret6 := main(); {4678#true} is VALID [2022-04-27 14:34:07,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {4678#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4698#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:07,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {4698#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4698#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:07,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {4698#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4698#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:07,074 INFO L272 TraceCheckUtils]: 8: Hoare triple {4698#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4678#true} is VALID [2022-04-27 14:34:07,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {4678#true} ~cond := #in~cond; {4678#true} is VALID [2022-04-27 14:34:07,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {4678#true} assume !(0 == ~cond); {4678#true} is VALID [2022-04-27 14:34:07,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {4678#true} assume true; {4678#true} is VALID [2022-04-27 14:34:07,075 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4678#true} {4698#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {4698#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:07,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {4698#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4723#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:34:07,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {4723#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4723#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:34:07,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {4723#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {4723#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:34:07,076 INFO L272 TraceCheckUtils]: 16: Hoare triple {4723#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4678#true} is VALID [2022-04-27 14:34:07,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {4678#true} ~cond := #in~cond; {4678#true} is VALID [2022-04-27 14:34:07,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {4678#true} assume !(0 == ~cond); {4678#true} is VALID [2022-04-27 14:34:07,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {4678#true} assume true; {4678#true} is VALID [2022-04-27 14:34:07,077 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4678#true} {4723#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {4723#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:34:07,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {4723#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4748#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:34:07,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {4748#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4748#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:34:07,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {4748#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {4748#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:34:07,078 INFO L272 TraceCheckUtils]: 24: Hoare triple {4748#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4678#true} is VALID [2022-04-27 14:34:07,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {4678#true} ~cond := #in~cond; {4678#true} is VALID [2022-04-27 14:34:07,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {4678#true} assume !(0 == ~cond); {4678#true} is VALID [2022-04-27 14:34:07,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {4678#true} assume true; {4678#true} is VALID [2022-04-27 14:34:07,078 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4678#true} {4748#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #51#return; {4748#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:34:07,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {4748#(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 + ~x~0; {4773#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:34:07,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {4773#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4773#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:34:07,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {4773#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {4773#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:34:07,080 INFO L272 TraceCheckUtils]: 32: Hoare triple {4773#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4678#true} is VALID [2022-04-27 14:34:07,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {4678#true} ~cond := #in~cond; {4678#true} is VALID [2022-04-27 14:34:07,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {4678#true} assume !(0 == ~cond); {4678#true} is VALID [2022-04-27 14:34:07,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {4678#true} assume true; {4678#true} is VALID [2022-04-27 14:34:07,080 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4678#true} {4773#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #51#return; {4773#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:34:07,081 INFO L290 TraceCheckUtils]: 37: Hoare triple {4773#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4798#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:34:07,081 INFO L290 TraceCheckUtils]: 38: Hoare triple {4798#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4798#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:34:07,081 INFO L290 TraceCheckUtils]: 39: Hoare triple {4798#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {4798#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:34:07,081 INFO L272 TraceCheckUtils]: 40: Hoare triple {4798#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4678#true} is VALID [2022-04-27 14:34:07,081 INFO L290 TraceCheckUtils]: 41: Hoare triple {4678#true} ~cond := #in~cond; {4678#true} is VALID [2022-04-27 14:34:07,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {4678#true} assume !(0 == ~cond); {4678#true} is VALID [2022-04-27 14:34:07,081 INFO L290 TraceCheckUtils]: 43: Hoare triple {4678#true} assume true; {4678#true} is VALID [2022-04-27 14:34:07,082 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4678#true} {4798#(and (= main_~y~0 4) (= main_~c~0 4))} #51#return; {4798#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:34:07,082 INFO L290 TraceCheckUtils]: 45: Hoare triple {4798#(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 + ~x~0; {4823#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:34:07,083 INFO L290 TraceCheckUtils]: 46: Hoare triple {4823#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4823#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:34:07,083 INFO L290 TraceCheckUtils]: 47: Hoare triple {4823#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {4823#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:34:07,083 INFO L272 TraceCheckUtils]: 48: Hoare triple {4823#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4678#true} is VALID [2022-04-27 14:34:07,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {4678#true} ~cond := #in~cond; {4678#true} is VALID [2022-04-27 14:34:07,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {4678#true} assume !(0 == ~cond); {4678#true} is VALID [2022-04-27 14:34:07,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {4678#true} assume true; {4678#true} is VALID [2022-04-27 14:34:07,084 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4678#true} {4823#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {4823#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:34:07,084 INFO L290 TraceCheckUtils]: 53: Hoare triple {4823#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4848#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:34:07,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {4848#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4848#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:34:07,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {4848#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {4848#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:34:07,085 INFO L272 TraceCheckUtils]: 56: Hoare triple {4848#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4678#true} is VALID [2022-04-27 14:34:07,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {4678#true} ~cond := #in~cond; {4678#true} is VALID [2022-04-27 14:34:07,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {4678#true} assume !(0 == ~cond); {4678#true} is VALID [2022-04-27 14:34:07,085 INFO L290 TraceCheckUtils]: 59: Hoare triple {4678#true} assume true; {4678#true} is VALID [2022-04-27 14:34:07,086 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4678#true} {4848#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #51#return; {4848#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:34:07,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {4848#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {4873#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:34:07,087 INFO L272 TraceCheckUtils]: 62: Hoare triple {4873#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4877#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:07,087 INFO L290 TraceCheckUtils]: 63: Hoare triple {4877#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4881#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:07,088 INFO L290 TraceCheckUtils]: 64: Hoare triple {4881#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4679#false} is VALID [2022-04-27 14:34:07,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {4679#false} assume !false; {4679#false} is VALID [2022-04-27 14:34:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 14:34:07,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:07,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:07,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808462157] [2022-04-27 14:34:07,352 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:07,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609081121] [2022-04-27 14:34:07,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609081121] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:07,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:07,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:34:07,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917385346] [2022-04-27 14:34:07,352 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:07,353 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-27 14:34:07,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:07,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:07,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:07,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:34:07,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:07,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:34:07,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:34:07,387 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:07,990 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2022-04-27 14:34:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:34:07,991 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-27 14:34:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 14:34:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-27 14:34:07,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-27 14:34:08,054 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:34:08,055 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:34:08,055 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:34:08,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 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:34:08,056 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:08,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:34:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:34:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:34:08,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:08,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:08,108 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:08,108 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:08,114 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-27 14:34:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 14:34:08,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:08,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:08,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:08,115 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:08,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:08,118 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-27 14:34:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 14:34:08,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:08,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:08,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:08,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-04-27 14:34:08,121 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 66 [2022-04-27 14:34:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:08,121 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-04-27 14:34:08,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:34:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 14:34:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-27 14:34:08,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:08,122 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:08,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-27 14:34:08,327 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:34:08,328 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 7 times [2022-04-27 14:34:08,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:08,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930866317] [2022-04-27 14:34:08,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:08,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:08,356 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:08,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324038416] [2022-04-27 14:34:08,356 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:34:08,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:08,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:08,359 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:34:08,385 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:34:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:08,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 14:34:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:08,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:09,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {5389#true} call ULTIMATE.init(); {5389#true} is VALID [2022-04-27 14:34:09,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {5389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5389#true} is VALID [2022-04-27 14:34:09,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {5389#true} assume true; {5389#true} is VALID [2022-04-27 14:34:09,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5389#true} {5389#true} #57#return; {5389#true} is VALID [2022-04-27 14:34:09,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {5389#true} call #t~ret6 := main(); {5389#true} is VALID [2022-04-27 14:34:09,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {5389#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5409#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:09,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {5409#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5409#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:09,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {5409#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {5409#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:09,431 INFO L272 TraceCheckUtils]: 8: Hoare triple {5409#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5389#true} is VALID [2022-04-27 14:34:09,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {5389#true} ~cond := #in~cond; {5389#true} is VALID [2022-04-27 14:34:09,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {5389#true} assume !(0 == ~cond); {5389#true} is VALID [2022-04-27 14:34:09,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {5389#true} assume true; {5389#true} is VALID [2022-04-27 14:34:09,431 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5389#true} {5409#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {5409#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:09,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {5409#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5434#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:34:09,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {5434#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5434#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:34:09,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {5434#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {5434#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:34:09,433 INFO L272 TraceCheckUtils]: 16: Hoare triple {5434#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5389#true} is VALID [2022-04-27 14:34:09,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {5389#true} ~cond := #in~cond; {5389#true} is VALID [2022-04-27 14:34:09,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {5389#true} assume !(0 == ~cond); {5389#true} is VALID [2022-04-27 14:34:09,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {5389#true} assume true; {5389#true} is VALID [2022-04-27 14:34:09,433 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5389#true} {5434#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #51#return; {5434#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:34:09,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {5434#(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 + ~x~0; {5459#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:09,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {5459#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5459#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:09,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {5459#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {5459#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:09,436 INFO L272 TraceCheckUtils]: 24: Hoare triple {5459#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5389#true} is VALID [2022-04-27 14:34:09,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {5389#true} ~cond := #in~cond; {5389#true} is VALID [2022-04-27 14:34:09,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {5389#true} assume !(0 == ~cond); {5389#true} is VALID [2022-04-27 14:34:09,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {5389#true} assume true; {5389#true} is VALID [2022-04-27 14:34:09,437 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5389#true} {5459#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #51#return; {5459#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:34:09,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {5459#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5484#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:34:09,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {5484#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5484#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:34:09,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {5484#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {5484#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:34:09,438 INFO L272 TraceCheckUtils]: 32: Hoare triple {5484#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5389#true} is VALID [2022-04-27 14:34:09,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {5389#true} ~cond := #in~cond; {5389#true} is VALID [2022-04-27 14:34:09,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {5389#true} assume !(0 == ~cond); {5389#true} is VALID [2022-04-27 14:34:09,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {5389#true} assume true; {5389#true} is VALID [2022-04-27 14:34:09,439 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5389#true} {5484#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #51#return; {5484#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:34:09,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {5484#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5509#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:09,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {5509#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5509#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:09,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {5509#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {5509#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:09,440 INFO L272 TraceCheckUtils]: 40: Hoare triple {5509#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5389#true} is VALID [2022-04-27 14:34:09,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {5389#true} ~cond := #in~cond; {5389#true} is VALID [2022-04-27 14:34:09,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {5389#true} assume !(0 == ~cond); {5389#true} is VALID [2022-04-27 14:34:09,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {5389#true} assume true; {5389#true} is VALID [2022-04-27 14:34:09,441 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5389#true} {5509#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} #51#return; {5509#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:09,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {5509#(and (= (+ (- 1) main_~c~0) 3) (= 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 + ~x~0; {5534#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:09,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {5534#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5534#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:09,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {5534#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {5534#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:09,442 INFO L272 TraceCheckUtils]: 48: Hoare triple {5534#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5389#true} is VALID [2022-04-27 14:34:09,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {5389#true} ~cond := #in~cond; {5389#true} is VALID [2022-04-27 14:34:09,442 INFO L290 TraceCheckUtils]: 50: Hoare triple {5389#true} assume !(0 == ~cond); {5389#true} is VALID [2022-04-27 14:34:09,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {5389#true} assume true; {5389#true} is VALID [2022-04-27 14:34:09,443 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5389#true} {5534#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} #51#return; {5534#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:09,443 INFO L290 TraceCheckUtils]: 53: Hoare triple {5534#(and (= 5 main_~c~0) (= (+ (- 1) 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 + ~x~0; {5559#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:09,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {5559#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5559#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:09,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {5559#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {5559#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:09,444 INFO L272 TraceCheckUtils]: 56: Hoare triple {5559#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5389#true} is VALID [2022-04-27 14:34:09,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {5389#true} ~cond := #in~cond; {5389#true} is VALID [2022-04-27 14:34:09,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {5389#true} assume !(0 == ~cond); {5389#true} is VALID [2022-04-27 14:34:09,444 INFO L290 TraceCheckUtils]: 59: Hoare triple {5389#true} assume true; {5389#true} is VALID [2022-04-27 14:34:09,445 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5389#true} {5559#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #51#return; {5559#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:34:09,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {5559#(and (= main_~y~0 6) (= 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 + ~x~0; {5584#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:34:09,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {5584#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5584#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:34:09,446 INFO L290 TraceCheckUtils]: 63: Hoare triple {5584#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {5584#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:34:09,446 INFO L272 TraceCheckUtils]: 64: Hoare triple {5584#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5389#true} is VALID [2022-04-27 14:34:09,446 INFO L290 TraceCheckUtils]: 65: Hoare triple {5389#true} ~cond := #in~cond; {5389#true} is VALID [2022-04-27 14:34:09,446 INFO L290 TraceCheckUtils]: 66: Hoare triple {5389#true} assume !(0 == ~cond); {5389#true} is VALID [2022-04-27 14:34:09,446 INFO L290 TraceCheckUtils]: 67: Hoare triple {5389#true} assume true; {5389#true} is VALID [2022-04-27 14:34:09,446 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5389#true} {5584#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #51#return; {5584#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:34:09,447 INFO L290 TraceCheckUtils]: 69: Hoare triple {5584#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {5609#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:34:09,448 INFO L272 TraceCheckUtils]: 70: Hoare triple {5609#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5613#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:09,455 INFO L290 TraceCheckUtils]: 71: Hoare triple {5613#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5617#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:09,456 INFO L290 TraceCheckUtils]: 72: Hoare triple {5617#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5390#false} is VALID [2022-04-27 14:34:09,456 INFO L290 TraceCheckUtils]: 73: Hoare triple {5390#false} assume !false; {5390#false} is VALID [2022-04-27 14:34:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 14:34:09,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:10,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:10,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930866317] [2022-04-27 14:34:10,542 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:10,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324038416] [2022-04-27 14:34:10,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324038416] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:10,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:10,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:34:10,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937624067] [2022-04-27 14:34:10,543 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:10,543 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-27 14:34:10,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:10,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:34:10,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:10,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:34:10,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:10,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:34:10,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:34:10,584 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:34:11,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:11,311 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-04-27 14:34:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:34:11,311 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-27 14:34:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:34:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 14:34:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:34:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 14:34:11,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-27 14:34:11,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:11,365 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:34:11,365 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:34:11,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:34:11,366 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:11,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:34:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:34:11,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:34:11,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:11,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:11,435 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:11,436 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:11,437 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-27 14:34:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 14:34:11,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:11,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:11,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:11,438 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:11,440 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-27 14:34:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 14:34:11,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:11,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:11,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:11,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2022-04-27 14:34:11,442 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 74 [2022-04-27 14:34:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:11,442 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2022-04-27 14:34:11,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:34:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 14:34:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 14:34:11,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:11,443 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:11,449 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:34:11,649 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:34:11,649 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:11,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:11,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 8 times [2022-04-27 14:34:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:11,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243952514] [2022-04-27 14:34:11,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:11,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:11,666 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:11,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732482478] [2022-04-27 14:34:11,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:34:11,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:11,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:11,669 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:34:11,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 14:34:12,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:34:12,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:34:12,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:34:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:12,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:12,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {6275#true} call ULTIMATE.init(); {6275#true} is VALID [2022-04-27 14:34:12,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {6275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6275#true} is VALID [2022-04-27 14:34:12,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {6275#true} assume true; {6275#true} is VALID [2022-04-27 14:34:12,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6275#true} {6275#true} #57#return; {6275#true} is VALID [2022-04-27 14:34:12,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {6275#true} call #t~ret6 := main(); {6275#true} is VALID [2022-04-27 14:34:12,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {6275#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6295#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:12,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {6295#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6295#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:12,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {6295#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6295#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:12,658 INFO L272 TraceCheckUtils]: 8: Hoare triple {6295#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6275#true} is VALID [2022-04-27 14:34:12,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {6275#true} ~cond := #in~cond; {6275#true} is VALID [2022-04-27 14:34:12,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {6275#true} assume !(0 == ~cond); {6275#true} is VALID [2022-04-27 14:34:12,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {6275#true} assume true; {6275#true} is VALID [2022-04-27 14:34:12,658 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6275#true} {6295#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {6295#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:12,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {6295#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:34:12,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {6320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:34:12,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {6320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:34:12,660 INFO L272 TraceCheckUtils]: 16: Hoare triple {6320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6275#true} is VALID [2022-04-27 14:34:12,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {6275#true} ~cond := #in~cond; {6275#true} is VALID [2022-04-27 14:34:12,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {6275#true} assume !(0 == ~cond); {6275#true} is VALID [2022-04-27 14:34:12,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {6275#true} assume true; {6275#true} is VALID [2022-04-27 14:34:12,660 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6275#true} {6320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {6320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:34:12,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {6320#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6345#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:34:12,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {6345#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6345#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:34:12,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {6345#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {6345#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:34:12,662 INFO L272 TraceCheckUtils]: 24: Hoare triple {6345#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6275#true} is VALID [2022-04-27 14:34:12,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {6275#true} ~cond := #in~cond; {6275#true} is VALID [2022-04-27 14:34:12,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {6275#true} assume !(0 == ~cond); {6275#true} is VALID [2022-04-27 14:34:12,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {6275#true} assume true; {6275#true} is VALID [2022-04-27 14:34:12,662 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6275#true} {6345#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {6345#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:34:12,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {6345#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6370#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:34:12,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {6370#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6370#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:34:12,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {6370#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {6370#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:34:12,663 INFO L272 TraceCheckUtils]: 32: Hoare triple {6370#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6275#true} is VALID [2022-04-27 14:34:12,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {6275#true} ~cond := #in~cond; {6275#true} is VALID [2022-04-27 14:34:12,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {6275#true} assume !(0 == ~cond); {6275#true} is VALID [2022-04-27 14:34:12,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {6275#true} assume true; {6275#true} is VALID [2022-04-27 14:34:12,664 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6275#true} {6370#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {6370#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:34:12,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {6370#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6395#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:34:12,665 INFO L290 TraceCheckUtils]: 38: Hoare triple {6395#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6395#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:34:12,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {6395#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {6395#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:34:12,665 INFO L272 TraceCheckUtils]: 40: Hoare triple {6395#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6275#true} is VALID [2022-04-27 14:34:12,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {6275#true} ~cond := #in~cond; {6275#true} is VALID [2022-04-27 14:34:12,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {6275#true} assume !(0 == ~cond); {6275#true} is VALID [2022-04-27 14:34:12,665 INFO L290 TraceCheckUtils]: 43: Hoare triple {6275#true} assume true; {6275#true} is VALID [2022-04-27 14:34:12,666 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6275#true} {6395#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #51#return; {6395#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:34:12,666 INFO L290 TraceCheckUtils]: 45: Hoare triple {6395#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6420#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:34:12,667 INFO L290 TraceCheckUtils]: 46: Hoare triple {6420#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6420#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:34:12,667 INFO L290 TraceCheckUtils]: 47: Hoare triple {6420#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {6420#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:34:12,667 INFO L272 TraceCheckUtils]: 48: Hoare triple {6420#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6275#true} is VALID [2022-04-27 14:34:12,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {6275#true} ~cond := #in~cond; {6275#true} is VALID [2022-04-27 14:34:12,667 INFO L290 TraceCheckUtils]: 50: Hoare triple {6275#true} assume !(0 == ~cond); {6275#true} is VALID [2022-04-27 14:34:12,667 INFO L290 TraceCheckUtils]: 51: Hoare triple {6275#true} assume true; {6275#true} is VALID [2022-04-27 14:34:12,668 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6275#true} {6420#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #51#return; {6420#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:34:12,668 INFO L290 TraceCheckUtils]: 53: Hoare triple {6420#(and (= 3 (+ (- 2) 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 + ~x~0; {6445#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:34:12,669 INFO L290 TraceCheckUtils]: 54: Hoare triple {6445#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6445#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:34:12,669 INFO L290 TraceCheckUtils]: 55: Hoare triple {6445#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !!(#t~post5 < 10);havoc #t~post5; {6445#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:34:12,669 INFO L272 TraceCheckUtils]: 56: Hoare triple {6445#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6275#true} is VALID [2022-04-27 14:34:12,669 INFO L290 TraceCheckUtils]: 57: Hoare triple {6275#true} ~cond := #in~cond; {6275#true} is VALID [2022-04-27 14:34:12,669 INFO L290 TraceCheckUtils]: 58: Hoare triple {6275#true} assume !(0 == ~cond); {6275#true} is VALID [2022-04-27 14:34:12,669 INFO L290 TraceCheckUtils]: 59: Hoare triple {6275#true} assume true; {6275#true} is VALID [2022-04-27 14:34:12,670 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6275#true} {6445#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #51#return; {6445#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:34:12,670 INFO L290 TraceCheckUtils]: 61: Hoare triple {6445#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6470#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:34:12,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {6470#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6470#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:34:12,671 INFO L290 TraceCheckUtils]: 63: Hoare triple {6470#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {6470#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:34:12,671 INFO L272 TraceCheckUtils]: 64: Hoare triple {6470#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6275#true} is VALID [2022-04-27 14:34:12,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {6275#true} ~cond := #in~cond; {6275#true} is VALID [2022-04-27 14:34:12,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {6275#true} assume !(0 == ~cond); {6275#true} is VALID [2022-04-27 14:34:12,671 INFO L290 TraceCheckUtils]: 67: Hoare triple {6275#true} assume true; {6275#true} is VALID [2022-04-27 14:34:12,672 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6275#true} {6470#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} #51#return; {6470#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 14:34:12,672 INFO L290 TraceCheckUtils]: 69: Hoare triple {6470#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6495#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:34:12,672 INFO L290 TraceCheckUtils]: 70: Hoare triple {6495#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6495#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:34:12,673 INFO L290 TraceCheckUtils]: 71: Hoare triple {6495#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {6495#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:34:12,673 INFO L272 TraceCheckUtils]: 72: Hoare triple {6495#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6275#true} is VALID [2022-04-27 14:34:12,673 INFO L290 TraceCheckUtils]: 73: Hoare triple {6275#true} ~cond := #in~cond; {6275#true} is VALID [2022-04-27 14:34:12,673 INFO L290 TraceCheckUtils]: 74: Hoare triple {6275#true} assume !(0 == ~cond); {6275#true} is VALID [2022-04-27 14:34:12,673 INFO L290 TraceCheckUtils]: 75: Hoare triple {6275#true} assume true; {6275#true} is VALID [2022-04-27 14:34:12,673 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6275#true} {6495#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #51#return; {6495#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:34:12,674 INFO L290 TraceCheckUtils]: 77: Hoare triple {6495#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:34:12,674 INFO L272 TraceCheckUtils]: 78: Hoare triple {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6524#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:12,675 INFO L290 TraceCheckUtils]: 79: Hoare triple {6524#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6528#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:12,675 INFO L290 TraceCheckUtils]: 80: Hoare triple {6528#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6276#false} is VALID [2022-04-27 14:34:12,675 INFO L290 TraceCheckUtils]: 81: Hoare triple {6276#false} assume !false; {6276#false} is VALID [2022-04-27 14:34:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 14:34:12,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:12,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:12,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243952514] [2022-04-27 14:34:12,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:12,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732482478] [2022-04-27 14:34:12,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732482478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:12,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:12,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:34:12,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495749992] [2022-04-27 14:34:12,919 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:12,919 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-27 14:34:12,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:12,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:34:12,972 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:34:12,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:34:12,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:12,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:34:12,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:34:12,973 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:34:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:13,784 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-04-27 14:34:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:34:13,784 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-27 14:34:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:34:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-27 14:34:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:34:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-27 14:34:13,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-27 14:34:13,841 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:34:13,842 INFO L225 Difference]: With dead ends: 98 [2022-04-27 14:34:13,842 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 14:34:13,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:34:13,843 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:13,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 408 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:34:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 14:34:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 14:34:13,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:13,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:13,895 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:13,895 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:13,897 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-27 14:34:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 14:34:13,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:13,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:13,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:13,897 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 14:34:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:13,899 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-27 14:34:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 14:34:13,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:13,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:13,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:13,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-04-27 14:34:13,901 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 82 [2022-04-27 14:34:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:13,901 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-04-27 14:34:13,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:34:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 14:34:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-27 14:34:13,902 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:13,902 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:13,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 14:34:14,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 14:34:14,109 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash 488857026, now seen corresponding path program 9 times [2022-04-27 14:34:14,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:14,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160798866] [2022-04-27 14:34:14,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:14,122 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:14,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242515562] [2022-04-27 14:34:14,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:34:14,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:14,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:14,123 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:34:14,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 14:34:14,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 14:34:14,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:34:14,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-27 14:34:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:14,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:34:15,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {7036#true} call ULTIMATE.init(); {7036#true} is VALID [2022-04-27 14:34:15,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {7036#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7036#true} is VALID [2022-04-27 14:34:15,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {7036#true} assume true; {7036#true} is VALID [2022-04-27 14:34:15,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7036#true} {7036#true} #57#return; {7036#true} is VALID [2022-04-27 14:34:15,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {7036#true} call #t~ret6 := main(); {7036#true} is VALID [2022-04-27 14:34:15,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {7036#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7056#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:15,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {7056#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7056#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:15,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {7056#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {7056#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:15,046 INFO L272 TraceCheckUtils]: 8: Hoare triple {7056#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7036#true} is VALID [2022-04-27 14:34:15,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {7036#true} ~cond := #in~cond; {7036#true} is VALID [2022-04-27 14:34:15,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {7036#true} assume !(0 == ~cond); {7036#true} is VALID [2022-04-27 14:34:15,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {7036#true} assume true; {7036#true} is VALID [2022-04-27 14:34:15,047 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7036#true} {7056#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {7056#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:34:15,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {7056#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7081#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:34:15,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {7081#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7081#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:34:15,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {7081#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {7081#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:34:15,049 INFO L272 TraceCheckUtils]: 16: Hoare triple {7081#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7036#true} is VALID [2022-04-27 14:34:15,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {7036#true} ~cond := #in~cond; {7036#true} is VALID [2022-04-27 14:34:15,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {7036#true} assume !(0 == ~cond); {7036#true} is VALID [2022-04-27 14:34:15,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {7036#true} assume true; {7036#true} is VALID [2022-04-27 14:34:15,049 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7036#true} {7081#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {7081#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:34:15,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {7081#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7106#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:34:15,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {7106#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7106#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:34:15,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {7106#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {7106#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:34:15,051 INFO L272 TraceCheckUtils]: 24: Hoare triple {7106#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7036#true} is VALID [2022-04-27 14:34:15,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {7036#true} ~cond := #in~cond; {7036#true} is VALID [2022-04-27 14:34:15,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {7036#true} assume !(0 == ~cond); {7036#true} is VALID [2022-04-27 14:34:15,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {7036#true} assume true; {7036#true} is VALID [2022-04-27 14:34:15,051 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7036#true} {7106#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #51#return; {7106#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:34:15,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {7106#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7131#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:34:15,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {7131#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7131#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:34:15,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {7131#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {7131#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:34:15,052 INFO L272 TraceCheckUtils]: 32: Hoare triple {7131#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7036#true} is VALID [2022-04-27 14:34:15,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {7036#true} ~cond := #in~cond; {7036#true} is VALID [2022-04-27 14:34:15,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {7036#true} assume !(0 == ~cond); {7036#true} is VALID [2022-04-27 14:34:15,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {7036#true} assume true; {7036#true} is VALID [2022-04-27 14:34:15,053 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7036#true} {7131#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #51#return; {7131#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:34:15,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {7131#(and (= (+ main_~y~0 (- 3)) 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 + ~x~0; {7156#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 14:34:15,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {7156#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7156#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 14:34:15,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {7156#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {7156#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 14:34:15,054 INFO L272 TraceCheckUtils]: 40: Hoare triple {7156#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7036#true} is VALID [2022-04-27 14:34:15,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {7036#true} ~cond := #in~cond; {7036#true} is VALID [2022-04-27 14:34:15,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {7036#true} assume !(0 == ~cond); {7036#true} is VALID [2022-04-27 14:34:15,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {7036#true} assume true; {7036#true} is VALID [2022-04-27 14:34:15,055 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7036#true} {7156#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} #51#return; {7156#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 14:34:15,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {7156#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7181#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:34:15,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {7181#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7181#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:34:15,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {7181#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {7181#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:34:15,056 INFO L272 TraceCheckUtils]: 48: Hoare triple {7181#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7036#true} is VALID [2022-04-27 14:34:15,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {7036#true} ~cond := #in~cond; {7036#true} is VALID [2022-04-27 14:34:15,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {7036#true} assume !(0 == ~cond); {7036#true} is VALID [2022-04-27 14:34:15,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {7036#true} assume true; {7036#true} is VALID [2022-04-27 14:34:15,056 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7036#true} {7181#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {7181#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:34:15,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {7181#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7206#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:34:15,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {7206#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7206#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:34:15,058 INFO L290 TraceCheckUtils]: 55: Hoare triple {7206#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {7206#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:34:15,058 INFO L272 TraceCheckUtils]: 56: Hoare triple {7206#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7036#true} is VALID [2022-04-27 14:34:15,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {7036#true} ~cond := #in~cond; {7036#true} is VALID [2022-04-27 14:34:15,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {7036#true} assume !(0 == ~cond); {7036#true} is VALID [2022-04-27 14:34:15,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {7036#true} assume true; {7036#true} is VALID [2022-04-27 14:34:15,058 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7036#true} {7206#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #51#return; {7206#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:34:15,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {7206#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7231#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:34:15,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {7231#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7231#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:34:15,059 INFO L290 TraceCheckUtils]: 63: Hoare triple {7231#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 10);havoc #t~post5; {7231#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:34:15,060 INFO L272 TraceCheckUtils]: 64: Hoare triple {7231#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7036#true} is VALID [2022-04-27 14:34:15,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {7036#true} ~cond := #in~cond; {7036#true} is VALID [2022-04-27 14:34:15,060 INFO L290 TraceCheckUtils]: 66: Hoare triple {7036#true} assume !(0 == ~cond); {7036#true} is VALID [2022-04-27 14:34:15,060 INFO L290 TraceCheckUtils]: 67: Hoare triple {7036#true} assume true; {7036#true} is VALID [2022-04-27 14:34:15,060 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7036#true} {7231#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #51#return; {7231#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:34:15,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {7231#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7256#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:34:15,061 INFO L290 TraceCheckUtils]: 70: Hoare triple {7256#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7256#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:34:15,061 INFO L290 TraceCheckUtils]: 71: Hoare triple {7256#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {7256#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:34:15,061 INFO L272 TraceCheckUtils]: 72: Hoare triple {7256#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7036#true} is VALID [2022-04-27 14:34:15,061 INFO L290 TraceCheckUtils]: 73: Hoare triple {7036#true} ~cond := #in~cond; {7036#true} is VALID [2022-04-27 14:34:15,061 INFO L290 TraceCheckUtils]: 74: Hoare triple {7036#true} assume !(0 == ~cond); {7036#true} is VALID [2022-04-27 14:34:15,061 INFO L290 TraceCheckUtils]: 75: Hoare triple {7036#true} assume true; {7036#true} is VALID [2022-04-27 14:34:15,062 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7036#true} {7256#(and (= main_~y~0 8) (= main_~c~0 8))} #51#return; {7256#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:34:15,062 INFO L290 TraceCheckUtils]: 77: Hoare triple {7256#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7281#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:34:15,062 INFO L290 TraceCheckUtils]: 78: Hoare triple {7281#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7281#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:34:15,063 INFO L290 TraceCheckUtils]: 79: Hoare triple {7281#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 10);havoc #t~post5; {7281#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:34:15,063 INFO L272 TraceCheckUtils]: 80: Hoare triple {7281#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7036#true} is VALID [2022-04-27 14:34:15,063 INFO L290 TraceCheckUtils]: 81: Hoare triple {7036#true} ~cond := #in~cond; {7036#true} is VALID [2022-04-27 14:34:15,063 INFO L290 TraceCheckUtils]: 82: Hoare triple {7036#true} assume !(0 == ~cond); {7036#true} is VALID [2022-04-27 14:34:15,063 INFO L290 TraceCheckUtils]: 83: Hoare triple {7036#true} assume true; {7036#true} is VALID [2022-04-27 14:34:15,063 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7036#true} {7281#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #51#return; {7281#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:34:15,064 INFO L290 TraceCheckUtils]: 85: Hoare triple {7281#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {7306#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:34:15,064 INFO L272 TraceCheckUtils]: 86: Hoare triple {7306#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7310#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:15,065 INFO L290 TraceCheckUtils]: 87: Hoare triple {7310#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7314#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:15,065 INFO L290 TraceCheckUtils]: 88: Hoare triple {7314#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7037#false} is VALID [2022-04-27 14:34:15,065 INFO L290 TraceCheckUtils]: 89: Hoare triple {7037#false} assume !false; {7037#false} is VALID [2022-04-27 14:34:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 20 proven. 180 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 14:34:15,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:15,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160798866] [2022-04-27 14:34:15,303 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:15,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242515562] [2022-04-27 14:34:15,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242515562] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:34:15,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:34:15,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 14:34:15,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324376100] [2022-04-27 14:34:15,304 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:15,304 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 90 [2022-04-27 14:34:15,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:15,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:15,348 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:34:15,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 14:34:15,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:15,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 14:34:15,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:34:15,349 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:16,327 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-27 14:34:16,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 14:34:16,327 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 90 [2022-04-27 14:34:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-27 14:34:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-27 14:34:16,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2022-04-27 14:34:16,385 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:34:16,386 INFO L225 Difference]: With dead ends: 100 [2022-04-27 14:34:16,387 INFO L226 Difference]: Without dead ends: 95 [2022-04-27 14:34:16,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:34:16,387 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:16,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 468 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:34:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-27 14:34:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-27 14:34:16,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:16,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:34:16,440 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:34:16,440 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:34:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:16,441 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-27 14:34:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 14:34:16,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:16,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:16,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-27 14:34:16,442 INFO L87 Difference]: Start difference. First operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-27 14:34:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:16,444 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-27 14:34:16,444 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 14:34:16,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:16,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:16,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:16,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:34:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-04-27 14:34:16,446 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 90 [2022-04-27 14:34:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:16,446 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-04-27 14:34:16,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:34:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 14:34:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 14:34:16,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:16,448 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:16,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 14:34:16,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:16,653 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:16,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:16,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1958171289, now seen corresponding path program 3 times [2022-04-27 14:34:16,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:16,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46730440] [2022-04-27 14:34:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:16,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:16,665 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:16,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995195153] [2022-04-27 14:34:16,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:34:16,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:16,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:16,666 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:34:16,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 14:34:17,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 14:34:17,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 14:34:17,204 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 14:34:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 14:34:17,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 14:34:17,278 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 14:34:17,279 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:34:17,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-27 14:34:17,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 14:34:17,490 INFO L356 BasicCegarLoop]: Path program histogram: [9, 3, 1, 1, 1, 1] [2022-04-27 14:34:17,492 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:34:17,533 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:34:17,533 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 14:34:17,533 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:34:17,533 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:34:17,533 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 14:34:17,533 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 14:34:17,533 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:34:17,534 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:34:17,535 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:34:17,535 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:34:17,535 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:34:17,535 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:34:17,535 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:34:17,535 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:34:17,535 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:34:17,535 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:34:17,535 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:34:17,535 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:34:17,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:34:17 BoogieIcfgContainer [2022-04-27 14:34:17,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:34:17,536 INFO L158 Benchmark]: Toolchain (without parser) took 57965.42ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 136.8MB in the beginning and 141.5MB in the end (delta: -4.7MB). Peak memory consumption was 34.5MB. Max. memory is 8.0GB. [2022-04-27 14:34:17,536 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:34:17,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.38ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 136.7MB in the beginning and 201.0MB in the end (delta: -64.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 14:34:17,537 INFO L158 Benchmark]: Boogie Preprocessor took 24.48ms. Allocated memory is still 225.4MB. Free memory was 201.0MB in the beginning and 199.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:34:17,537 INFO L158 Benchmark]: RCFGBuilder took 238.24ms. Allocated memory is still 225.4MB. Free memory was 199.6MB in the beginning and 188.3MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:34:17,537 INFO L158 Benchmark]: TraceAbstraction took 57449.46ms. Allocated memory is still 225.4MB. Free memory was 188.1MB in the beginning and 141.5MB in the end (delta: 46.6MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2022-04-27 14:34:17,538 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.38ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 136.7MB in the beginning and 201.0MB in the end (delta: -64.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.48ms. Allocated memory is still 225.4MB. Free memory was 201.0MB in the beginning and 199.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 238.24ms. Allocated memory is still 225.4MB. Free memory was 199.6MB in the beginning and 188.3MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 57449.46ms. Allocated memory is still 225.4MB. Free memory was 188.1MB in the beginning and 141.5MB in the end (delta: 46.6MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; VAL [\old(counter)=13, counter=0] [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L23] y = 0 [L24] x = 0 [L25] c = 0 VAL [\old(counter)=0, c=0, counter=0, k=11, x=0, y=0] [L27] EXPR counter++ VAL [\old(counter)=0, c=0, counter=1, counter++=0, k=11, x=0, y=0] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=0, counter=1, k=11, x=0, y=0] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=1, counter=1, k=11, x=1, y=1] [L27] EXPR counter++ VAL [\old(counter)=0, c=1, counter=2, counter++=1, k=11, x=1, y=1] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=1, counter=2, k=11, x=1, y=1] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=2, counter=2, k=11, x=9, y=2] [L27] EXPR counter++ VAL [\old(counter)=0, c=2, counter=3, counter++=2, k=11, x=9, y=2] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=2, counter=3, k=11, x=9, y=2] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=3, counter=3, k=11, x=36, y=3] [L27] EXPR counter++ VAL [\old(counter)=0, c=3, counter=4, counter++=3, k=11, x=36, y=3] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=3, counter=4, k=11, x=36, y=3] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=4, counter=4, k=11, x=100, y=4] [L27] EXPR counter++ VAL [\old(counter)=0, c=4, counter=5, counter++=4, k=11, x=100, y=4] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=4, counter=5, k=11, x=100, y=4] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=5, counter=5, k=11, x=225, y=5] [L27] EXPR counter++ VAL [\old(counter)=0, c=5, counter=6, counter++=5, k=11, x=225, y=5] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=5, counter=6, k=11, x=225, y=5] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=6, counter=6, k=11, x=441, y=6] [L27] EXPR counter++ VAL [\old(counter)=0, c=6, counter=7, counter++=6, k=11, x=441, y=6] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=6, counter=7, k=11, x=441, y=6] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=7, counter=7, k=11, x=784, y=7] [L27] EXPR counter++ VAL [\old(counter)=0, c=7, counter=8, counter++=7, k=11, x=784, y=7] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=7, counter=8, k=11, x=784, y=7] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=8, counter=8, k=11, x=1296, y=8] [L27] EXPR counter++ VAL [\old(counter)=0, c=8, counter=9, counter++=8, k=11, x=1296, y=8] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=8, counter=9, k=11, x=1296, y=8] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=9, counter=9, k=11, x=2025, y=9] [L27] EXPR counter++ VAL [\old(counter)=0, c=9, counter=10, counter++=9, k=11, x=2025, y=9] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=9, counter=10, k=11, x=2025, y=9] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=10, counter=10, k=11, x=3025, y=10] [L27] EXPR counter++ VAL [\old(counter)=0, c=10, counter=11, counter++=10, k=11, x=3025, y=10] [L27] COND FALSE !(counter++<10) [L37] CALL __VERIFIER_assert(k*y - (y*y) == 0) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L10] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L12] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.4s, OverallIterations: 16, TraceHistogramMax: 11, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 2835 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2368 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2034 IncrementalHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 467 mSDtfsCounter, 2034 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 935 GetRequests, 740 SyntacticMatches, 11 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 16.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=15, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 41.7s InterpolantComputationTime, 733 NumberOfCodeBlocks, 733 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 707 ConstructedInterpolants, 0 QuantifiedInterpolants, 3105 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2155 ConjunctsInSsa, 304 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 818/1574 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 14:34:17,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...