/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_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 15:27:07,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 15:27:07,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 15:27:07,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 15:27:07,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 15:27:07,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 15:27:07,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 15:27:07,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 15:27:07,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 15:27:07,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 15:27:07,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 15:27:07,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 15:27:07,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 15:27:07,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 15:27:07,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 15:27:07,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 15:27:07,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 15:27:07,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 15:27:07,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 15:27:07,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 15:27:07,825 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 15:27:07,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 15:27:07,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 15:27:07,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 15:27:07,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 15:27:07,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 15:27:07,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 15:27:07,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 15:27:07,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 15:27:07,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 15:27:07,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 15:27:07,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 15:27:07,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 15:27:07,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 15:27:07,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 15:27:07,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 15:27:07,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 15:27:07,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 15:27:07,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 15:27:07,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 15:27:07,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 15:27:07,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 15:27:07,845 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-07 15:27:07,874 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 15:27:07,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 15:27:07,875 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 15:27:07,875 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 15:27:07,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 15:27:07,876 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 15:27:07,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 15:27:07,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 15:27:07,876 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 15:27:07,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 15:27:07,877 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 15:27:07,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 15:27:07,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 15:27:07,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 15:27:07,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 15:27:07,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 15:27:07,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 15:27:07,879 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 15:27:07,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 15:27:07,879 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 15:27:07,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 15:27:07,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 15:27:07,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 15:27:07,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 15:27:07,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:27:07,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 15:27:07,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 15:27:07,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 15:27:07,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 15:27:07,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 15:27:07,881 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 15:27:07,881 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 15:27:07,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 15:27:07,881 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-07 15:27:08,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 15:27:08,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 15:27:08,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 15:27:08,145 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 15:27:08,145 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 15:27:08,146 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c [2022-04-07 15:27:08,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0612162cb/20be16af3fe24d30bf730fdc0e504cf0/FLAGc0327982f [2022-04-07 15:27:08,595 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 15:27:08,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c [2022-04-07 15:27:08,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0612162cb/20be16af3fe24d30bf730fdc0e504cf0/FLAGc0327982f [2022-04-07 15:27:08,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0612162cb/20be16af3fe24d30bf730fdc0e504cf0 [2022-04-07 15:27:08,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 15:27:08,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 15:27:08,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 15:27:08,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 15:27:08,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 15:27:08,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:27:08" (1/1) ... [2022-04-07 15:27:08,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621ff177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:27:08, skipping insertion in model container [2022-04-07 15:27:08,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:27:08" (1/1) ... [2022-04-07 15:27:09,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 15:27:09,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 15:27:09,144 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_valuebound10.c[458,471] [2022-04-07 15:27:09,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:27:09,169 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 15:27:09,179 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_valuebound10.c[458,471] [2022-04-07 15:27:09,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:27:09,196 INFO L208 MainTranslator]: Completed translation [2022-04-07 15:27:09,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:27:09 WrapperNode [2022-04-07 15:27:09,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 15:27:09,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 15:27:09,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 15:27:09,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 15:27:09,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:27:09" (1/1) ... [2022-04-07 15:27:09,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:27:09" (1/1) ... [2022-04-07 15:27:09,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:27:09" (1/1) ... [2022-04-07 15:27:09,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:27:09" (1/1) ... [2022-04-07 15:27:09,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:27:09" (1/1) ... [2022-04-07 15:27:09,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:27:09" (1/1) ... [2022-04-07 15:27:09,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:27:09" (1/1) ... [2022-04-07 15:27:09,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 15:27:09,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 15:27:09,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 15:27:09,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 15:27:09,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:27:09" (1/1) ... [2022-04-07 15:27:09,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:27:09,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:09,259 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-07 15:27:09,268 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-07 15:27:09,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 15:27:09,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 15:27:09,299 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 15:27:09,299 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 15:27:09,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 15:27:09,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 15:27:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 15:27:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 15:27:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 15:27:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 15:27:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-07 15:27:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 15:27:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 15:27:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 15:27:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 15:27:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 15:27:09,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 15:27:09,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 15:27:09,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 15:27:09,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 15:27:09,361 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 15:27:09,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 15:27:09,571 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 15:27:09,577 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 15:27:09,577 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 15:27:09,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:27:09 BoogieIcfgContainer [2022-04-07 15:27:09,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 15:27:09,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 15:27:09,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 15:27:09,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 15:27:09,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 03:27:08" (1/3) ... [2022-04-07 15:27:09,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70987b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:27:09, skipping insertion in model container [2022-04-07 15:27:09,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:27:09" (2/3) ... [2022-04-07 15:27:09,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70987b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:27:09, skipping insertion in model container [2022-04-07 15:27:09,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:27:09" (3/3) ... [2022-04-07 15:27:09,591 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound10.c [2022-04-07 15:27:09,595 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 15:27:09,595 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 15:27:09,644 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 15:27:09,653 INFO L340 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 [2022-04-07 15:27:09,653 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 15:27:09,679 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-07 15:27:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 15:27:09,685 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:09,686 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:27:09,686 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:09,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:09,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-07 15:27:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:09,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153296461] [2022-04-07 15:27:09,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:09,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:09,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 15:27:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:09,909 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-07 15:27:09,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-07 15:27:09,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-07 15:27:09,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 15:27:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:09,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-07 15:27:09,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-07 15:27:09,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-07 15:27:09,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-07 15:27:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-07 15:27:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:09,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-07 15:27:09,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-07 15:27:09,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-07 15:27:09,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-07 15:27:09,950 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-07 15:27:09,950 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-07 15:27:09,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-07 15:27:09,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-07 15:27:09,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-07 15:27:09,951 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-07 15:27:09,951 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {32#true} is VALID [2022-04-07 15:27:09,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-07 15:27:09,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-07 15:27:09,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-07 15:27:09,952 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-07 15:27:09,952 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-07 15:27:09,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-07 15:27:09,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-07 15:27:09,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-07 15:27:09,954 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-07 15:27:09,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-07 15:27:09,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-07 15:27:09,955 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-07 15:27:09,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-07 15:27:09,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-07 15:27:09,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-07 15:27:09,957 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-07 15:27:09,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:09,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153296461] [2022-04-07 15:27:09,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153296461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:27:09,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:27:09,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 15:27:09,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582871529] [2022-04-07 15:27:09,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:27:09,968 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-07 15:27:09,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:09,972 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-07 15:27:10,008 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-07 15:27:10,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 15:27:10,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:10,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 15:27:10,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 15:27:10,038 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-07 15:27:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:10,182 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-07 15:27:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 15:27:10,183 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-07 15:27:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:10,185 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-07 15:27:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-07 15:27:10,200 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-07 15:27:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-07 15:27:10,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-07 15:27:10,304 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-07 15:27:10,313 INFO L225 Difference]: With dead ends: 51 [2022-04-07 15:27:10,313 INFO L226 Difference]: Without dead ends: 24 [2022-04-07 15:27:10,316 INFO L912 BasicCegarLoop]: 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-07 15:27:10,319 INFO L913 BasicCegarLoop]: 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-07 15:27:10,320 INFO L914 BasicCegarLoop]: 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-07 15:27:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-07 15:27:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-07 15:27:10,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:10,354 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-07 15:27:10,355 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-07 15:27:10,358 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-07 15:27:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:10,370 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-07 15:27:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-07 15:27:10,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:10,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:10,371 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-07 15:27:10,371 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-07 15:27:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:10,374 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-07 15:27:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-07 15:27:10,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:10,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:10,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:10,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:10,376 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-07 15:27:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-07 15:27:10,378 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-07 15:27:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:10,379 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-07 15:27:10,380 INFO L479 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-07 15:27:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-07 15:27:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 15:27:10,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:10,381 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:27:10,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 15:27:10,382 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:10,383 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-07 15:27:10,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:10,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041995703] [2022-04-07 15:27:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:10,425 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:10,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025975297] [2022-04-07 15:27:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:10,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:10,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:10,439 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-07 15:27:10,448 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-07 15:27:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:10,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 15:27:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:10,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:10,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2022-04-07 15:27:10,690 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-07 15:27:10,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-07 15:27:10,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #63#return; {202#true} is VALID [2022-04-07 15:27:10,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret5 := main(); {202#true} is VALID [2022-04-07 15:27:10,691 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-07 15:27:10,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {202#true} is VALID [2022-04-07 15:27:10,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-07 15:27:10,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-07 15:27:10,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-07 15:27:10,693 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} #53#return; {202#true} is VALID [2022-04-07 15:27:10,693 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-07 15:27:10,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-07 15:27:10,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-07 15:27:10,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-07 15:27:10,698 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} #55#return; {202#true} is VALID [2022-04-07 15:27:10,698 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-07 15:27:10,700 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-07 15:27:10,701 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-07 15:27:10,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:10,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {203#false} is VALID [2022-04-07 15:27:10,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-04-07 15:27:10,702 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-07 15:27:10,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 15:27:10,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:10,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041995703] [2022-04-07 15:27:10,703 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:10,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025975297] [2022-04-07 15:27:10,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025975297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:27:10,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:27:10,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 15:27:10,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949362415] [2022-04-07 15:27:10,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:27:10,709 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-07 15:27:10,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:10,710 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-07 15:27:10,728 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-07 15:27:10,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 15:27:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:10,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 15:27:10,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 15:27:10,731 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-07 15:27:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:10,849 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-07 15:27:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 15:27:10,849 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-07 15:27:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:10,850 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-07 15:27:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-07 15:27:10,852 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-07 15:27:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-07 15:27:10,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-07 15:27:10,891 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-07 15:27:10,893 INFO L225 Difference]: With dead ends: 35 [2022-04-07 15:27:10,893 INFO L226 Difference]: Without dead ends: 31 [2022-04-07 15:27:10,894 INFO L912 BasicCegarLoop]: 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-07 15:27:10,895 INFO L913 BasicCegarLoop]: 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-07 15:27:10,895 INFO L914 BasicCegarLoop]: 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-07 15:27:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-07 15:27:10,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-07 15:27:10,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:10,902 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-07 15:27:10,902 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-07 15:27:10,902 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-07 15:27:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:10,905 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-07 15:27:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-07 15:27:10,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:10,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:10,906 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-07 15:27:10,906 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-07 15:27:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:10,909 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-07 15:27:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-07 15:27:10,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:10,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:10,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:10,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:10,910 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-07 15:27:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-07 15:27:10,912 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-07 15:27:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:10,912 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-07 15:27:10,912 INFO L479 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-07 15:27:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-07 15:27:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 15:27:10,913 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:10,914 INFO L499 BasicCegarLoop]: 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-07 15:27:10,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 15:27:11,123 WARN L460 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-07 15:27:11,124 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:11,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-07 15:27:11,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:11,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832310415] [2022-04-07 15:27:11,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:11,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:11,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:11,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652830127] [2022-04-07 15:27:11,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:11,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:11,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:11,146 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-07 15:27:11,156 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-07 15:27:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:11,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 15:27:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:11,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:11,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-07 15:27:11,404 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-07 15:27:11,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-07 15:27:11,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-07 15:27:11,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-07 15:27:11,405 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-07 15:27:11,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {434#true} is VALID [2022-04-07 15:27:11,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-07 15:27:11,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-07 15:27:11,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-07 15:27:11,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-07 15:27:11,406 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-07 15:27:11,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-07 15:27:11,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-07 15:27:11,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-07 15:27:11,407 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-07 15:27:11,407 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-07 15:27:11,408 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-07 15:27:11,408 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-07 15:27:11,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-07 15:27:11,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-07 15:27:11,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-07 15:27:11,409 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-07 15:27:11,409 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-07 15:27:11,410 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-07 15:27:11,411 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-07 15:27:11,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:11,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-07 15:27:11,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-07 15:27:11,412 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-07 15:27:11,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:27:11,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-07 15:27:11,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-07 15:27:11,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:11,659 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-07 15:27:11,660 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-07 15:27:13,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-07 15:27:13,100 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-07 15:27:13,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-07 15:27:13,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-07 15:27:13,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-07 15:27:13,101 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-07 15:27:13,102 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-07 15:27:13,103 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-07 15:27:13,104 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-07 15:27:13,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-07 15:27:13,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-07 15:27:13,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-07 15:27:13,104 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-07 15:27:13,104 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-07 15:27:13,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-07 15:27:13,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-07 15:27:13,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-07 15:27:13,105 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {434#true} is VALID [2022-04-07 15:27:13,105 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-07 15:27:13,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-07 15:27:13,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-07 15:27:13,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-07 15:27:13,106 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-07 15:27:13,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-07 15:27:13,106 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-07 15:27:13,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:13,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832310415] [2022-04-07 15:27:13,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:13,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652830127] [2022-04-07 15:27:13,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652830127] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 15:27:13,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:27:13,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-07 15:27:13,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091109756] [2022-04-07 15:27:13,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:27:13,108 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-07 15:27:13,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:13,108 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-07 15:27:13,416 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-07 15:27:13,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 15:27:13,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:13,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 15:27:13,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 15:27:13,417 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-07 15:27:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:13,564 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-07 15:27:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 15:27:13,564 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-07 15:27:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:13,565 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-07 15:27:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-07 15:27:13,566 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-07 15:27:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-07 15:27:13,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-07 15:27:13,804 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-07 15:27:13,805 INFO L225 Difference]: With dead ends: 37 [2022-04-07 15:27:13,805 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 15:27:13,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 15:27:13,806 INFO L913 BasicCegarLoop]: 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-07 15:27:13,806 INFO L914 BasicCegarLoop]: 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-07 15:27:13,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 15:27:13,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-07 15:27:13,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:13,814 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-07 15:27:13,814 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-07 15:27:13,815 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-07 15:27:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:13,816 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-07 15:27:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-07 15:27:13,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:13,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:13,817 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-07 15:27:13,818 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-07 15:27:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:13,820 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-07 15:27:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-07 15:27:13,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:13,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:13,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:13,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:13,821 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-07 15:27:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-07 15:27:13,822 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-07 15:27:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:13,822 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-07 15:27:13,823 INFO L479 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-07 15:27:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-07 15:27:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-07 15:27:13,824 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:13,824 INFO L499 BasicCegarLoop]: 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-07 15:27:13,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 15:27:14,028 WARN L460 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-07 15:27:14,028 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:14,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:14,029 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-07 15:27:14,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:14,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958744362] [2022-04-07 15:27:14,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:14,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:14,043 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:14,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203369287] [2022-04-07 15:27:14,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:14,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:14,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:14,045 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-07 15:27:14,053 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-07 15:27:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:14,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 15:27:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:14,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:14,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2022-04-07 15:27:14,508 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-07 15:27:14,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-07 15:27:14,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #63#return; {784#true} is VALID [2022-04-07 15:27:14,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2022-04-07 15:27:14,509 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-07 15:27:14,509 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {784#true} is VALID [2022-04-07 15:27:14,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-07 15:27:14,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-07 15:27:14,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-07 15:27:14,509 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} #53#return; {784#true} is VALID [2022-04-07 15:27:14,510 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-07 15:27:14,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-07 15:27:14,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-07 15:27:14,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-07 15:27:14,510 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} #55#return; {784#true} is VALID [2022-04-07 15:27:14,530 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-07 15:27:14,530 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-07 15:27:14,530 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-07 15:27:14,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-07 15:27:14,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-07 15:27:14,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-07 15:27:14,531 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-07 15:27:14,532 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-07 15:27:14,533 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-07 15:27:14,533 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-07 15:27:14,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-07 15:27:14,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-07 15:27:14,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-07 15:27:14,535 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-07 15:27:14,535 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-07 15:27:14,536 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-07 15:27:14,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-07 15:27:14,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-07 15:27:14,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-07 15:27:14,536 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-07 15:27:14,537 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-07 15:27:14,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:14,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {785#false} is VALID [2022-04-07 15:27:14,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-07 15:27:14,539 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-07 15:27:14,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:27:14,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:14,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958744362] [2022-04-07 15:27:14,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:14,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203369287] [2022-04-07 15:27:14,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203369287] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:27:14,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:27:14,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-07 15:27:14,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307298443] [2022-04-07 15:27:14,910 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:27:14,910 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-07 15:27:14,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:14,911 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-07 15:27:14,936 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-07 15:27:14,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 15:27:14,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:14,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 15:27:14,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 15:27:14,937 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-07 15:27:15,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:15,206 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-07 15:27:15,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 15:27:15,207 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-07 15:27:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:15,208 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-07 15:27:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-07 15:27:15,210 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-07 15:27:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-07 15:27:15,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-07 15:27:15,251 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-07 15:27:15,256 INFO L225 Difference]: With dead ends: 42 [2022-04-07 15:27:15,256 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 15:27:15,256 INFO L912 BasicCegarLoop]: 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-07 15:27:15,257 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:27:15,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 15:27:15,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 15:27:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-07 15:27:15,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:15,274 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-07 15:27:15,274 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-07 15:27:15,275 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-07 15:27:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:15,277 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-07 15:27:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-07 15:27:15,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:15,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:15,278 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-07 15:27:15,278 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-07 15:27:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:15,280 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-07 15:27:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-07 15:27:15,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:15,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:15,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:15,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:15,281 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-07 15:27:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-07 15:27:15,282 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-07 15:27:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:15,282 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-07 15:27:15,283 INFO L479 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-07 15:27:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-07 15:27:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-07 15:27:15,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:15,284 INFO L499 BasicCegarLoop]: 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-07 15:27:15,307 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-07 15:27:15,484 WARN L460 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-07 15:27:15,485 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:15,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:15,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 2 times [2022-04-07 15:27:15,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:15,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302140750] [2022-04-07 15:27:15,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:15,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:15,505 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:15,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385018605] [2022-04-07 15:27:15,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:27:15,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:15,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:15,509 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-07 15:27:15,513 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-07 15:27:15,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:27:15,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:27:15,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 15:27:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:15,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:15,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {1160#true} call ULTIMATE.init(); {1160#true} is VALID [2022-04-07 15:27:15,969 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-07 15:27:15,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-07 15:27:15,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} #63#return; {1160#true} is VALID [2022-04-07 15:27:15,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {1160#true} call #t~ret5 := main(); {1160#true} is VALID [2022-04-07 15:27:15,970 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-07 15:27:15,970 INFO L272 TraceCheckUtils]: 6: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1160#true} is VALID [2022-04-07 15:27:15,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-07 15:27:15,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-07 15:27:15,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-07 15:27:15,971 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1160#true} {1160#true} #53#return; {1160#true} is VALID [2022-04-07 15:27:15,971 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-07 15:27:15,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-07 15:27:15,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-07 15:27:15,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-07 15:27:15,971 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1160#true} {1160#true} #55#return; {1160#true} is VALID [2022-04-07 15:27:15,972 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-07 15:27:15,972 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-07 15:27:15,972 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-07 15:27:15,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-07 15:27:15,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-07 15:27:15,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-07 15:27:15,984 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-07 15:27:15,985 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-07 15:27:15,985 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-07 15:27:15,986 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-07 15:27:15,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-07 15:27:15,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-07 15:27:15,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-07 15:27:15,987 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-07 15:27:15,987 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-07 15:27:15,988 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-07 15:27:15,988 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-07 15:27:15,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-07 15:27:15,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-07 15:27:15,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-07 15:27:15,989 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-07 15:27:15,990 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-07 15:27:15,990 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-07 15:27:15,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-07 15:27:15,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-07 15:27:15,990 INFO L290 TraceCheckUtils]: 41: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-07 15:27:15,996 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-07 15:27:15,997 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-07 15:27:15,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:15,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1161#false} is VALID [2022-04-07 15:27:15,998 INFO L290 TraceCheckUtils]: 46: Hoare triple {1161#false} assume !false; {1161#false} is VALID [2022-04-07 15:27:15,998 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-07 15:27:15,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:27:16,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:16,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302140750] [2022-04-07 15:27:16,474 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:16,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385018605] [2022-04-07 15:27:16,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385018605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:27:16,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:27:16,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-07 15:27:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492377903] [2022-04-07 15:27:16,474 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:27:16,475 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-07 15:27:16,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:16,476 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-07 15:27:16,513 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-07 15:27:16,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 15:27:16,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:16,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 15:27:16,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-07 15:27:16,515 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-07 15:27:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:16,851 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-07 15:27:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 15:27:16,851 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-07 15:27:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:16,852 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-07 15:27:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-07 15:27:16,853 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-07 15:27:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-07 15:27:16,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-07 15:27:16,900 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-07 15:27:16,901 INFO L225 Difference]: With dead ends: 45 [2022-04-07 15:27:16,901 INFO L226 Difference]: Without dead ends: 39 [2022-04-07 15:27:16,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-07 15:27:16,902 INFO L913 BasicCegarLoop]: 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-07 15:27:16,903 INFO L914 BasicCegarLoop]: 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-07 15:27:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-07 15:27:16,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-07 15:27:16,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:16,920 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-07 15:27:16,920 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-07 15:27:16,920 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-07 15:27:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:16,922 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-07 15:27:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-07 15:27:16,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:16,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:16,923 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-07 15:27:16,924 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-07 15:27:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:16,926 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-07 15:27:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-07 15:27:16,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:16,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:16,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:16,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:16,927 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-07 15:27:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-07 15:27:16,928 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-07 15:27:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:16,929 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-07 15:27:16,929 INFO L479 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-07 15:27:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-07 15:27:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-07 15:27:16,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:16,930 INFO L499 BasicCegarLoop]: 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-07 15:27:16,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 15:27:17,135 WARN L460 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-07 15:27:17,136 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:17,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 3 times [2022-04-07 15:27:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:17,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763619887] [2022-04-07 15:27:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:17,156 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:17,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [783688555] [2022-04-07 15:27:17,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 15:27:17,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:17,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:17,158 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-07 15:27:17,159 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-07 15:27:17,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 15:27:17,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:27:17,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 15:27:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:17,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:17,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {1596#true} call ULTIMATE.init(); {1596#true} is VALID [2022-04-07 15:27:17,767 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-07 15:27:17,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-07 15:27:17,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1596#true} {1596#true} #63#return; {1596#true} is VALID [2022-04-07 15:27:17,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {1596#true} call #t~ret5 := main(); {1596#true} is VALID [2022-04-07 15:27:17,767 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-07 15:27:17,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {1596#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1596#true} is VALID [2022-04-07 15:27:17,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-07 15:27:17,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-07 15:27:17,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-07 15:27:17,768 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1596#true} {1596#true} #53#return; {1596#true} is VALID [2022-04-07 15:27:17,768 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-07 15:27:17,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-07 15:27:17,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-07 15:27:17,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-07 15:27:17,768 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1596#true} {1596#true} #55#return; {1596#true} is VALID [2022-04-07 15:27:17,769 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-07 15:27:17,769 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-07 15:27:17,769 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-07 15:27:17,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-07 15:27:17,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-07 15:27:17,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-07 15:27:17,770 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-07 15:27:17,771 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-07 15:27:17,771 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-07 15:27:17,771 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-07 15:27:17,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-07 15:27:17,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-07 15:27:17,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-07 15:27:17,772 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-07 15:27:17,773 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-07 15:27:17,773 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-07 15:27:17,773 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-07 15:27:17,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-07 15:27:17,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-07 15:27:17,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-07 15:27:17,774 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-07 15:27:17,775 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-07 15:27:17,775 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-07 15:27:17,775 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-07 15:27:17,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-07 15:27:17,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-07 15:27:17,776 INFO L290 TraceCheckUtils]: 42: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-07 15:27:17,776 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-07 15:27:17,777 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-07 15:27:17,777 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-07 15:27:17,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-07 15:27:17,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-07 15:27:17,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-07 15:27:17,778 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-07 15:27:17,780 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-07 15:27:17,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {1756#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1760#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:17,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {1760#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1597#false} is VALID [2022-04-07 15:27:17,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {1597#false} assume !false; {1597#false} is VALID [2022-04-07 15:27:17,783 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-07 15:27:17,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:27:18,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:18,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763619887] [2022-04-07 15:27:18,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:18,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783688555] [2022-04-07 15:27:18,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783688555] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:27:18,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:27:18,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 15:27:18,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239010598] [2022-04-07 15:27:18,094 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:27:18,095 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-07 15:27:18,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:18,095 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-07 15:27:18,128 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-07 15:27:18,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 15:27:18,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:18,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 15:27:18,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-07 15:27:18,129 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-07 15:27:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:18,532 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-07 15:27:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 15:27:18,533 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-07 15:27:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:18,533 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-07 15:27:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-07 15:27:18,535 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-07 15:27:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-07 15:27:18,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-07 15:27:18,580 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-07 15:27:18,581 INFO L225 Difference]: With dead ends: 48 [2022-04-07 15:27:18,581 INFO L226 Difference]: Without dead ends: 42 [2022-04-07 15:27:18,581 INFO L912 BasicCegarLoop]: 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-07 15:27:18,582 INFO L913 BasicCegarLoop]: 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-07 15:27:18,582 INFO L914 BasicCegarLoop]: 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-07 15:27:18,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-07 15:27:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-07 15:27:18,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:18,595 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-07 15:27:18,596 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-07 15:27:18,596 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-07 15:27:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:18,598 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-07 15:27:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-07 15:27:18,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:18,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:18,599 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-07 15:27:18,599 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-07 15:27:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:18,600 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-07 15:27:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-07 15:27:18,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:18,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:18,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:18,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:18,601 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-07 15:27:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-07 15:27:18,602 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-07 15:27:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:18,603 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-07 15:27:18,603 INFO L479 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-07 15:27:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-07 15:27:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-07 15:27:18,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:18,604 INFO L499 BasicCegarLoop]: 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-07 15:27:18,614 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-07 15:27:18,804 WARN L460 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-07 15:27:18,805 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:18,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 4 times [2022-04-07 15:27:18,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:18,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996790525] [2022-04-07 15:27:18,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:18,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:18,821 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:18,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945586444] [2022-04-07 15:27:18,821 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 15:27:18,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:18,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:18,822 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-07 15:27:18,834 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-07 15:27:18,875 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 15:27:18,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:27:18,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-07 15:27:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:18,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:19,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {2048#true} call ULTIMATE.init(); {2048#true} is VALID [2022-04-07 15:27:19,323 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-07 15:27:19,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-07 15:27:19,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2048#true} {2048#true} #63#return; {2048#true} is VALID [2022-04-07 15:27:19,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {2048#true} call #t~ret5 := main(); {2048#true} is VALID [2022-04-07 15:27:19,323 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-07 15:27:19,324 INFO L272 TraceCheckUtils]: 6: Hoare triple {2048#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2048#true} is VALID [2022-04-07 15:27:19,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-07 15:27:19,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-07 15:27:19,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-07 15:27:19,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2048#true} {2048#true} #53#return; {2048#true} is VALID [2022-04-07 15:27:19,327 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-07 15:27:19,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-07 15:27:19,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-07 15:27:19,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-07 15:27:19,327 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2048#true} {2048#true} #55#return; {2048#true} is VALID [2022-04-07 15:27:19,328 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-07 15:27:19,328 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-07 15:27:19,328 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-07 15:27:19,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-07 15:27:19,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-07 15:27:19,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-07 15:27:19,329 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-07 15:27:19,330 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-07 15:27:19,330 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-07 15:27:19,331 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-07 15:27:19,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-07 15:27:19,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-07 15:27:19,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-07 15:27:19,333 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-07 15:27:19,334 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-07 15:27:19,335 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-07 15:27:19,335 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-07 15:27:19,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-07 15:27:19,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-07 15:27:19,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-07 15:27:19,336 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-07 15:27:19,336 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-07 15:27:19,337 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-07 15:27:19,337 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-07 15:27:19,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-07 15:27:19,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-07 15:27:19,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-07 15:27:19,338 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-07 15:27:19,338 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-07 15:27:19,338 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-07 15:27:19,339 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-07 15:27:19,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-07 15:27:19,341 INFO L290 TraceCheckUtils]: 48: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-07 15:27:19,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-07 15:27:19,343 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-07 15:27:19,344 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-07 15:27:19,344 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-07 15:27:19,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-07 15:27:19,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-07 15:27:19,344 INFO L290 TraceCheckUtils]: 55: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-07 15:27:19,345 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-07 15:27:19,346 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-07 15:27:19,346 INFO L290 TraceCheckUtils]: 58: Hoare triple {2230#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:19,347 INFO L290 TraceCheckUtils]: 59: Hoare triple {2234#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2049#false} is VALID [2022-04-07 15:27:19,347 INFO L290 TraceCheckUtils]: 60: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2022-04-07 15:27:19,349 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-07 15:27:19,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:27:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:19,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996790525] [2022-04-07 15:27:19,645 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:19,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945586444] [2022-04-07 15:27:19,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945586444] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:27:19,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:27:19,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-07 15:27:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699162537] [2022-04-07 15:27:19,646 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:27:19,646 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-07 15:27:19,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:19,647 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-07 15:27:19,687 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-07 15:27:19,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 15:27:19,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:19,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 15:27:19,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-07 15:27:19,688 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-07 15:27:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:20,226 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-07 15:27:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 15:27:20,227 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-07 15:27:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:20,228 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-07 15:27:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-07 15:27:20,229 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-07 15:27:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-07 15:27:20,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-07 15:27:20,283 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-07 15:27:20,285 INFO L225 Difference]: With dead ends: 51 [2022-04-07 15:27:20,285 INFO L226 Difference]: Without dead ends: 45 [2022-04-07 15:27:20,286 INFO L912 BasicCegarLoop]: 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-07 15:27:20,288 INFO L913 BasicCegarLoop]: 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-07 15:27:20,288 INFO L914 BasicCegarLoop]: 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-07 15:27:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-07 15:27:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-07 15:27:20,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:20,314 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-07 15:27:20,314 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-07 15:27:20,315 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-07 15:27:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:20,317 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-07 15:27:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-07 15:27:20,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:20,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:20,318 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-07 15:27:20,318 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-07 15:27:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:20,320 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-07 15:27:20,320 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-07 15:27:20,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:20,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:20,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:20,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:20,321 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-07 15:27:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-07 15:27:20,323 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-07 15:27:20,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:20,323 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-07 15:27:20,323 INFO L479 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-07 15:27:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-07 15:27:20,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-07 15:27:20,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:20,324 INFO L499 BasicCegarLoop]: 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-07 15:27:20,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-07 15:27:20,543 WARN L460 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-07 15:27:20,544 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:20,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 5 times [2022-04-07 15:27:20,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:20,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277531505] [2022-04-07 15:27:20,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:20,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:20,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:20,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1067344191] [2022-04-07 15:27:20,558 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 15:27:20,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:20,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:20,559 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-07 15:27:20,572 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-07 15:27:36,209 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-07 15:27:36,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:27:36,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-07 15:27:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:36,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:36,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {2538#true} call ULTIMATE.init(); {2538#true} is VALID [2022-04-07 15:27:36,727 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-07 15:27:36,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-07 15:27:36,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2538#true} {2538#true} #63#return; {2538#true} is VALID [2022-04-07 15:27:36,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {2538#true} call #t~ret5 := main(); {2538#true} is VALID [2022-04-07 15:27:36,728 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-07 15:27:36,728 INFO L272 TraceCheckUtils]: 6: Hoare triple {2538#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2538#true} is VALID [2022-04-07 15:27:36,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-07 15:27:36,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-07 15:27:36,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-07 15:27:36,728 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2538#true} {2538#true} #53#return; {2538#true} is VALID [2022-04-07 15:27:36,728 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-07 15:27:36,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-07 15:27:36,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-07 15:27:36,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-07 15:27:36,729 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2538#true} {2538#true} #55#return; {2538#true} is VALID [2022-04-07 15:27:36,729 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-07 15:27:36,730 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-07 15:27:36,730 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-07 15:27:36,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-07 15:27:36,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-07 15:27:36,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-07 15:27:36,736 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-07 15:27:36,737 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-07 15:27:36,737 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-07 15:27:36,737 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-07 15:27:36,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-07 15:27:36,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-07 15:27:36,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-07 15:27:36,738 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-07 15:27:36,739 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-07 15:27:36,739 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-07 15:27:36,739 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-07 15:27:36,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-07 15:27:36,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-07 15:27:36,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-07 15:27:36,740 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-07 15:27:36,741 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-07 15:27:36,741 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-07 15:27:36,741 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-07 15:27:36,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-07 15:27:36,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-07 15:27:36,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-07 15:27:36,743 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-07 15:27:36,744 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-07 15:27:36,745 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-07 15:27:36,745 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-07 15:27:36,745 INFO L290 TraceCheckUtils]: 47: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-07 15:27:36,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-07 15:27:36,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-07 15:27:36,746 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-07 15:27:36,746 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-07 15:27:36,747 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-07 15:27:36,747 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-07 15:27:36,747 INFO L290 TraceCheckUtils]: 54: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-07 15:27:36,747 INFO L290 TraceCheckUtils]: 55: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-07 15:27:36,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-07 15:27:36,748 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-07 15:27:36,748 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-07 15:27:36,748 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-07 15:27:36,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-07 15:27:36,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-07 15:27:36,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-07 15:27:36,752 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-07 15:27:36,758 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-07 15:27:36,759 INFO L290 TraceCheckUtils]: 65: Hoare triple {2742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:36,760 INFO L290 TraceCheckUtils]: 66: Hoare triple {2746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2539#false} is VALID [2022-04-07 15:27:36,760 INFO L290 TraceCheckUtils]: 67: Hoare triple {2539#false} assume !false; {2539#false} is VALID [2022-04-07 15:27:36,761 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-07 15:27:36,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:27:37,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:37,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277531505] [2022-04-07 15:27:37,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:37,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067344191] [2022-04-07 15:27:37,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067344191] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:27:37,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:27:37,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-07 15:27:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782378373] [2022-04-07 15:27:37,080 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:27:37,080 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-07 15:27:37,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:37,081 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-07 15:27:37,115 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-07 15:27:37,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 15:27:37,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:37,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 15:27:37,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-07 15:27:37,116 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-07 15:27:37,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:37,830 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-07 15:27:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 15:27:37,830 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-07 15:27:37,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:37,831 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-07 15:27:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-07 15:27:37,832 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-07 15:27:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-07 15:27:37,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-07 15:27:37,886 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-07 15:27:37,887 INFO L225 Difference]: With dead ends: 54 [2022-04-07 15:27:37,887 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 15:27:37,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-07 15:27:37,889 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-07 15:27:37,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 15:27:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 15:27:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-07 15:27:37,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:37,909 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-07 15:27:37,909 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-07 15:27:37,910 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-07 15:27:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:37,912 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-07 15:27:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-07 15:27:37,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:37,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:37,912 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-07 15:27:37,913 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-07 15:27:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:37,914 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-07 15:27:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-07 15:27:37,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:37,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:37,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:37,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:37,915 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-07 15:27:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-07 15:27:37,917 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-07 15:27:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:37,918 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-07 15:27:37,919 INFO L479 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-07 15:27:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-07 15:27:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-07 15:27:37,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:37,920 INFO L499 BasicCegarLoop]: 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-07 15:27:37,936 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-07 15:27:38,120 WARN L460 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-07 15:27:38,120 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:38,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 6 times [2022-04-07 15:27:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:38,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660893063] [2022-04-07 15:27:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:38,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:38,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:38,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307436369] [2022-04-07 15:27:38,135 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 15:27:38,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:38,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:38,136 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-07 15:27:38,163 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-07 15:27:39,942 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-07 15:27:39,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:27:39,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 15:27:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:39,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:40,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {3066#true} call ULTIMATE.init(); {3066#true} is VALID [2022-04-07 15:27:40,514 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-07 15:27:40,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-07 15:27:40,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3066#true} {3066#true} #63#return; {3066#true} is VALID [2022-04-07 15:27:40,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {3066#true} call #t~ret5 := main(); {3066#true} is VALID [2022-04-07 15:27:40,514 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-07 15:27:40,514 INFO L272 TraceCheckUtils]: 6: Hoare triple {3066#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3066#true} is VALID [2022-04-07 15:27:40,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-07 15:27:40,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-07 15:27:40,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-07 15:27:40,515 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3066#true} {3066#true} #53#return; {3066#true} is VALID [2022-04-07 15:27:40,515 INFO L272 TraceCheckUtils]: 11: Hoare triple {3066#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3066#true} is VALID [2022-04-07 15:27:40,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-07 15:27:40,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-07 15:27:40,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-07 15:27:40,515 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3066#true} {3066#true} #55#return; {3066#true} is VALID [2022-04-07 15:27:40,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {3066#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:40,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {3119#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:40,516 INFO L272 TraceCheckUtils]: 18: Hoare triple {3119#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-07 15:27:40,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-07 15:27:40,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-07 15:27:40,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-07 15:27:40,517 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3066#true} {3119#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:40,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {3119#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 15:27:40,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 15:27:40,518 INFO L272 TraceCheckUtils]: 25: Hoare triple {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-07 15:27:40,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-07 15:27:40,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-07 15:27:40,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-07 15:27:40,518 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3066#true} {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 15:27:40,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-07 15:27:40,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-07 15:27:40,519 INFO L272 TraceCheckUtils]: 32: Hoare triple {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-07 15:27:40,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-07 15:27:40,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-07 15:27:40,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-07 15:27:40,520 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3066#true} {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #57#return; {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-07 15:27:40,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-07 15:27:40,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-07 15:27:40,521 INFO L272 TraceCheckUtils]: 39: Hoare triple {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~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)); {3066#true} is VALID [2022-04-07 15:27:40,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-07 15:27:40,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-07 15:27:40,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-07 15:27:40,522 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3066#true} {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #57#return; {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-07 15:27:40,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~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; {3207#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-07 15:27:40,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {3207#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !false; {3207#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-07 15:27:40,523 INFO L272 TraceCheckUtils]: 46: Hoare triple {3207#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-07 15:27:40,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-07 15:27:40,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-07 15:27:40,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-07 15:27:40,524 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3066#true} {3207#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} #57#return; {3207#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-07 15:27:40,524 INFO L290 TraceCheckUtils]: 51: Hoare triple {3207#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3229#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-07 15:27:40,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {3229#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {3229#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-07 15:27:40,525 INFO L272 TraceCheckUtils]: 53: Hoare triple {3229#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-07 15:27:40,525 INFO L290 TraceCheckUtils]: 54: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-07 15:27:40,525 INFO L290 TraceCheckUtils]: 55: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-07 15:27:40,525 INFO L290 TraceCheckUtils]: 56: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-07 15:27:40,526 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3066#true} {3229#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #57#return; {3229#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-07 15:27:40,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {3229#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-07 15:27:40,526 INFO L290 TraceCheckUtils]: 59: Hoare triple {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-07 15:27:40,526 INFO L272 TraceCheckUtils]: 60: Hoare triple {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-07 15:27:40,527 INFO L290 TraceCheckUtils]: 61: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-07 15:27:40,527 INFO L290 TraceCheckUtils]: 62: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-07 15:27:40,527 INFO L290 TraceCheckUtils]: 63: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-07 15:27:40,528 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3066#true} {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-07 15:27:40,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-07 15:27:40,529 INFO L272 TraceCheckUtils]: 66: Hoare triple {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-07 15:27:40,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-07 15:27:40,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-07 15:27:40,529 INFO L290 TraceCheckUtils]: 69: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-07 15:27:40,529 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3066#true} {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-07 15:27:40,530 INFO L272 TraceCheckUtils]: 71: Hoare triple {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3292#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:27:40,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {3292#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3296#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:40,531 INFO L290 TraceCheckUtils]: 73: Hoare triple {3296#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3067#false} is VALID [2022-04-07 15:27:40,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {3067#false} assume !false; {3067#false} is VALID [2022-04-07 15:27:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-07 15:27:40,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:27:41,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:41,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660893063] [2022-04-07 15:27:41,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:41,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307436369] [2022-04-07 15:27:41,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307436369] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:27:41,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:27:41,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-07 15:27:41,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855572018] [2022-04-07 15:27:41,188 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:27:41,189 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-07 15:27:41,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:41,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-07 15:27:41,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:27:41,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 15:27:41,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:41,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 15:27:41,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-07 15:27:41,234 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-07 15:27:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:41,977 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-07 15:27:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 15:27:41,977 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-07 15:27:41,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-07 15:27:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-07 15:27:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-07 15:27:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-07 15:27:41,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-07 15:27:42,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:27:42,034 INFO L225 Difference]: With dead ends: 57 [2022-04-07 15:27:42,034 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 15:27:42,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-07 15:27:42,035 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 15:27:42,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 302 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 15:27:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 15:27:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-07 15:27:42,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:42,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:27:42,065 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:27:42,065 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:27:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:42,068 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-07 15:27:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-07 15:27:42,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:42,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:42,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-07 15:27:42,069 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-07 15:27:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:42,071 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-07 15:27:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-07 15:27:42,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:42,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:42,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:42,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:27:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-07 15:27:42,073 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-07 15:27:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:42,074 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-07 15:27:42,074 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-07 15:27:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-07 15:27:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-07 15:27:42,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:42,075 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:27:42,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 15:27:42,282 WARN L460 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-07 15:27:42,282 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:42,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 7 times [2022-04-07 15:27:42,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:42,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852843757] [2022-04-07 15:27:42,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:42,295 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:42,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126717978] [2022-04-07 15:27:42,295 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 15:27:42,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:42,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:42,314 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:27:42,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-07 15:27:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:43,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-07 15:27:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:43,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:43,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {3720#true} call ULTIMATE.init(); {3720#true} is VALID [2022-04-07 15:27:43,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {3720#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); {3720#true} is VALID [2022-04-07 15:27:43,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 15:27:43,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3720#true} {3720#true} #63#return; {3720#true} is VALID [2022-04-07 15:27:43,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {3720#true} call #t~ret5 := main(); {3720#true} is VALID [2022-04-07 15:27:43,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {3720#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; {3720#true} is VALID [2022-04-07 15:27:43,849 INFO L272 TraceCheckUtils]: 6: Hoare triple {3720#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3720#true} is VALID [2022-04-07 15:27:43,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 15:27:43,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 15:27:43,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 15:27:43,849 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3720#true} {3720#true} #53#return; {3720#true} is VALID [2022-04-07 15:27:43,849 INFO L272 TraceCheckUtils]: 11: Hoare triple {3720#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3720#true} is VALID [2022-04-07 15:27:43,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 15:27:43,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 15:27:43,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 15:27:43,849 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3720#true} {3720#true} #55#return; {3720#true} is VALID [2022-04-07 15:27:43,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {3720#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3773#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:43,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {3773#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3773#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:43,850 INFO L272 TraceCheckUtils]: 18: Hoare triple {3773#(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)); {3720#true} is VALID [2022-04-07 15:27:43,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 15:27:43,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 15:27:43,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 15:27:43,850 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3720#true} {3773#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3773#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:43,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {3773#(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; {3795#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:27:43,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {3795#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {3795#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:27:43,851 INFO L272 TraceCheckUtils]: 25: Hoare triple {3795#(and (= main_~y~0 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)); {3720#true} is VALID [2022-04-07 15:27:43,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 15:27:43,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 15:27:43,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 15:27:43,852 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3720#true} {3795#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {3795#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-07 15:27:43,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {3795#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3817#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-07 15:27:43,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {3817#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {3817#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-07 15:27:43,853 INFO L272 TraceCheckUtils]: 32: Hoare triple {3817#(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)); {3720#true} is VALID [2022-04-07 15:27:43,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 15:27:43,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 15:27:43,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 15:27:43,853 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3720#true} {3817#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {3817#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-07 15:27:43,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {3817#(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; {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:27:43,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:27:43,854 INFO L272 TraceCheckUtils]: 39: Hoare triple {3839#(and (= main_~y~0 3) (= (+ (- 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)); {3720#true} is VALID [2022-04-07 15:27:43,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 15:27:43,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 15:27:43,854 INFO L290 TraceCheckUtils]: 42: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 15:27:43,855 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3720#true} {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-07 15:27:43,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:43,856 INFO L290 TraceCheckUtils]: 45: Hoare triple {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:43,856 INFO L272 TraceCheckUtils]: 46: Hoare triple {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3720#true} is VALID [2022-04-07 15:27:43,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 15:27:43,856 INFO L290 TraceCheckUtils]: 48: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 15:27:43,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 15:27:43,858 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3720#true} {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 15:27:43,859 INFO L290 TraceCheckUtils]: 51: Hoare triple {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-07 15:27:43,859 INFO L290 TraceCheckUtils]: 52: Hoare triple {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-07 15:27:43,859 INFO L272 TraceCheckUtils]: 53: Hoare triple {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3720#true} is VALID [2022-04-07 15:27:43,859 INFO L290 TraceCheckUtils]: 54: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 15:27:43,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 15:27:43,860 INFO L290 TraceCheckUtils]: 56: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 15:27:43,860 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3720#true} {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #57#return; {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-07 15:27:43,860 INFO L290 TraceCheckUtils]: 58: Hoare triple {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3905#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-07 15:27:43,861 INFO L290 TraceCheckUtils]: 59: Hoare triple {3905#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {3905#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-07 15:27:43,861 INFO L272 TraceCheckUtils]: 60: Hoare triple {3905#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3720#true} is VALID [2022-04-07 15:27:43,861 INFO L290 TraceCheckUtils]: 61: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 15:27:43,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 15:27:43,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 15:27:43,861 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3720#true} {3905#(and (= main_~y~0 6) (= main_~c~0 6))} #57#return; {3905#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-07 15:27:43,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {3905#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-07 15:27:43,862 INFO L290 TraceCheckUtils]: 66: Hoare triple {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-07 15:27:43,862 INFO L272 TraceCheckUtils]: 67: Hoare triple {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3720#true} is VALID [2022-04-07 15:27:43,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 15:27:43,862 INFO L290 TraceCheckUtils]: 69: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 15:27:43,862 INFO L290 TraceCheckUtils]: 70: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 15:27:43,863 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3720#true} {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-07 15:27:43,863 INFO L290 TraceCheckUtils]: 72: Hoare triple {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3949#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-07 15:27:43,864 INFO L272 TraceCheckUtils]: 73: Hoare triple {3949#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3720#true} is VALID [2022-04-07 15:27:43,864 INFO L290 TraceCheckUtils]: 74: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 15:27:43,864 INFO L290 TraceCheckUtils]: 75: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 15:27:43,864 INFO L290 TraceCheckUtils]: 76: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 15:27:43,864 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3720#true} {3949#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #59#return; {3949#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-07 15:27:43,865 INFO L272 TraceCheckUtils]: 78: Hoare triple {3949#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3968#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:27:43,865 INFO L290 TraceCheckUtils]: 79: Hoare triple {3968#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3972#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:43,866 INFO L290 TraceCheckUtils]: 80: Hoare triple {3972#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3721#false} is VALID [2022-04-07 15:27:43,866 INFO L290 TraceCheckUtils]: 81: Hoare triple {3721#false} assume !false; {3721#false} is VALID [2022-04-07 15:27:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-07 15:27:43,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:27:44,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:44,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852843757] [2022-04-07 15:27:44,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:44,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126717978] [2022-04-07 15:27:44,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126717978] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:27:44,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:27:44,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-07 15:27:44,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101637596] [2022-04-07 15:27:44,158 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:27:44,159 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-07 15:27:44,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:44,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-07 15:27:44,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:27:44,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 15:27:44,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:44,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 15:27:44,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-07 15:27:44,202 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-07 15:27:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:44,962 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-07 15:27:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 15:27:44,962 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-07 15:27:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-07 15:27:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-07 15:27:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-07 15:27:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-07 15:27:44,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-07 15:27:45,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:27:45,024 INFO L225 Difference]: With dead ends: 60 [2022-04-07 15:27:45,024 INFO L226 Difference]: Without dead ends: 54 [2022-04-07 15:27:45,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-07 15:27:45,025 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 15:27:45,025 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 15:27:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-07 15:27:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-07 15:27:45,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:45,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 15:27:45,059 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 15:27:45,059 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 15:27:45,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:45,061 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-07 15:27:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-07 15:27:45,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:45,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:45,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-07 15:27:45,062 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-07 15:27:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:45,064 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-07 15:27:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-07 15:27:45,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:45,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:45,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:45,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:45,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 15:27:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-07 15:27:45,066 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-07 15:27:45,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:45,066 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-07 15:27:45,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-07 15:27:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-07 15:27:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-07 15:27:45,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:45,067 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:27:45,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-07 15:27:45,273 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-07 15:27:45,273 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 8 times [2022-04-07 15:27:45,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:45,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210632691] [2022-04-07 15:27:45,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:45,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:45,290 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:45,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1349751931] [2022-04-07 15:27:45,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:27:45,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:45,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:45,291 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:27:45,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-07 15:27:53,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:27:53,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:27:53,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-07 15:27:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:27:53,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:27:54,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {4324#true} call ULTIMATE.init(); {4324#true} is VALID [2022-04-07 15:27:54,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {4324#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); {4324#true} is VALID [2022-04-07 15:27:54,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4324#true} {4324#true} #63#return; {4324#true} is VALID [2022-04-07 15:27:54,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {4324#true} call #t~ret5 := main(); {4324#true} is VALID [2022-04-07 15:27:54,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {4324#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; {4324#true} is VALID [2022-04-07 15:27:54,187 INFO L272 TraceCheckUtils]: 6: Hoare triple {4324#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {4324#true} is VALID [2022-04-07 15:27:54,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-07 15:27:54,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-07 15:27:54,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,187 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4324#true} {4324#true} #53#return; {4324#true} is VALID [2022-04-07 15:27:54,187 INFO L272 TraceCheckUtils]: 11: Hoare triple {4324#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4324#true} is VALID [2022-04-07 15:27:54,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-07 15:27:54,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-07 15:27:54,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,187 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4324#true} {4324#true} #55#return; {4324#true} is VALID [2022-04-07 15:27:54,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {4324#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4377#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:54,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {4377#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4377#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:54,188 INFO L272 TraceCheckUtils]: 18: Hoare triple {4377#(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)); {4324#true} is VALID [2022-04-07 15:27:54,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-07 15:27:54,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-07 15:27:54,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,189 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4324#true} {4377#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4377#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-07 15:27:54,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {4377#(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; {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:27:54,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:27:54,190 INFO L272 TraceCheckUtils]: 25: Hoare triple {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4324#true} is VALID [2022-04-07 15:27:54,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-07 15:27:54,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-07 15:27:54,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,190 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4324#true} {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-07 15:27:54,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:27:54,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:27:54,191 INFO L272 TraceCheckUtils]: 32: Hoare triple {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4324#true} is VALID [2022-04-07 15:27:54,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-07 15:27:54,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-07 15:27:54,191 INFO L290 TraceCheckUtils]: 35: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,192 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4324#true} {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #57#return; {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-07 15:27:54,192 INFO L290 TraceCheckUtils]: 37: Hoare triple {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4443#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:27:54,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {4443#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4443#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:27:54,192 INFO L272 TraceCheckUtils]: 39: Hoare triple {4443#(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)); {4324#true} is VALID [2022-04-07 15:27:54,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-07 15:27:54,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-07 15:27:54,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,193 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4324#true} {4443#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {4443#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-07 15:27:54,193 INFO L290 TraceCheckUtils]: 44: Hoare triple {4443#(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; {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-07 15:27:54,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-07 15:27:54,194 INFO L272 TraceCheckUtils]: 46: Hoare triple {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4324#true} is VALID [2022-04-07 15:27:54,194 INFO L290 TraceCheckUtils]: 47: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-07 15:27:54,194 INFO L290 TraceCheckUtils]: 48: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-07 15:27:54,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,195 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4324#true} {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #57#return; {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-07 15:27:54,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:27:54,195 INFO L290 TraceCheckUtils]: 52: Hoare triple {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:27:54,195 INFO L272 TraceCheckUtils]: 53: Hoare triple {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4324#true} is VALID [2022-04-07 15:27:54,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-07 15:27:54,196 INFO L290 TraceCheckUtils]: 55: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-07 15:27:54,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,196 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4324#true} {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #57#return; {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-07 15:27:54,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-07 15:27:54,197 INFO L290 TraceCheckUtils]: 59: Hoare triple {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-07 15:27:54,197 INFO L272 TraceCheckUtils]: 60: Hoare triple {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 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)); {4324#true} is VALID [2022-04-07 15:27:54,197 INFO L290 TraceCheckUtils]: 61: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-07 15:27:54,197 INFO L290 TraceCheckUtils]: 62: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-07 15:27:54,197 INFO L290 TraceCheckUtils]: 63: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,197 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4324#true} {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #57#return; {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-07 15:27:54,198 INFO L290 TraceCheckUtils]: 65: Hoare triple {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:27:54,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:27:54,198 INFO L272 TraceCheckUtils]: 67: Hoare triple {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4324#true} is VALID [2022-04-07 15:27:54,198 INFO L290 TraceCheckUtils]: 68: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-07 15:27:54,198 INFO L290 TraceCheckUtils]: 69: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-07 15:27:54,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,199 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4324#true} {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} #57#return; {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-07 15:27:54,199 INFO L290 TraceCheckUtils]: 72: Hoare triple {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-07 15:27:54,200 INFO L290 TraceCheckUtils]: 73: Hoare triple {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-07 15:27:54,200 INFO L272 TraceCheckUtils]: 74: Hoare triple {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4324#true} is VALID [2022-04-07 15:27:54,200 INFO L290 TraceCheckUtils]: 75: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-07 15:27:54,200 INFO L290 TraceCheckUtils]: 76: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-07 15:27:54,200 INFO L290 TraceCheckUtils]: 77: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,200 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4324#true} {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #57#return; {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-07 15:27:54,201 INFO L290 TraceCheckUtils]: 79: Hoare triple {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4575#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-07 15:27:54,201 INFO L272 TraceCheckUtils]: 80: Hoare triple {4575#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4324#true} is VALID [2022-04-07 15:27:54,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-07 15:27:54,201 INFO L290 TraceCheckUtils]: 82: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-07 15:27:54,201 INFO L290 TraceCheckUtils]: 83: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-07 15:27:54,202 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4324#true} {4575#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #59#return; {4575#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-07 15:27:54,202 INFO L272 TraceCheckUtils]: 85: Hoare triple {4575#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:27:54,202 INFO L290 TraceCheckUtils]: 86: Hoare triple {4594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:27:54,203 INFO L290 TraceCheckUtils]: 87: Hoare triple {4598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4325#false} is VALID [2022-04-07 15:27:54,203 INFO L290 TraceCheckUtils]: 88: Hoare triple {4325#false} assume !false; {4325#false} is VALID [2022-04-07 15:27:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-07 15:27:54,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:27:54,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:27:54,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210632691] [2022-04-07 15:27:54,517 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:27:54,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349751931] [2022-04-07 15:27:54,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349751931] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:27:54,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:27:54,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-07 15:27:54,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440435676] [2022-04-07 15:27:54,518 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:27:54,518 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-07 15:27:54,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:27:54,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-07 15:27:54,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:27:54,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 15:27:54,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:27:54,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 15:27:54,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-07 15:27:54,562 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-07 15:27:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:55,508 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-07 15:27:55,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 15:27:55,509 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-07 15:27:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:27:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-07 15:27:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-07 15:27:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-07 15:27:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-07 15:27:55,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-07 15:27:55,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:27:55,575 INFO L225 Difference]: With dead ends: 63 [2022-04-07 15:27:55,575 INFO L226 Difference]: Without dead ends: 57 [2022-04-07 15:27:55,575 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-07 15:27:55,576 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 15:27:55,576 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 15:27:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-07 15:27:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-07 15:27:55,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:27:55,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 15:27:55,602 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 15:27:55,603 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 15:27:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:55,604 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-07 15:27:55,604 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-07 15:27:55,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:55,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:55,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-07 15:27:55,605 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-07 15:27:55,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:27:55,607 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-07 15:27:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-07 15:27:55,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:27:55,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:27:55,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:27:55,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:27:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 15:27:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-07 15:27:55,610 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-07 15:27:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:27:55,610 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-07 15:27:55,610 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-07 15:27:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-07 15:27:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-07 15:27:55,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:27:55,611 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:27:55,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-07 15:27:55,819 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-07 15:27:55,820 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:27:55,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:27:55,820 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 9 times [2022-04-07 15:27:55,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:27:55,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921828841] [2022-04-07 15:27:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:27:55,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:27:55,841 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:27:55,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [212510819] [2022-04-07 15:27:55,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 15:27:55,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:27:55,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:27:55,850 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:27:55,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process