/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:41:47,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:41:47,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:41:48,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:41:48,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:41:48,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:41:48,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:41:48,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:41:48,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:41:48,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:41:48,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:41:48,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:41:48,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:41:48,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:41:48,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:41:48,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:41:48,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:41:48,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:41:48,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:41:48,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:41:48,071 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:41:48,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:41:48,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:41:48,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:41:48,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:41:48,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:41:48,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:41:48,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:41:48,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:41:48,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:41:48,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:41:48,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:41:48,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:41:48,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:41:48,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:41:48,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:41:48,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:41:48,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:41:48,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:41:48,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:41:48,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:41:48,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:41:48,088 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:41:48,111 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:41:48,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:41:48,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:41:48,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:41:48,112 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:41:48,112 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:41:48,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:41:48,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:41:48,112 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:41:48,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:41:48,113 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:41:48,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:41:48,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:41:48,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:41:48,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:41:48,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:41:48,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:41:48,114 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:41:48,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:41:48,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:41:48,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:41:48,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:41:48,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:41:48,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:41:48,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:41:48,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:41:48,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:41:48,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:41:48,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:41:48,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:41:48,116 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:41:48,116 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:41:48,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:41:48,116 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:41:48,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:41:48,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:41:48,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:41:48,313 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:41:48,314 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:41:48,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound5.c [2022-04-27 14:41:48,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3c0b3f3/e63c81cda5b84e2195b773711c64e812/FLAGe854c5889 [2022-04-27 14:41:48,763 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:41:48,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound5.c [2022-04-27 14:41:48,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3c0b3f3/e63c81cda5b84e2195b773711c64e812/FLAGe854c5889 [2022-04-27 14:41:48,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3c0b3f3/e63c81cda5b84e2195b773711c64e812 [2022-04-27 14:41:48,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:41:48,782 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:41:48,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:41:48,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:41:48,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:41:48,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:41:48" (1/1) ... [2022-04-27 14:41:48,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714c7e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:41:48, skipping insertion in model container [2022-04-27 14:41:48,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:41:48" (1/1) ... [2022-04-27 14:41:48,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:41:48,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:41:48,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound5.c[458,471] [2022-04-27 14:41:48,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:41:48,951 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:41:48,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound5.c[458,471] [2022-04-27 14:41:48,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:41:48,983 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:41:48,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:41:48 WrapperNode [2022-04-27 14:41:48,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:41:48,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:41:48,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:41:48,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:41:48,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:41:48" (1/1) ... [2022-04-27 14:41:48,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:41:48" (1/1) ... [2022-04-27 14:41:48,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:41:48" (1/1) ... [2022-04-27 14:41:48,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:41:48" (1/1) ... [2022-04-27 14:41:49,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:41:48" (1/1) ... [2022-04-27 14:41:49,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:41:48" (1/1) ... [2022-04-27 14:41:49,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:41:48" (1/1) ... [2022-04-27 14:41:49,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:41:49,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:41:49,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:41:49,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:41:49,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:41:48" (1/1) ... [2022-04-27 14:41:49,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:41:49,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:41:49,049 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:41:49,094 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:41:49,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:41:49,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:41:49,105 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:41:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:41:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:41:49,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:41:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:41:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:41:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:41:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:41:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:41:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:41:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:41:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:41:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:41:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:41:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:41:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:41:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:41:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:41:49,166 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:41:49,167 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:41:49,303 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:41:49,307 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:41:49,307 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:41:49,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:41:49 BoogieIcfgContainer [2022-04-27 14:41:49,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:41:49,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:41:49,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:41:49,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:41:49,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:41:48" (1/3) ... [2022-04-27 14:41:49,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cd53d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:41:49, skipping insertion in model container [2022-04-27 14:41:49,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:41:48" (2/3) ... [2022-04-27 14:41:49,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cd53d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:41:49, skipping insertion in model container [2022-04-27 14:41:49,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:41:49" (3/3) ... [2022-04-27 14:41:49,313 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound5.c [2022-04-27 14:41:49,321 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:41:49,321 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:41:49,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:41:49,350 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@1987b4a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b1af2c5 [2022-04-27 14:41:49,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:41:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:41:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:41:49,360 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:41:49,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:41:49,360 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:41:49,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:41:49,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-27 14:41:49,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:41:49,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118224528] [2022-04-27 14:41:49,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:41:49,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:41:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:49,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:41:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:49,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 14:41:49,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:41:49,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-27 14:41:49,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:41:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:49,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:41:49,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:41:49,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:41:49,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:41:49,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 14:41:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:49,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:41:49,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:41:49,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:41:49,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 14:41:49,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:41:49,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 14:41:49,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:41:49,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-27 14:41:49,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-27 14:41:49,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-27 14:41:49,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {32#true} is VALID [2022-04-27 14:41:49,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:41:49,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:41:49,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:41:49,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:41:49,496 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-27 14:41:49,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:41:49,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:41:49,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:41:49,497 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 14:41:49,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-27 14:41:49,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-27 14:41:49,497 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-27 14:41:49,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 14:41:49,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 14:41:49,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 14:41:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:41:49,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:41:49,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118224528] [2022-04-27 14:41:49,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118224528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:41:49,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:41:49,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:41:49,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179116228] [2022-04-27 14:41:49,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:41:49,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:41:49,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:41:49,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:41:49,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:41:49,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:41:49,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:41:49,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:41:49,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:41:49,539 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:41:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:49,612 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 14:41:49,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:41:49,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:41:49,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:41:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:41:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 14:41:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:41:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 14:41:49,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-27 14:41:49,684 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:41:49,690 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:41:49,690 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 14:41:49,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:41:49,694 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:41:49,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:41:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 14:41:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 14:41:49,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:41:49,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:41:49,720 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:41:49,722 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:41:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:49,731 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 14:41:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:41:49,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:49,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:49,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 14:41:49,732 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 14:41:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:49,735 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 14:41:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:41:49,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:49,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:49,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:41:49,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:41:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:41:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 14:41:49,738 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-27 14:41:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:41:49,739 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 14:41:49,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:41:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:41:49,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:41:49,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:41:49,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:41:49,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:41:49,743 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:41:49,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:41:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-27 14:41:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:41:49,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991333116] [2022-04-27 14:41:49,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:41:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:41:49,795 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:41:49,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694946289] [2022-04-27 14:41:49,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:41:49,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:41:49,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:41:49,808 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:41:49,809 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:41:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:49,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:41:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:49,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:41:49,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2022-04-27 14:41:49,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {202#true} is VALID [2022-04-27 14:41:49,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:41:49,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #63#return; {202#true} is VALID [2022-04-27 14:41:49,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret5 := main(); {202#true} is VALID [2022-04-27 14:41:49,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {202#true} is VALID [2022-04-27 14:41:49,984 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {202#true} is VALID [2022-04-27 14:41:49,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-27 14:41:49,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-27 14:41:49,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:41:49,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} #53#return; {202#true} is VALID [2022-04-27 14:41:49,985 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {202#true} is VALID [2022-04-27 14:41:49,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-27 14:41:49,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-27 14:41:49,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:41:49,985 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} #55#return; {202#true} is VALID [2022-04-27 14:41:49,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:49,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:49,987 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:41:49,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:41:49,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {203#false} is VALID [2022-04-27 14:41:49,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-04-27 14:41:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:41:49,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:41:49,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:41:49,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991333116] [2022-04-27 14:41:49,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:41:49,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694946289] [2022-04-27 14:41:49,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694946289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:41:49,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:41:49,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:41:49,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872918368] [2022-04-27 14:41:49,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:41:49,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 14:41:49,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:41:49,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:41:50,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:41:50,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:41:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:41:50,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:41:50,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:41:50,019 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:41:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:53,980 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 14:41:53,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:41:53,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 14:41:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:41:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:41:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 14:41:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:41:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 14:41:53,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 14:41:54,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:41:54,018 INFO L225 Difference]: With dead ends: 35 [2022-04-27 14:41:54,019 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:41:54,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:41:54,020 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:41:54,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:41:54,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:41:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:41:54,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:41:54,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:41:54,025 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:41:54,025 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:41:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:54,027 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 14:41:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:41:54,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:54,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:54,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-27 14:41:54,028 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-27 14:41:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:54,030 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 14:41:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:41:54,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:54,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:54,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:41:54,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:41:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:41:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 14:41:54,032 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-27 14:41:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:41:54,033 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 14:41:54,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:41:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:41:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 14:41:54,034 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:41:54,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:41:54,052 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:41:54,250 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:41:54,250 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:41:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:41:54,251 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-27 14:41:54,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:41:54,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205509601] [2022-04-27 14:41:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:41:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:41:54,262 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:41:54,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580160125] [2022-04-27 14:41:54,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:41:54,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:41:54,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:41:54,264 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:41:54,265 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:41:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:54,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:41:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:54,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:41:54,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-27 14:41:54,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {434#true} is VALID [2022-04-27 14:41:54,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:41:54,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-27 14:41:54,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-27 14:41:54,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {434#true} is VALID [2022-04-27 14:41:54,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {434#true} is VALID [2022-04-27 14:41:54,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:41:54,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:41:54,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:41:54,438 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-27 14:41:54,439 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-27 14:41:54,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:41:54,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:41:54,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:41:54,439 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-27 14:41:54,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:54,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:54,440 INFO L272 TraceCheckUtils]: 18: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {434#true} is VALID [2022-04-27 14:41:54,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:41:54,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:41:54,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:41:54,441 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {487#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:54,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {509#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 14:41:54,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {509#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !false; {509#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 14:41:54,443 INFO L272 TraceCheckUtils]: 25: Hoare triple {509#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:41:54,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:41:54,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-27 14:41:54,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 14:41:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:41:54,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:41:54,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 14:41:54,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-27 14:41:54,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:41:54,582 INFO L272 TraceCheckUtils]: 25: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:41:54,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:41:56,603 WARN L290 TraceCheckUtils]: 23: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-27 14:41:56,605 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #57#return; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:41:56,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:41:56,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:41:56,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:41:56,606 INFO L272 TraceCheckUtils]: 18: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {434#true} is VALID [2022-04-27 14:41:56,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:41:56,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:41:56,607 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-27 14:41:56,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:41:56,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:41:56,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:41:56,607 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-27 14:41:56,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-27 14:41:56,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:41:56,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:41:56,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:41:56,608 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {434#true} is VALID [2022-04-27 14:41:56,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {434#true} is VALID [2022-04-27 14:41:56,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-27 14:41:56,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-27 14:41:56,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:41:56,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {434#true} is VALID [2022-04-27 14:41:56,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-27 14:41:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:41:56,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:41:56,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205509601] [2022-04-27 14:41:56,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:41:56,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580160125] [2022-04-27 14:41:56,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580160125] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:41:56,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:41:56,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:41:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889260057] [2022-04-27 14:41:56,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:41:56,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 14:41:56,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:41:56,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:41:56,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:41:56,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:41:56,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:41:56,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:41:56,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:41:56,790 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:41:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:56,883 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:41:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:41:56,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 14:41:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:41:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:41:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:41:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:41:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:41:56,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:41:57,201 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:41:57,202 INFO L225 Difference]: With dead ends: 37 [2022-04-27 14:41:57,202 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 14:41:57,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:41:57,203 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:41:57,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:41:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 14:41:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 14:41:57,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:41:57,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:41:57,209 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:41:57,210 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:41:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:57,211 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 14:41:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:41:57,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:57,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:57,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 14:41:57,212 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 14:41:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:57,214 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 14:41:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:41:57,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:57,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:57,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:41:57,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:41:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:41:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-27 14:41:57,216 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-27 14:41:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:41:57,216 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-27 14:41:57,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:41:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:41:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 14:41:57,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:41:57,217 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:41:57,221 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:41:57,421 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:41:57,421 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:41:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:41:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-27 14:41:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:41:57,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738025325] [2022-04-27 14:41:57,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:41:57,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:41:57,434 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:41:57,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459840292] [2022-04-27 14:41:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:41:57,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:41:57,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:41:57,446 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:41:57,449 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:41:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:57,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:41:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:57,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:41:57,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2022-04-27 14:41:57,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {784#true} is VALID [2022-04-27 14:41:57,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:41:57,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #63#return; {784#true} is VALID [2022-04-27 14:41:57,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2022-04-27 14:41:57,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {784#true} is VALID [2022-04-27 14:41:57,848 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {784#true} is VALID [2022-04-27 14:41:57,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:41:57,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:41:57,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:41:57,848 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} #53#return; {784#true} is VALID [2022-04-27 14:41:57,848 INFO L272 TraceCheckUtils]: 11: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {784#true} is VALID [2022-04-27 14:41:57,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:41:57,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:41:57,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:41:57,849 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} #55#return; {784#true} is VALID [2022-04-27 14:41:57,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:57,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:57,849 INFO L272 TraceCheckUtils]: 18: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:41:57,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:41:57,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:41:57,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:41:57,850 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {784#true} {837#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:57,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:41:57,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:41:57,851 INFO L272 TraceCheckUtils]: 25: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:41:57,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:41:57,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:41:57,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:41:57,852 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {784#true} {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:41:57,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,853 INFO L272 TraceCheckUtils]: 31: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:41:57,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:41:57,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:41:57,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:41:57,853 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {784#true} {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:41:57,854 INFO L272 TraceCheckUtils]: 36: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:41:57,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:41:57,855 INFO L290 TraceCheckUtils]: 38: Hoare triple {904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {785#false} is VALID [2022-04-27 14:41:57,855 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-27 14:41:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 14:41:57,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:41:58,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:41:58,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738025325] [2022-04-27 14:41:58,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:41:58,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459840292] [2022-04-27 14:41:58,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459840292] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:41:58,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:41:58,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:41:58,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774143231] [2022-04-27 14:41:58,145 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:41:58,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 14:41:58,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:41:58,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:41:58,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:41:58,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:41:58,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:41:58,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:41:58,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:41:58,169 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:41:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:58,386 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 14:41:58,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:41:58,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 14:41:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:41:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:41:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 14:41:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:41:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 14:41:58,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-27 14:41:58,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:41:58,428 INFO L225 Difference]: With dead ends: 42 [2022-04-27 14:41:58,429 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:41:58,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:41:58,432 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:41:58,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:41:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:41:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 14:41:58,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:41:58,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:41:58,446 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:41:58,446 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:41:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:58,448 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 14:41:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:41:58,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:58,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:58,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 14:41:58,449 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 14:41:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:41:58,450 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 14:41:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:41:58,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:41:58,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:41:58,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:41:58,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:41:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:41:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-27 14:41:58,452 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-27 14:41:58,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:41:58,452 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-27 14:41:58,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:41:58,453 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:41:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 14:41:58,453 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:41:58,454 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:41:58,472 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:41:58,667 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:41:58,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:41:58,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:41:58,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 2 times [2022-04-27 14:41:58,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:41:58,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108997976] [2022-04-27 14:41:58,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:41:58,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:41:58,680 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:41:58,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825016617] [2022-04-27 14:41:58,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:41:58,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:41:58,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:41:58,682 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:41:58,683 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:41:58,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:41:58,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:41:58,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 14:41:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:41:58,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:41:59,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {1160#true} call ULTIMATE.init(); {1160#true} is VALID [2022-04-27 14:41:59,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {1160#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1160#true} is VALID [2022-04-27 14:41:59,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:41:59,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} #63#return; {1160#true} is VALID [2022-04-27 14:41:59,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {1160#true} call #t~ret5 := main(); {1160#true} is VALID [2022-04-27 14:41:59,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {1160#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1160#true} is VALID [2022-04-27 14:41:59,084 INFO L272 TraceCheckUtils]: 6: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:41:59,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:41:59,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:41:59,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:41:59,084 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1160#true} {1160#true} #53#return; {1160#true} is VALID [2022-04-27 14:41:59,084 INFO L272 TraceCheckUtils]: 11: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:41:59,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:41:59,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:41:59,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:41:59,085 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1160#true} {1160#true} #55#return; {1160#true} is VALID [2022-04-27 14:41:59,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {1160#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:59,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:59,086 INFO L272 TraceCheckUtils]: 18: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:41:59,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:41:59,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:41:59,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:41:59,087 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1160#true} {1213#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:41:59,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:41:59,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:41:59,088 INFO L272 TraceCheckUtils]: 25: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:41:59,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:41:59,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:41:59,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:41:59,092 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1160#true} {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:41:59,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-27 14:41:59,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !false; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-27 14:41:59,093 INFO L272 TraceCheckUtils]: 32: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:41:59,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:41:59,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:41:59,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:41:59,095 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1160#true} {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #57#return; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-27 14:41:59,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-27 14:41:59,096 INFO L272 TraceCheckUtils]: 38: Hoare triple {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:41:59,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:41:59,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:41:59,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:41:59,096 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1160#true} {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #59#return; {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-27 14:41:59,097 INFO L272 TraceCheckUtils]: 43: Hoare triple {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:41:59,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:41:59,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1161#false} is VALID [2022-04-27 14:41:59,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {1161#false} assume !false; {1161#false} is VALID [2022-04-27 14:41:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 14:41:59,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:41:59,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:41:59,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108997976] [2022-04-27 14:41:59,676 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:41:59,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825016617] [2022-04-27 14:41:59,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825016617] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:41:59,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:41:59,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:41:59,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90044031] [2022-04-27 14:41:59,677 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:41:59,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 14:41:59,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:41:59,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:41:59,708 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:41:59,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:41:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:41:59,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:41:59,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:41:59,709 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:42:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:00,024 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-27 14:42:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:42:00,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 14:42:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:42:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 14:42:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:42:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 14:42:00,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-27 14:42:00,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:00,059 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:42:00,059 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 14:42:00,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:42:00,060 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:00,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:42:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 14:42:00,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 14:42:00,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:00,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:42:00,078 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:42:00,079 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:42:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:00,080 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 14:42:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:42:00,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:00,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:00,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-27 14:42:00,081 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-27 14:42:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:00,090 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 14:42:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:42:00,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:00,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:00,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:00,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:42:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-27 14:42:00,093 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-27 14:42:00,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:00,093 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-27 14:42:00,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:42:00,093 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:42:00,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 14:42:00,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:00,094 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:00,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:42:00,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:00,305 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:00,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 3 times [2022-04-27 14:42:00,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:00,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950688493] [2022-04-27 14:42:00,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:00,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:00,318 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:00,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884831077] [2022-04-27 14:42:00,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:42:00,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:00,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:00,326 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:42:00,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 14:42:00,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:42:00,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:00,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:42:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:00,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:00,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {1596#true} call ULTIMATE.init(); {1596#true} is VALID [2022-04-27 14:42:00,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {1596#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1596#true} is VALID [2022-04-27 14:42:00,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:00,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1596#true} {1596#true} #63#return; {1596#true} is VALID [2022-04-27 14:42:00,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {1596#true} call #t~ret5 := main(); {1596#true} is VALID [2022-04-27 14:42:00,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {1596#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1596#true} is VALID [2022-04-27 14:42:00,870 INFO L272 TraceCheckUtils]: 6: Hoare triple {1596#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:00,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:00,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:00,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:00,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1596#true} {1596#true} #53#return; {1596#true} is VALID [2022-04-27 14:42:00,870 INFO L272 TraceCheckUtils]: 11: Hoare triple {1596#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:00,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:00,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:00,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:00,871 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1596#true} {1596#true} #55#return; {1596#true} is VALID [2022-04-27 14:42:00,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {1596#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1649#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:00,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {1649#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1649#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:00,871 INFO L272 TraceCheckUtils]: 18: Hoare triple {1649#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:00,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:00,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:00,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:00,872 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1596#true} {1649#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1649#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:00,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {1649#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:00,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:00,873 INFO L272 TraceCheckUtils]: 25: Hoare triple {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:00,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:00,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:00,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:00,874 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1596#true} {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:00,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:42:00,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:42:00,875 INFO L272 TraceCheckUtils]: 32: Hoare triple {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:00,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:00,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:00,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:00,875 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1596#true} {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:42:00,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:42:00,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:42:00,877 INFO L272 TraceCheckUtils]: 39: Hoare triple {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:00,877 INFO L290 TraceCheckUtils]: 40: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:00,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:00,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:00,883 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1596#true} {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #57#return; {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:42:00,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:42:00,884 INFO L272 TraceCheckUtils]: 45: Hoare triple {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-27 14:42:00,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-27 14:42:00,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-27 14:42:00,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-27 14:42:00,888 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1596#true} {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} #59#return; {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:42:00,889 INFO L272 TraceCheckUtils]: 50: Hoare triple {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1756#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:00,889 INFO L290 TraceCheckUtils]: 51: Hoare triple {1756#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1760#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:00,890 INFO L290 TraceCheckUtils]: 52: Hoare triple {1760#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1597#false} is VALID [2022-04-27 14:42:00,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {1597#false} assume !false; {1597#false} is VALID [2022-04-27 14:42:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 14:42:00,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:01,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:01,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950688493] [2022-04-27 14:42:01,164 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:01,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884831077] [2022-04-27 14:42:01,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884831077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:01,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:01,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:42:01,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230629824] [2022-04-27 14:42:01,164 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:01,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 14:42:01,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:01,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:42:01,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:01,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:42:01,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:01,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:42:01,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:42:01,197 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:42:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:01,554 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-27 14:42:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:42:01,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 14:42:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:42:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 14:42:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:42:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 14:42:01,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-27 14:42:01,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:01,601 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:42:01,601 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 14:42:01,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:42:01,602 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:01,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:42:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 14:42:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-27 14:42:01,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:01,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:42:01,613 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:42:01,614 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:42:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:01,615 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 14:42:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:42:01,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:01,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:01,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-27 14:42:01,616 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-27 14:42:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:01,617 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 14:42:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:42:01,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:01,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:01,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:01,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:42:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-27 14:42:01,619 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-27 14:42:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:01,619 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-27 14:42:01,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:42:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:42:01,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 14:42:01,620 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:01,621 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:01,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 14:42:01,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:01,826 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:01,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 4 times [2022-04-27 14:42:01,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:01,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036721198] [2022-04-27 14:42:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:01,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:01,836 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:01,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419947519] [2022-04-27 14:42:01,836 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:42:01,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:01,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:01,837 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:42:01,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 14:42:01,869 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:42:01,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:01,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:42:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:01,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:02,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {2048#true} call ULTIMATE.init(); {2048#true} is VALID [2022-04-27 14:42:02,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2048#true} {2048#true} #63#return; {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {2048#true} call #t~ret5 := main(); {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {2048#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L272 TraceCheckUtils]: 6: Hoare triple {2048#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2048#true} {2048#true} #53#return; {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L272 TraceCheckUtils]: 11: Hoare triple {2048#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:02,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:02,173 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2048#true} {2048#true} #55#return; {2048#true} is VALID [2022-04-27 14:42:02,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {2048#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:02,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {2101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:02,175 INFO L272 TraceCheckUtils]: 18: Hoare triple {2101#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:02,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:02,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:02,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:02,176 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2048#true} {2101#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:02,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {2101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:02,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:02,176 INFO L272 TraceCheckUtils]: 25: Hoare triple {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:02,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:02,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:02,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:02,177 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2048#true} {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:02,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:42:02,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:42:02,178 INFO L272 TraceCheckUtils]: 32: Hoare triple {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:02,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:02,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:02,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:02,179 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2048#true} {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:42:02,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2167#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:02,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {2167#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2167#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:02,179 INFO L272 TraceCheckUtils]: 39: Hoare triple {2167#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:02,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:02,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:02,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:02,180 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2048#true} {2167#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {2167#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:02,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {2167#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:42:02,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:42:02,181 INFO L272 TraceCheckUtils]: 46: Hoare triple {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:02,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:02,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:02,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:02,182 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2048#true} {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:42:02,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:42:02,182 INFO L272 TraceCheckUtils]: 52: Hoare triple {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-27 14:42:02,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-27 14:42:02,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-27 14:42:02,182 INFO L290 TraceCheckUtils]: 55: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-27 14:42:02,183 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2048#true} {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:42:02,184 INFO L272 TraceCheckUtils]: 57: Hoare triple {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:02,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {2230#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:02,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {2234#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2049#false} is VALID [2022-04-27 14:42:02,185 INFO L290 TraceCheckUtils]: 60: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2022-04-27 14:42:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 14:42:02,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:02,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:02,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036721198] [2022-04-27 14:42:02,432 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:02,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419947519] [2022-04-27 14:42:02,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419947519] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:02,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:02,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:42:02,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664507840] [2022-04-27 14:42:02,433 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:02,433 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 14:42:02,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:02,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:42:02,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:02,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:42:02,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:02,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:42:02,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:42:02,466 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:42:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:02,885 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-27 14:42:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:42:02,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 14:42:02,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:42:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 14:42:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:42:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 14:42:02,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-27 14:42:02,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:02,948 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:42:02,948 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:42:02,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:42:02,951 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:02,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:42:02,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:42:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:42:02,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:02,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:42:02,968 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:42:02,968 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:42:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:02,969 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:42:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:42:02,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:02,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:02,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 14:42:02,970 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 14:42:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:02,972 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:42:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:42:02,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:02,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:02,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:02,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:42:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-27 14:42:02,974 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-27 14:42:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:02,974 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-27 14:42:02,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:42:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:42:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 14:42:02,975 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:02,975 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:02,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 14:42:03,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:03,192 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:03,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 5 times [2022-04-27 14:42:03,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:03,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056872300] [2022-04-27 14:42:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:03,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:03,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:03,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [514798953] [2022-04-27 14:42:03,204 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:42:03,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:03,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:03,209 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:42:03,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 14:42:17,806 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:42:17,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:17,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:42:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:17,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:18,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {2538#true} call ULTIMATE.init(); {2538#true} is VALID [2022-04-27 14:42:18,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {2538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2538#true} is VALID [2022-04-27 14:42:18,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:18,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2538#true} {2538#true} #63#return; {2538#true} is VALID [2022-04-27 14:42:18,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {2538#true} call #t~ret5 := main(); {2538#true} is VALID [2022-04-27 14:42:18,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {2538#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2538#true} is VALID [2022-04-27 14:42:18,184 INFO L272 TraceCheckUtils]: 6: Hoare triple {2538#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:18,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:18,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:18,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:18,184 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2538#true} {2538#true} #53#return; {2538#true} is VALID [2022-04-27 14:42:18,184 INFO L272 TraceCheckUtils]: 11: Hoare triple {2538#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:18,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:18,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:18,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:18,185 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2538#true} {2538#true} #55#return; {2538#true} is VALID [2022-04-27 14:42:18,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2591#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:18,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {2591#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2591#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:18,185 INFO L272 TraceCheckUtils]: 18: Hoare triple {2591#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:18,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:18,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:18,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:18,190 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2538#true} {2591#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2591#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:18,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {2591#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:18,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:18,190 INFO L272 TraceCheckUtils]: 25: Hoare triple {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:18,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:18,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:18,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:18,191 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2538#true} {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:18,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:42:18,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:42:18,192 INFO L272 TraceCheckUtils]: 32: Hoare triple {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:18,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:18,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:18,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:18,193 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2538#true} {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:42:18,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:42:18,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:42:18,193 INFO L272 TraceCheckUtils]: 39: Hoare triple {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:18,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:18,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:18,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:18,194 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2538#true} {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:42:18,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:42:18,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:42:18,195 INFO L272 TraceCheckUtils]: 46: Hoare triple {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:18,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:18,195 INFO L290 TraceCheckUtils]: 48: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:18,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:18,195 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2538#true} {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:42:18,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:42:18,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:42:18,196 INFO L272 TraceCheckUtils]: 53: Hoare triple {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:18,196 INFO L290 TraceCheckUtils]: 54: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:18,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:18,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:18,198 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2538#true} {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:42:18,200 INFO L290 TraceCheckUtils]: 58: Hoare triple {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:42:18,201 INFO L272 TraceCheckUtils]: 59: Hoare triple {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-27 14:42:18,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-27 14:42:18,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-27 14:42:18,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-27 14:42:18,201 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2538#true} {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #59#return; {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:42:18,202 INFO L272 TraceCheckUtils]: 64: Hoare triple {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:18,202 INFO L290 TraceCheckUtils]: 65: Hoare triple {2742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:18,203 INFO L290 TraceCheckUtils]: 66: Hoare triple {2746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2539#false} is VALID [2022-04-27 14:42:18,203 INFO L290 TraceCheckUtils]: 67: Hoare triple {2539#false} assume !false; {2539#false} is VALID [2022-04-27 14:42:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-27 14:42:18,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:18,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056872300] [2022-04-27 14:42:18,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514798953] [2022-04-27 14:42:18,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514798953] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:18,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:18,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:42:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723270883] [2022-04-27 14:42:18,435 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:18,436 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 14:42:18,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:18,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:42:18,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:18,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:42:18,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:42:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:42:18,470 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:42:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:18,913 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 14:42:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:42:18,913 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 14:42:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:42:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 14:42:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:42:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 14:42:18,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-27 14:42:18,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:18,964 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:42:18,964 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 14:42:18,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:42:18,964 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:18,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:42:18,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 14:42:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 14:42:18,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:18,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:42:18,988 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:42:18,990 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:42:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:18,992 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 14:42:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:42:18,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:18,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:18,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-27 14:42:18,993 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-27 14:42:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:18,994 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 14:42:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:42:18,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:18,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:18,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:18,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:42:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-27 14:42:18,996 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-27 14:42:18,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:18,996 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-27 14:42:18,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:42:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:42:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 14:42:18,997 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:18,997 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:19,006 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:42:19,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:19,199 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:19,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 6 times [2022-04-27 14:42:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:19,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737544547] [2022-04-27 14:42:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:19,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:19,224 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:19,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [306857260] [2022-04-27 14:42:19,224 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:42:19,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:19,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:19,227 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:42:19,240 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:42:20,927 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:42:20,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:20,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:42:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:20,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:21,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {3066#true} call ULTIMATE.init(); {3066#true} is VALID [2022-04-27 14:42:21,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {3066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3066#true} is VALID [2022-04-27 14:42:21,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3066#true} {3066#true} #63#return; {3066#true} is VALID [2022-04-27 14:42:21,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {3066#true} call #t~ret5 := main(); {3066#true} is VALID [2022-04-27 14:42:21,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {3066#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3066#true} is VALID [2022-04-27 14:42:21,449 INFO L272 TraceCheckUtils]: 6: Hoare triple {3066#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {3066#true} ~cond := #in~cond; {3092#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:42:21,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {3092#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3096#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:42:21,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {3096#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3096#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:42:21,450 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3096#(not (= |assume_abort_if_not_#in~cond| 0))} {3066#true} #53#return; {3103#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-27 14:42:21,450 INFO L272 TraceCheckUtils]: 11: Hoare triple {3103#(and (<= main_~k~0 5) (<= 0 main_~k~0))} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,451 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3066#true} {3103#(and (<= main_~k~0 5) (<= 0 main_~k~0))} #55#return; {3103#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-27 14:42:21,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {3103#(and (<= main_~k~0 5) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3122#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 14:42:21,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {3122#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {3122#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 14:42:21,452 INFO L272 TraceCheckUtils]: 18: Hoare triple {3122#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,452 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3066#true} {3122#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} #57#return; {3122#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 14:42:21,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {3122#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3144#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-27 14:42:21,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {3144#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !false; {3144#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-27 14:42:21,453 INFO L272 TraceCheckUtils]: 25: Hoare triple {3144#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,454 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3066#true} {3144#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} #57#return; {3144#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-27 14:42:21,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {3144#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3166#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:42:21,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {3166#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {3166#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:42:21,455 INFO L272 TraceCheckUtils]: 32: Hoare triple {3166#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,456 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3066#true} {3166#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} #57#return; {3166#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:42:21,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {3166#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3188#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 14:42:21,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {3188#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {3188#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 14:42:21,457 INFO L272 TraceCheckUtils]: 39: Hoare triple {3188#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,458 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3066#true} {3188#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} #57#return; {3188#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 14:42:21,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {3188#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3210#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 14:42:21,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {3210#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {3210#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 14:42:21,459 INFO L272 TraceCheckUtils]: 46: Hoare triple {3210#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,459 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3066#true} {3210#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} #57#return; {3210#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 14:42:21,460 INFO L290 TraceCheckUtils]: 51: Hoare triple {3210#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3232#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 14:42:21,460 INFO L290 TraceCheckUtils]: 52: Hoare triple {3232#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {3232#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 14:42:21,461 INFO L272 TraceCheckUtils]: 53: Hoare triple {3232#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,461 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3066#true} {3232#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} #57#return; {3232#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 14:42:21,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {3232#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3067#false} is VALID [2022-04-27 14:42:21,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {3067#false} assume !false; {3067#false} is VALID [2022-04-27 14:42:21,462 INFO L272 TraceCheckUtils]: 60: Hoare triple {3067#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3067#false} is VALID [2022-04-27 14:42:21,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {3067#false} ~cond := #in~cond; {3067#false} is VALID [2022-04-27 14:42:21,462 INFO L290 TraceCheckUtils]: 62: Hoare triple {3067#false} assume !(0 == ~cond); {3067#false} is VALID [2022-04-27 14:42:21,462 INFO L290 TraceCheckUtils]: 63: Hoare triple {3067#false} assume true; {3067#false} is VALID [2022-04-27 14:42:21,462 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3067#false} {3067#false} #57#return; {3067#false} is VALID [2022-04-27 14:42:21,462 INFO L290 TraceCheckUtils]: 65: Hoare triple {3067#false} assume !(~c~0 < ~k~0); {3067#false} is VALID [2022-04-27 14:42:21,462 INFO L272 TraceCheckUtils]: 66: Hoare triple {3067#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3067#false} is VALID [2022-04-27 14:42:21,462 INFO L290 TraceCheckUtils]: 67: Hoare triple {3067#false} ~cond := #in~cond; {3067#false} is VALID [2022-04-27 14:42:21,463 INFO L290 TraceCheckUtils]: 68: Hoare triple {3067#false} assume !(0 == ~cond); {3067#false} is VALID [2022-04-27 14:42:21,463 INFO L290 TraceCheckUtils]: 69: Hoare triple {3067#false} assume true; {3067#false} is VALID [2022-04-27 14:42:21,463 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3067#false} {3067#false} #59#return; {3067#false} is VALID [2022-04-27 14:42:21,463 INFO L272 TraceCheckUtils]: 71: Hoare triple {3067#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3067#false} is VALID [2022-04-27 14:42:21,463 INFO L290 TraceCheckUtils]: 72: Hoare triple {3067#false} ~cond := #in~cond; {3067#false} is VALID [2022-04-27 14:42:21,463 INFO L290 TraceCheckUtils]: 73: Hoare triple {3067#false} assume 0 == ~cond; {3067#false} is VALID [2022-04-27 14:42:21,463 INFO L290 TraceCheckUtils]: 74: Hoare triple {3067#false} assume !false; {3067#false} is VALID [2022-04-27 14:42:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 123 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-27 14:42:21,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:21,840 INFO L290 TraceCheckUtils]: 74: Hoare triple {3067#false} assume !false; {3067#false} is VALID [2022-04-27 14:42:21,840 INFO L290 TraceCheckUtils]: 73: Hoare triple {3067#false} assume 0 == ~cond; {3067#false} is VALID [2022-04-27 14:42:21,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {3067#false} ~cond := #in~cond; {3067#false} is VALID [2022-04-27 14:42:21,840 INFO L272 TraceCheckUtils]: 71: Hoare triple {3067#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3067#false} is VALID [2022-04-27 14:42:21,840 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3066#true} {3067#false} #59#return; {3067#false} is VALID [2022-04-27 14:42:21,840 INFO L290 TraceCheckUtils]: 69: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,841 INFO L272 TraceCheckUtils]: 66: Hoare triple {3067#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {3067#false} assume !(~c~0 < ~k~0); {3067#false} is VALID [2022-04-27 14:42:21,841 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3066#true} {3067#false} #57#return; {3067#false} is VALID [2022-04-27 14:42:21,841 INFO L290 TraceCheckUtils]: 63: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,841 INFO L290 TraceCheckUtils]: 62: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,841 INFO L290 TraceCheckUtils]: 61: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,841 INFO L272 TraceCheckUtils]: 60: Hoare triple {3067#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,841 INFO L290 TraceCheckUtils]: 59: Hoare triple {3067#false} assume !false; {3067#false} is VALID [2022-04-27 14:42:21,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {3350#(not (< main_~c~0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3067#false} is VALID [2022-04-27 14:42:21,842 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3066#true} {3350#(not (< main_~c~0 main_~k~0))} #57#return; {3350#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-27 14:42:21,842 INFO L290 TraceCheckUtils]: 56: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,842 INFO L290 TraceCheckUtils]: 55: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,842 INFO L290 TraceCheckUtils]: 54: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,842 INFO L272 TraceCheckUtils]: 53: Hoare triple {3350#(not (< main_~c~0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,842 INFO L290 TraceCheckUtils]: 52: Hoare triple {3350#(not (< main_~c~0 main_~k~0))} assume !false; {3350#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-27 14:42:21,843 INFO L290 TraceCheckUtils]: 51: Hoare triple {3372#(<= main_~k~0 (+ main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3350#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-27 14:42:21,843 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3066#true} {3372#(<= main_~k~0 (+ main_~c~0 1))} #57#return; {3372#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-27 14:42:21,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,844 INFO L290 TraceCheckUtils]: 48: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,844 INFO L272 TraceCheckUtils]: 46: Hoare triple {3372#(<= main_~k~0 (+ main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,844 INFO L290 TraceCheckUtils]: 45: Hoare triple {3372#(<= main_~k~0 (+ main_~c~0 1))} assume !false; {3372#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-27 14:42:21,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {3394#(<= main_~k~0 (+ main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3372#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-27 14:42:21,845 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3066#true} {3394#(<= main_~k~0 (+ main_~c~0 2))} #57#return; {3394#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-27 14:42:21,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,845 INFO L272 TraceCheckUtils]: 39: Hoare triple {3394#(<= main_~k~0 (+ main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {3394#(<= main_~k~0 (+ main_~c~0 2))} assume !false; {3394#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-27 14:42:21,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {3416#(<= main_~k~0 (+ main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3394#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-27 14:42:21,847 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3066#true} {3416#(<= main_~k~0 (+ main_~c~0 3))} #57#return; {3416#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-27 14:42:21,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,847 INFO L272 TraceCheckUtils]: 32: Hoare triple {3416#(<= main_~k~0 (+ main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {3416#(<= main_~k~0 (+ main_~c~0 3))} assume !false; {3416#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-27 14:42:21,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {3438#(<= main_~k~0 (+ main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3416#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-27 14:42:21,848 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3066#true} {3438#(<= main_~k~0 (+ main_~c~0 4))} #57#return; {3438#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-27 14:42:21,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,848 INFO L272 TraceCheckUtils]: 25: Hoare triple {3438#(<= main_~k~0 (+ main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {3438#(<= main_~k~0 (+ main_~c~0 4))} assume !false; {3438#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-27 14:42:21,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {3460#(<= main_~k~0 (+ 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3438#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-27 14:42:21,850 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3066#true} {3460#(<= main_~k~0 (+ 5 main_~c~0))} #57#return; {3460#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-27 14:42:21,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,850 INFO L272 TraceCheckUtils]: 18: Hoare triple {3460#(<= main_~k~0 (+ 5 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {3460#(<= main_~k~0 (+ 5 main_~c~0))} assume !false; {3460#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-27 14:42:21,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {3482#(<= main_~k~0 5)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3460#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-27 14:42:21,851 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3066#true} {3482#(<= main_~k~0 5)} #55#return; {3482#(<= main_~k~0 5)} is VALID [2022-04-27 14:42:21,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-27 14:42:21,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-27 14:42:21,851 INFO L272 TraceCheckUtils]: 11: Hoare triple {3482#(<= main_~k~0 5)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,852 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3096#(not (= |assume_abort_if_not_#in~cond| 0))} {3066#true} #53#return; {3482#(<= main_~k~0 5)} is VALID [2022-04-27 14:42:21,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {3096#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3096#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:42:21,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {3510#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3096#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:42:21,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {3066#true} ~cond := #in~cond; {3510#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:42:21,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {3066#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {3066#true} is VALID [2022-04-27 14:42:21,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {3066#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3066#true} is VALID [2022-04-27 14:42:21,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {3066#true} call #t~ret5 := main(); {3066#true} is VALID [2022-04-27 14:42:21,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3066#true} {3066#true} #63#return; {3066#true} is VALID [2022-04-27 14:42:21,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-27 14:42:21,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {3066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3066#true} is VALID [2022-04-27 14:42:21,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {3066#true} call ULTIMATE.init(); {3066#true} is VALID [2022-04-27 14:42:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 79 proven. 3 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-04-27 14:42:21,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:21,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737544547] [2022-04-27 14:42:21,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:21,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306857260] [2022-04-27 14:42:21,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306857260] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:42:21,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:42:21,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-27 14:42:21,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600566687] [2022-04-27 14:42:21,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:21,854 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) Word has length 75 [2022-04-27 14:42:21,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:21,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-27 14:42:21,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:21,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 14:42:21,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:21,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 14:42:21,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:42:21,914 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-27 14:42:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:22,170 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-27 14:42:22,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:42:22,170 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) Word has length 75 [2022-04-27 14:42:22,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-27 14:42:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:42:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-27 14:42:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:42:22,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-27 14:42:22,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:22,214 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:42:22,214 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:42:22,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:42:22,215 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:22,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 151 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:42:22,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:42:22,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:42:22,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:22,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:42:22,215 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:42:22,215 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:42:22,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:22,216 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:42:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:42:22,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:22,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:22,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:42:22,216 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:42:22,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:22,216 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:42:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:42:22,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:22,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:22,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:22,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:42:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:42:22,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-04-27 14:42:22,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:22,217 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:42:22,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 16 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-27 14:42:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:42:22,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:22,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:42:22,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 14:42:22,424 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:42:22,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:42:22,953 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 14:42:22,953 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 14:42:22,953 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 14:42:22,953 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-27 14:42:22,953 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 14:42:22,953 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:42:22,953 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:42:22,953 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 42) the Hoare annotation is: true [2022-04-27 14:42:22,953 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10))))) (or (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)))) [2022-04-27 14:42:22,954 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2022-04-27 14:42:22,954 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10))))) (or (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)))) [2022-04-27 14:42:22,954 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse1 (+ (- 1) main_~y~0)) (.cse0 (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (<= main_~c~0 3) (= main_~y~0 3) .cse0 (<= main_~k~0 3) (< 2 main_~k~0)) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (= .cse1 0) (<= main_~k~0 1) .cse0 (< 0 main_~k~0) (<= main_~c~0 1)) (and (= 3 .cse1) (< 3 main_~k~0) .cse0 (<= main_~k~0 4) (<= main_~c~0 4)) (and (<= main_~c~0 5) (<= main_~k~0 5) .cse0 (= 5 main_~y~0) (< 4 main_~k~0)))) [2022-04-27 14:42:22,954 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 17 42) no Hoare annotation was computed. [2022-04-27 14:42:22,954 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-27 14:42:22,954 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-27 14:42:22,954 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= main_~k~0 5) (<= 0 main_~k~0)) [2022-04-27 14:42:22,954 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 17 42) no Hoare annotation was computed. [2022-04-27 14:42:22,954 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-04-27 14:42:22,954 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse1 (+ (- 1) main_~y~0)) (.cse0 (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (<= main_~c~0 3) (= main_~y~0 3) .cse0 (<= main_~k~0 3) (< 2 main_~k~0)) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (= .cse1 0) (<= main_~k~0 1) .cse0 (< 0 main_~k~0) (<= main_~c~0 1)) (and (= 3 .cse1) (< 3 main_~k~0) .cse0 (<= main_~k~0 4) (<= main_~c~0 4)) (and (<= main_~c~0 5) (<= main_~k~0 5) .cse0 (= 5 main_~y~0) (< 4 main_~k~0)))) [2022-04-27 14:42:22,954 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:42:22,954 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:42:22,954 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:42:22,954 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:42:22,954 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:42:22,954 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:42:22,955 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:42:22,955 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-27 14:42:22,955 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-27 14:42:22,955 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-04-27 14:42:22,955 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:42:22,955 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:42:22,955 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-27 14:42:22,958 INFO L356 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-04-27 14:42:22,959 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:42:22,961 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:42:22,961 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 14:42:22,965 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 14:42:22,966 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:42:22,966 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:42:22,966 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:42:22,966 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:42:22,966 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:42:22,966 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 14:42:22,966 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:42:22,966 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:42:22,966 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:42:22,972 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 14:42:22,972 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 14:42:22,972 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 14:42:22,972 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 14:42:22,973 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 14:42:22,973 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:42:22,973 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:42:22,973 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:42:22,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:42:22 BoogieIcfgContainer [2022-04-27 14:42:22,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:42:22,982 INFO L158 Benchmark]: Toolchain (without parser) took 34199.90ms. Allocated memory was 198.2MB in the beginning and 286.3MB in the end (delta: 88.1MB). Free memory was 147.4MB in the beginning and 250.1MB in the end (delta: -102.7MB). Peak memory consumption was 138.6MB. Max. memory is 8.0GB. [2022-04-27 14:42:22,982 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 164.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:42:22,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.53ms. Allocated memory is still 198.2MB. Free memory was 147.2MB in the beginning and 173.8MB in the end (delta: -26.6MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2022-04-27 14:42:22,982 INFO L158 Benchmark]: Boogie Preprocessor took 28.97ms. Allocated memory is still 198.2MB. Free memory was 173.6MB in the beginning and 172.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 14:42:22,983 INFO L158 Benchmark]: RCFGBuilder took 295.07ms. Allocated memory is still 198.2MB. Free memory was 172.1MB in the beginning and 161.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:42:22,983 INFO L158 Benchmark]: TraceAbstraction took 33671.91ms. Allocated memory was 198.2MB in the beginning and 286.3MB in the end (delta: 88.1MB). Free memory was 160.2MB in the beginning and 250.1MB in the end (delta: -90.0MB). Peak memory consumption was 152.0MB. Max. memory is 8.0GB. [2022-04-27 14:42:22,984 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 198.2MB. Free memory is still 164.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.53ms. Allocated memory is still 198.2MB. Free memory was 147.2MB in the beginning and 173.8MB in the end (delta: -26.6MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.97ms. Allocated memory is still 198.2MB. Free memory was 173.6MB in the beginning and 172.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 295.07ms. Allocated memory is still 198.2MB. Free memory was 172.1MB in the beginning and 161.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 33671.91ms. Allocated memory was 198.2MB in the beginning and 286.3MB in the end (delta: 88.1MB). Free memory was 160.2MB in the beginning and 250.1MB in the end (delta: -90.0MB). Peak memory consumption was 152.0MB. 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 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.6s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 1344 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1059 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 779 IncrementalHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 285 mSDtfsCounter, 779 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 612 GetRequests, 515 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=8, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 37 PreInvPairs, 62 NumberOfFragments, 954 HoareAnnotationTreeSize, 37 FomulaSimplifications, 162 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 16.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 418 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 511 ConstructedInterpolants, 0 QuantifiedInterpolants, 1590 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1049 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 696/809 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((((c <= 5 && k <= 5) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10) && 5 == y) && 5 <= c) && 4 < k) || ((((k <= 5 && 0 <= k) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10) && c == 0) && y == 0)) || ((((y == 2 && k <= 5) && 1 < k) && c == 2) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10)) || ((((k <= 5 && y == 1) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10) && 0 < k) && c == 1)) || ((((k <= 5 && y == 4) && c == 4) && 3 < k) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10)) || ((((k <= 5 && y == 3) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10) && 2 < k) && c == 3) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:42:23,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...