/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_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:39:00,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:39:00,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:39:00,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:39:00,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:39:00,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:39:00,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:39:00,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:39:00,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:39:00,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:39:00,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:39:00,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:39:00,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:39:00,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:39:00,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:39:00,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:39:00,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:39:00,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:39:00,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:39:00,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:39:00,629 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:39:00,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:39:00,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:39:00,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:39:00,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:39:00,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:39:00,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:39:00,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:39:00,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:39:00,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:39:00,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:39:00,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:39:00,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:39:00,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:39:00,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:39:00,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:39:00,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:39:00,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:39:00,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:39:00,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:39:00,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:39:00,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:39:00,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:39:00,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:39:00,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:39:00,661 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:39:00,661 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:39:00,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:39:00,662 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:39:00,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:39:00,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:39:00,663 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:39:00,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:39:00,663 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:39:00,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:39:00,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:39:00,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:39:00,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:39:00,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:39:00,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:39:00,664 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:39:00,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:39:00,664 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:39:00,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:39:00,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:39:00,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:39:00,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:39:00,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:39:00,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:39:00,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:39:00,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:39:00,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:39:00,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:39:00,666 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:39:00,666 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:39:00,666 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:39:00,666 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 14:39:00,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:39:00,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:39:00,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:39:00,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:39:00,915 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:39:00,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound100.c [2022-04-27 14:39:00,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fd2b65e9/5216cdeece274bd2abf5695fb5051880/FLAG8edfce66a [2022-04-27 14:39:01,329 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:39:01,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound100.c [2022-04-27 14:39:01,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fd2b65e9/5216cdeece274bd2abf5695fb5051880/FLAG8edfce66a [2022-04-27 14:39:01,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fd2b65e9/5216cdeece274bd2abf5695fb5051880 [2022-04-27 14:39:01,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:39:01,354 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:39:01,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:39:01,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:39:01,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:39:01,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:39:01" (1/1) ... [2022-04-27 14:39:01,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d441feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:01, skipping insertion in model container [2022-04-27 14:39:01,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:39:01" (1/1) ... [2022-04-27 14:39:01,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:39:01,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:39:01,480 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_unwindbound100.c[458,471] [2022-04-27 14:39:01,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:39:01,511 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:39:01,521 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_unwindbound100.c[458,471] [2022-04-27 14:39:01,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:39:01,541 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:39:01,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:01 WrapperNode [2022-04-27 14:39:01,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:39:01,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:39:01,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:39:01,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:39:01,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:01" (1/1) ... [2022-04-27 14:39:01,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:01" (1/1) ... [2022-04-27 14:39:01,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:01" (1/1) ... [2022-04-27 14:39:01,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:01" (1/1) ... [2022-04-27 14:39:01,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:01" (1/1) ... [2022-04-27 14:39:01,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:01" (1/1) ... [2022-04-27 14:39:01,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:01" (1/1) ... [2022-04-27 14:39:01,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:39:01,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:39:01,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:39:01,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:39:01,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:01" (1/1) ... [2022-04-27 14:39:01,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:39:01,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:01,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 14:39:01,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 14:39:01,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:39:01,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:39:01,644 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:39:01,644 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:39:01,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:39:01,646 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:39:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:39:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:39:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:39:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:39:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:39:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:39:01,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:39:01,647 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:39:01,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:39:01,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:39:01,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:39:01,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:39:01,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:39:01,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:39:01,705 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:39:01,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:39:01,833 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:39:01,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:39:01,839 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:39:01,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:39:01 BoogieIcfgContainer [2022-04-27 14:39:01,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:39:01,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:39:01,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:39:01,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:39:01,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:39:01" (1/3) ... [2022-04-27 14:39:01,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9f9074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:39:01, skipping insertion in model container [2022-04-27 14:39:01,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:39:01" (2/3) ... [2022-04-27 14:39:01,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9f9074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:39:01, skipping insertion in model container [2022-04-27 14:39:01,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:39:01" (3/3) ... [2022-04-27 14:39:01,848 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound100.c [2022-04-27 14:39:01,859 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:39:01,875 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:39:01,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:39:01,963 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15158f74, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@541aafec [2022-04-27 14:39:01,964 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:39:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:39:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:39:01,987 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:01,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:01,988 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:01,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:01,998 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-27 14:39:02,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:02,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773269968] [2022-04-27 14:39:02,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:02,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:02,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:39:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:02,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-27 14:39:02,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:39:02,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-27 14:39:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:39:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:02,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:39:02,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:39:02,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:39:02,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:39:02,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:39:02,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-27 14:39:02,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:39:02,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-27 14:39:02,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-27 14:39:02,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-27 14:39:02,241 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-27 14:39:02,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:39:02,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:39:02,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:39:02,242 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:39:02,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-27 14:39:02,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-27 14:39:02,243 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-27 14:39:02,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 14:39:02,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 14:39:02,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 14:39:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:39:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:02,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773269968] [2022-04-27 14:39:02,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773269968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:39:02,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:39:02,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:39:02,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284874613] [2022-04-27 14:39:02,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:39:02,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:39:02,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:02,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:02,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:02,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:39:02,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:02,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:39:02,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:39:02,316 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:02,464 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-27 14:39:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:39:02,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:39:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-27 14:39:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-27 14:39:02,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-27 14:39:02,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:02,563 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:39:02,564 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 14:39:02,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:39:02,568 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:02,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:39:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 14:39:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-27 14:39:02,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:02,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:02,594 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:02,595 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:02,598 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 14:39:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 14:39:02,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:02,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:02,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 14:39:02,599 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 14:39:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:02,602 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 14:39:02,602 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 14:39:02,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:02,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:02,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:02,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 14:39:02,606 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-27 14:39:02,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:02,607 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 14:39:02,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:39:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 14:39:02,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:02,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:02,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:39:02,608 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:02,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:02,609 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-27 14:39:02,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:02,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85647806] [2022-04-27 14:39:02,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:02,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:02,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605961663] [2022-04-27 14:39:02,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:02,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:02,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:02,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:39:02,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 14:39:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:02,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:39:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:02,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:02,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 14:39:02,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:02,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#(<= ~counter~0 0)} assume true; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:02,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#(<= ~counter~0 0)} {196#true} #61#return; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:02,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#(<= ~counter~0 0)} call #t~ret6 := main(); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:02,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:02,834 INFO L272 TraceCheckUtils]: 6: Hoare triple {204#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:02,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#(<= ~counter~0 0)} ~cond := #in~cond; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:02,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(<= ~counter~0 0)} assume !(0 == ~cond); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:02,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#(<= ~counter~0 0)} assume true; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:02,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204#(<= ~counter~0 0)} {204#(<= ~counter~0 0)} #53#return; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:02,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:02,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {204#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {238#(<= |main_#t~post5| 0)} is VALID [2022-04-27 14:39:02,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {197#false} is VALID [2022-04-27 14:39:02,839 INFO L272 TraceCheckUtils]: 14: Hoare triple {197#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)); {197#false} is VALID [2022-04-27 14:39:02,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 14:39:02,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 14:39:02,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 14:39:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:39:02,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:39:02,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:02,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85647806] [2022-04-27 14:39:02,840 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:02,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605961663] [2022-04-27 14:39:02,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605961663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:39:02,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:39:02,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:39:02,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605938827] [2022-04-27 14:39:02,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:39:02,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 14:39:02,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:02,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:39:02,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:02,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:39:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:02,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:39:02,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:39:02,860 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:39:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:02,923 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:39:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:39:02,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 14:39:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:39:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:39:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:39:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:39:02,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 14:39:02,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:02,963 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:39:02,964 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:39:02,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:39:02,965 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:02,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:39:02,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:39:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:39:02,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:02,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:02,973 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:02,974 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:02,975 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:39:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:39:02,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:02,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:02,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:39:02,977 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:39:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:02,979 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:39:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:39:02,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:02,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:02,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:02,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:39:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 14:39:02,981 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-27 14:39:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:02,981 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 14:39:02,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:39:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:39:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 14:39:02,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:02,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:03,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 14:39:03,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:03,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:03,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-27 14:39:03,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:03,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777950625] [2022-04-27 14:39:03,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:03,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:03,207 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:03,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672971483] [2022-04-27 14:39:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:03,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:03,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:03,209 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:39:03,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 14:39:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:03,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:39:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:03,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:03,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2022-04-27 14:39:03,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {392#true} is VALID [2022-04-27 14:39:03,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {392#true} assume true; {392#true} is VALID [2022-04-27 14:39:03,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {392#true} {392#true} #61#return; {392#true} is VALID [2022-04-27 14:39:03,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {392#true} call #t~ret6 := main(); {392#true} is VALID [2022-04-27 14:39:03,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {392#true} is VALID [2022-04-27 14:39:03,397 INFO L272 TraceCheckUtils]: 6: Hoare triple {392#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {392#true} is VALID [2022-04-27 14:39:03,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2022-04-27 14:39:03,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2022-04-27 14:39:03,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#true} assume true; {392#true} is VALID [2022-04-27 14:39:03,400 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {392#true} {392#true} #53#return; {392#true} is VALID [2022-04-27 14:39:03,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {392#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:03,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:03,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:03,403 INFO L272 TraceCheckUtils]: 14: Hoare triple {430#(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)); {440#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:03,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {444#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:03,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {444#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {393#false} is VALID [2022-04-27 14:39:03,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#false} assume !false; {393#false} is VALID [2022-04-27 14:39:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:39:03,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:39:03,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:03,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777950625] [2022-04-27 14:39:03,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:03,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672971483] [2022-04-27 14:39:03,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672971483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:39:03,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:39:03,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:39:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441695708] [2022-04-27 14:39:03,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:39:03,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 14:39:03,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:03,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:03,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:03,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:39:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:39:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:39:03,437 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:03,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:03,593 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:39:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:39:03,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 14:39:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 14:39:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 14:39:03,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-27 14:39:03,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:03,702 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:39:03,702 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 14:39:03,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:39:03,704 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:03,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:39:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 14:39:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 14:39:03,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:03,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:39:03,713 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:39:03,713 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:39:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:03,715 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 14:39:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:39:03,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:03,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:03,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 14:39:03,716 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 14:39:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:03,718 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 14:39:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:39:03,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:03,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:03,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:03,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:39:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-27 14:39:03,721 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-27 14:39:03,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:03,721 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-27 14:39:03,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:39:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:39:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:39:03,722 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:03,723 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:03,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:39:03,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:39:03,944 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:03,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-27 14:39:03,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:03,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059982397] [2022-04-27 14:39:03,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:03,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:03,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:03,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51903363] [2022-04-27 14:39:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:03,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:03,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:03,963 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:39:03,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 14:39:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:04,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:39:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:04,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:04,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2022-04-27 14:39:04,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:04,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#(<= ~counter~0 0)} assume true; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:04,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#(<= ~counter~0 0)} {614#true} #61#return; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:04,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#(<= ~counter~0 0)} call #t~ret6 := main(); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:04,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:04,165 INFO L272 TraceCheckUtils]: 6: Hoare triple {622#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:04,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {622#(<= ~counter~0 0)} ~cond := #in~cond; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:04,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {622#(<= ~counter~0 0)} assume !(0 == ~cond); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:04,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {622#(<= ~counter~0 0)} assume true; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:04,167 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {622#(<= ~counter~0 0)} {622#(<= ~counter~0 0)} #53#return; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:04,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {622#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:04,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {622#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:04,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:04,169 INFO L272 TraceCheckUtils]: 14: Hoare triple {656#(<= ~counter~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)); {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:04,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {656#(<= ~counter~0 1)} ~cond := #in~cond; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:04,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= ~counter~0 1)} assume !(0 == ~cond); {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:04,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {656#(<= ~counter~0 1)} assume true; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:04,171 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {656#(<= ~counter~0 1)} {656#(<= ~counter~0 1)} #55#return; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:04,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:04,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {681#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:39:04,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {615#false} is VALID [2022-04-27 14:39:04,173 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#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)); {615#false} is VALID [2022-04-27 14:39:04,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-27 14:39:04,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-27 14:39:04,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-27 14:39:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:39:04,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:04,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-27 14:39:04,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-27 14:39:04,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-27 14:39:04,339 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#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)); {615#false} is VALID [2022-04-27 14:39:04,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {709#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {615#false} is VALID [2022-04-27 14:39:04,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {713#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {709#(< |main_#t~post5| 100)} is VALID [2022-04-27 14:39:04,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {713#(< ~counter~0 100)} 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; {713#(< ~counter~0 100)} is VALID [2022-04-27 14:39:04,341 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {614#true} {713#(< ~counter~0 100)} #55#return; {713#(< ~counter~0 100)} is VALID [2022-04-27 14:39:04,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-27 14:39:04,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2022-04-27 14:39:04,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-04-27 14:39:04,343 INFO L272 TraceCheckUtils]: 14: Hoare triple {713#(< ~counter~0 100)} 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)); {614#true} is VALID [2022-04-27 14:39:04,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {713#(< ~counter~0 100)} is VALID [2022-04-27 14:39:04,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {738#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {713#(< ~counter~0 100)} is VALID [2022-04-27 14:39:04,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {738#(< ~counter~0 99)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {738#(< ~counter~0 99)} is VALID [2022-04-27 14:39:04,345 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {614#true} {738#(< ~counter~0 99)} #53#return; {738#(< ~counter~0 99)} is VALID [2022-04-27 14:39:04,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-27 14:39:04,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2022-04-27 14:39:04,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-04-27 14:39:04,345 INFO L272 TraceCheckUtils]: 6: Hoare triple {738#(< ~counter~0 99)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {614#true} is VALID [2022-04-27 14:39:04,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#(< ~counter~0 99)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {738#(< ~counter~0 99)} is VALID [2022-04-27 14:39:04,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#(< ~counter~0 99)} call #t~ret6 := main(); {738#(< ~counter~0 99)} is VALID [2022-04-27 14:39:04,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#(< ~counter~0 99)} {614#true} #61#return; {738#(< ~counter~0 99)} is VALID [2022-04-27 14:39:04,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#(< ~counter~0 99)} assume true; {738#(< ~counter~0 99)} is VALID [2022-04-27 14:39:04,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {738#(< ~counter~0 99)} is VALID [2022-04-27 14:39:04,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2022-04-27 14:39:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:39:04,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:04,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059982397] [2022-04-27 14:39:04,351 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:04,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51903363] [2022-04-27 14:39:04,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51903363] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:39:04,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:39:04,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:39:04,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813311318] [2022-04-27 14:39:04,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:04,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-27 14:39:04,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:04,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:04,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:04,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:39:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:39:04,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:39:04,391 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:04,597 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-27 14:39:04,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:39:04,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-27 14:39:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-27 14:39:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-27 14:39:04,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 76 transitions. [2022-04-27 14:39:04,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:04,686 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:39:04,687 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:39:04,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:39:04,688 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:04,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:39:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:39:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-04-27 14:39:04,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:04,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:04,704 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:04,704 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:04,707 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 14:39:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 14:39:04,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:04,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:04,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-27 14:39:04,709 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-27 14:39:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:04,711 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 14:39:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 14:39:04,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:04,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:04,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:04,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-27 14:39:04,716 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 26 [2022-04-27 14:39:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:04,716 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-27 14:39:04,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:39:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:39:04,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:04,718 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:04,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 14:39:04,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:04,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:04,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-27 14:39:04,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:04,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677740631] [2022-04-27 14:39:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:04,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:04,945 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:04,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150854153] [2022-04-27 14:39:04,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:04,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:04,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:04,950 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:39:04,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 14:39:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:05,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:39:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:05,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:05,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-27 14:39:05,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1072#true} is VALID [2022-04-27 14:39:05,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:39:05,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #61#return; {1072#true} is VALID [2022-04-27 14:39:05,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret6 := main(); {1072#true} is VALID [2022-04-27 14:39:05,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1072#true} is VALID [2022-04-27 14:39:05,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:39:05,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:39:05,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:39:05,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:39:05,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} #53#return; {1072#true} is VALID [2022-04-27 14:39:05,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:05,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:05,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:05,172 INFO L272 TraceCheckUtils]: 14: Hoare triple {1110#(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)); {1072#true} is VALID [2022-04-27 14:39:05,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:39:05,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:39:05,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:39:05,173 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1110#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:05,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 14:39:05,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 14:39:05,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 14:39:05,176 INFO L272 TraceCheckUtils]: 22: Hoare triple {1135#(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)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:05,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:05,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1073#false} is VALID [2022-04-27 14:39:05,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-27 14:39:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:39:05,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:05,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-27 14:39:05,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1073#false} is VALID [2022-04-27 14:39:05,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:05,315 INFO L272 TraceCheckUtils]: 22: Hoare triple {1165#(= (+ 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)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:05,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#(= (+ 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 !!(#t~post5 < 100);havoc #t~post5; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:39:05,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#(= (+ 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)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:39:07,339 WARN L290 TraceCheckUtils]: 19: Hoare triple {1165#(= (+ 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; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-27 14:39:07,342 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1165#(= (+ 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)))} #55#return; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:39:07,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:39:07,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:39:07,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:39:07,342 INFO L272 TraceCheckUtils]: 14: Hoare triple {1165#(= (+ 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)); {1072#true} is VALID [2022-04-27 14:39:07,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {1165#(= (+ 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 !!(#t~post5 < 100);havoc #t~post5; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:39:07,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(= (+ 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)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:39:07,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 14:39:07,355 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} #53#return; {1072#true} is VALID [2022-04-27 14:39:07,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:39:07,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:39:07,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:39:07,356 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:39:07,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1072#true} is VALID [2022-04-27 14:39:07,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret6 := main(); {1072#true} is VALID [2022-04-27 14:39:07,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #61#return; {1072#true} is VALID [2022-04-27 14:39:07,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:39:07,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1072#true} is VALID [2022-04-27 14:39:07,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-27 14:39:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 14:39:07,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:07,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677740631] [2022-04-27 14:39:07,357 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:07,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150854153] [2022-04-27 14:39:07,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150854153] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:07,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:07,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:39:07,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622773339] [2022-04-27 14:39:07,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:39:07,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 14:39:07,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:07,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:39:10,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:10,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:39:10,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:10,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:39:10,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:39:10,149 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:39:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:10,291 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-27 14:39:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:39:10,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 14:39:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:39:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:39:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:39:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:39:10,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:39:10,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:10,748 INFO L225 Difference]: With dead ends: 68 [2022-04-27 14:39:10,748 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 14:39:10,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:39:10,750 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:10,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:39:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 14:39:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-27 14:39:10,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:10,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:10,775 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:10,776 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:10,778 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 14:39:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-27 14:39:10,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:10,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:10,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-27 14:39:10,780 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-27 14:39:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:10,782 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 14:39:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-27 14:39:10,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:10,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:10,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:10,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:39:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-04-27 14:39:10,785 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 26 [2022-04-27 14:39:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:10,786 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-04-27 14:39:10,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:39:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-27 14:39:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:39:10,787 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:10,787 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:10,792 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-27 14:39:10,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:10,992 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:10,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-27 14:39:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:10,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679471896] [2022-04-27 14:39:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:10,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:11,016 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:11,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005442130] [2022-04-27 14:39:11,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:11,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:11,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:11,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:39:11,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 14:39:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:11,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:39:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:11,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:11,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1530#true} is VALID [2022-04-27 14:39:11,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1530#true} is VALID [2022-04-27 14:39:11,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:39:11,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1530#true} {1530#true} #61#return; {1530#true} is VALID [2022-04-27 14:39:11,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {1530#true} call #t~ret6 := main(); {1530#true} is VALID [2022-04-27 14:39:11,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {1530#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1530#true} is VALID [2022-04-27 14:39:11,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {1530#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1530#true} is VALID [2022-04-27 14:39:11,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:39:11,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:39:11,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:39:11,418 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1530#true} {1530#true} #53#return; {1530#true} is VALID [2022-04-27 14:39:11,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {1530#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:11,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:11,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:11,419 INFO L272 TraceCheckUtils]: 14: Hoare triple {1568#(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)); {1530#true} is VALID [2022-04-27 14:39:11,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:39:11,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:39:11,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:39:11,421 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1530#true} {1568#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:11,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:39:11,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:39:11,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:39:11,422 INFO L272 TraceCheckUtils]: 22: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 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)); {1530#true} is VALID [2022-04-27 14:39:11,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:39:11,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:39:11,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:39:11,423 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1530#true} {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:39:11,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:39:11,424 INFO L272 TraceCheckUtils]: 28: Hoare triple {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 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)); {1530#true} is VALID [2022-04-27 14:39:11,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:39:11,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:39:11,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:39:11,425 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1530#true} {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:39:11,425 INFO L272 TraceCheckUtils]: 33: Hoare triple {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:11,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:11,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {1641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1531#false} is VALID [2022-04-27 14:39:11,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2022-04-27 14:39:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:39:11,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:11,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:11,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679471896] [2022-04-27 14:39:11,757 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:11,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005442130] [2022-04-27 14:39:11,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005442130] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:11,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:11,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:39:11,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966540023] [2022-04-27 14:39:11,758 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:11,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:39:11,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:11,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:39:11,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:11,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:39:11,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:11,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:39:11,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:39:11,791 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:39:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:12,040 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-27 14:39:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:39:12,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:39:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:39:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 14:39:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:39:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 14:39:12,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-27 14:39:12,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:12,077 INFO L225 Difference]: With dead ends: 59 [2022-04-27 14:39:12,077 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 14:39:12,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:39:12,078 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:12,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:39:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 14:39:12,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-27 14:39:12,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:12,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:39:12,104 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:39:12,105 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:39:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:12,107 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 14:39:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:39:12,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:12,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:12,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 14:39:12,108 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 14:39:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:12,110 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 14:39:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:39:12,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:12,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:12,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:12,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:39:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-27 14:39:12,112 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 37 [2022-04-27 14:39:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:12,113 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-27 14:39:12,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:39:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:39:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 14:39:12,114 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:12,114 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:12,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 14:39:12,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:12,340 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 2 times [2022-04-27 14:39:12,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:12,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55599083] [2022-04-27 14:39:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:12,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:12,362 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:12,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338847745] [2022-04-27 14:39:12,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:39:12,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:12,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:12,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:39:12,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 14:39:12,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:39:12,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:39:12,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:39:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:12,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:12,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} call ULTIMATE.init(); {1978#true} is VALID [2022-04-27 14:39:12,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1978#true} is VALID [2022-04-27 14:39:12,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:39:12,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} #61#return; {1978#true} is VALID [2022-04-27 14:39:12,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} call #t~ret6 := main(); {1978#true} is VALID [2022-04-27 14:39:12,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1978#true} is VALID [2022-04-27 14:39:12,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {1978#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:39:12,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:39:12,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:39:12,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:39:12,866 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1978#true} {1978#true} #53#return; {1978#true} is VALID [2022-04-27 14:39:12,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {1978#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:12,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:12,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:12,868 INFO L272 TraceCheckUtils]: 14: Hoare triple {2016#(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)); {1978#true} is VALID [2022-04-27 14:39:12,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:39:12,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:39:12,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:39:12,868 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1978#true} {2016#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:12,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:12,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:12,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:12,870 INFO L272 TraceCheckUtils]: 22: Hoare triple {2041#(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)); {1978#true} is VALID [2022-04-27 14:39:12,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:39:12,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:39:12,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:39:12,872 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1978#true} {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:12,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:39:12,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:39:12,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:39:12,873 INFO L272 TraceCheckUtils]: 30: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 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)); {1978#true} is VALID [2022-04-27 14:39:12,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:39:12,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:39:12,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:39:12,874 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1978#true} {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #55#return; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:39:12,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:39:12,875 INFO L272 TraceCheckUtils]: 36: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 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)); {1978#true} is VALID [2022-04-27 14:39:12,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:39:12,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:39:12,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:39:12,880 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1978#true} {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} #57#return; {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:39:12,881 INFO L272 TraceCheckUtils]: 41: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:12,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2114#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:12,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {2114#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1979#false} is VALID [2022-04-27 14:39:12,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {1979#false} assume !false; {1979#false} is VALID [2022-04-27 14:39:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:39:12,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:13,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:13,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55599083] [2022-04-27 14:39:13,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:13,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338847745] [2022-04-27 14:39:13,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338847745] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:13,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:13,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:39:13,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096478973] [2022-04-27 14:39:13,220 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:13,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-27 14:39:13,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:13,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:13,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:13,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:39:13,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:13,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:39:13,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:39:13,254 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:13,600 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-27 14:39:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:39:13,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-27 14:39:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-27 14:39:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-27 14:39:13,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-27 14:39:13,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:13,648 INFO L225 Difference]: With dead ends: 58 [2022-04-27 14:39:13,648 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:39:13,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:39:13,650 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:13,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:39:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:39:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 14:39:13,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:13,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:39:13,675 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:39:13,675 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:39:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:13,677 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:39:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:39:13,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:13,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:13,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 14:39:13,678 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 14:39:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:13,679 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:39:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:39:13,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:13,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:13,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:13,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:39:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-27 14:39:13,682 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2022-04-27 14:39:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:13,682 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-27 14:39:13,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:39:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:39:13,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 14:39:13,683 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:13,683 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:13,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 14:39:13,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:13,888 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:13,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:13,889 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 3 times [2022-04-27 14:39:13,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:13,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048282185] [2022-04-27 14:39:13,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:13,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:13,911 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:13,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165974725] [2022-04-27 14:39:13,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:39:13,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:13,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:13,914 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:39:13,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 14:39:26,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:39:26,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:39:26,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:39:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:26,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:26,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2022-04-27 14:39:26,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {2445#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2445#true} is VALID [2022-04-27 14:39:26,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:39:26,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #61#return; {2445#true} is VALID [2022-04-27 14:39:26,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret6 := main(); {2445#true} is VALID [2022-04-27 14:39:26,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {2445#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2445#true} is VALID [2022-04-27 14:39:26,751 INFO L272 TraceCheckUtils]: 6: Hoare triple {2445#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2445#true} is VALID [2022-04-27 14:39:26,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:39:26,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:39:26,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:39:26,755 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2445#true} {2445#true} #53#return; {2445#true} is VALID [2022-04-27 14:39:26,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {2445#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:26,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:26,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:26,756 INFO L272 TraceCheckUtils]: 14: Hoare triple {2483#(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)); {2445#true} is VALID [2022-04-27 14:39:26,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:39:26,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:39:26,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:39:26,757 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2445#true} {2483#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:26,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:26,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:26,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:26,758 INFO L272 TraceCheckUtils]: 22: Hoare triple {2508#(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)); {2445#true} is VALID [2022-04-27 14:39:26,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:39:26,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:39:26,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:39:26,759 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2445#true} {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:39:26,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:26,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:26,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:26,761 INFO L272 TraceCheckUtils]: 30: Hoare triple {2533#(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)); {2445#true} is VALID [2022-04-27 14:39:26,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:39:26,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:39:26,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:39:26,762 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2445#true} {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #55#return; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:39:26,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {2533#(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; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:39:26,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:39:26,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:39:26,764 INFO L272 TraceCheckUtils]: 38: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~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)); {2445#true} is VALID [2022-04-27 14:39:26,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:39:26,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:39:26,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:39:26,765 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2445#true} {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #55#return; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:39:26,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:39:26,766 INFO L272 TraceCheckUtils]: 44: Hoare triple {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= 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)); {2445#true} is VALID [2022-04-27 14:39:26,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:39:26,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:39:26,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:39:26,766 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2445#true} {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} #57#return; {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:39:26,767 INFO L272 TraceCheckUtils]: 49: Hoare triple {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:26,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {2602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:26,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {2606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2446#false} is VALID [2022-04-27 14:39:26,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2022-04-27 14:39:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:39:26,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:27,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048282185] [2022-04-27 14:39:27,119 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:27,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165974725] [2022-04-27 14:39:27,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165974725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:27,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:27,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:39:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559180782] [2022-04-27 14:39:27,119 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:27,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-27 14:39:27,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:27,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:39:27,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:27,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:39:27,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:27,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:39:27,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:39:27,158 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:39:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:27,575 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-27 14:39:27,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:39:27,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-27 14:39:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:39:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-27 14:39:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:39:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-27 14:39:27,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-27 14:39:27,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:27,631 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:39:27,631 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 14:39:27,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:39:27,632 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:27,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:39:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 14:39:27,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 14:39:27,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:27,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:39:27,658 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:39:27,659 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:39:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:27,660 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-27 14:39:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-27 14:39:27,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:27,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:27,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-27 14:39:27,661 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-27 14:39:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:27,663 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-27 14:39:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-27 14:39:27,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:27,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:27,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:27,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:39:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-27 14:39:27,665 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-27 14:39:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:27,666 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-27 14:39:27,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:39:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-27 14:39:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 14:39:27,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:27,667 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:27,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 14:39:27,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:27,867 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:27,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:27,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 1 times [2022-04-27 14:39:27,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:27,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729026500] [2022-04-27 14:39:27,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:27,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:27,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:27,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746248572] [2022-04-27 14:39:27,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:27,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:27,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:27,882 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:39:27,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 14:39:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:27,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:39:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:27,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:28,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {2947#true} call ULTIMATE.init(); {2947#true} is VALID [2022-04-27 14:39:28,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {2947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:28,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {2955#(<= ~counter~0 0)} assume true; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:28,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2955#(<= ~counter~0 0)} {2947#true} #61#return; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:28,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {2955#(<= ~counter~0 0)} call #t~ret6 := main(); {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:28,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {2955#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:28,253 INFO L272 TraceCheckUtils]: 6: Hoare triple {2955#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:28,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {2955#(<= ~counter~0 0)} ~cond := #in~cond; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:28,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {2955#(<= ~counter~0 0)} assume !(0 == ~cond); {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:28,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {2955#(<= ~counter~0 0)} assume true; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:28,254 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2955#(<= ~counter~0 0)} {2955#(<= ~counter~0 0)} #53#return; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:28,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {2955#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:39:28,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {2955#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:28,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {2989#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:28,256 INFO L272 TraceCheckUtils]: 14: Hoare triple {2989#(<= ~counter~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)); {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:28,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {2989#(<= ~counter~0 1)} ~cond := #in~cond; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:28,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {2989#(<= ~counter~0 1)} assume !(0 == ~cond); {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:28,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {2989#(<= ~counter~0 1)} assume true; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:28,257 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2989#(<= ~counter~0 1)} {2989#(<= ~counter~0 1)} #55#return; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:28,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {2989#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:39:28,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {2989#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:39:28,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {3014#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:39:28,258 INFO L272 TraceCheckUtils]: 22: Hoare triple {3014#(<= ~counter~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)); {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:39:28,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {3014#(<= ~counter~0 2)} ~cond := #in~cond; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:39:28,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {3014#(<= ~counter~0 2)} assume !(0 == ~cond); {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:39:28,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {3014#(<= ~counter~0 2)} assume true; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:39:28,259 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3014#(<= ~counter~0 2)} {3014#(<= ~counter~0 2)} #55#return; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:39:28,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {3014#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:39:28,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {3014#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:39:28,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {3039#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:39:28,261 INFO L272 TraceCheckUtils]: 30: Hoare triple {3039#(<= ~counter~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)); {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:39:28,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {3039#(<= ~counter~0 3)} ~cond := #in~cond; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:39:28,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {3039#(<= ~counter~0 3)} assume !(0 == ~cond); {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:39:28,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {3039#(<= ~counter~0 3)} assume true; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:39:28,262 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3039#(<= ~counter~0 3)} {3039#(<= ~counter~0 3)} #55#return; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:39:28,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {3039#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:39:28,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {3039#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:39:28,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {3064#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:39:28,265 INFO L272 TraceCheckUtils]: 38: Hoare triple {3064#(<= ~counter~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)); {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:39:28,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {3064#(<= ~counter~0 4)} ~cond := #in~cond; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:39:28,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {3064#(<= ~counter~0 4)} assume !(0 == ~cond); {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:39:28,266 INFO L290 TraceCheckUtils]: 41: Hoare triple {3064#(<= ~counter~0 4)} assume true; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:39:28,266 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3064#(<= ~counter~0 4)} {3064#(<= ~counter~0 4)} #55#return; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:39:28,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {3064#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:39:28,267 INFO L290 TraceCheckUtils]: 44: Hoare triple {3064#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3089#(<= |main_#t~post5| 4)} is VALID [2022-04-27 14:39:28,268 INFO L290 TraceCheckUtils]: 45: Hoare triple {3089#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {2948#false} is VALID [2022-04-27 14:39:28,268 INFO L272 TraceCheckUtils]: 46: Hoare triple {2948#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)); {2948#false} is VALID [2022-04-27 14:39:28,268 INFO L290 TraceCheckUtils]: 47: Hoare triple {2948#false} ~cond := #in~cond; {2948#false} is VALID [2022-04-27 14:39:28,268 INFO L290 TraceCheckUtils]: 48: Hoare triple {2948#false} assume !(0 == ~cond); {2948#false} is VALID [2022-04-27 14:39:28,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {2948#false} assume true; {2948#false} is VALID [2022-04-27 14:39:28,268 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2948#false} {2948#false} #57#return; {2948#false} is VALID [2022-04-27 14:39:28,268 INFO L272 TraceCheckUtils]: 51: Hoare triple {2948#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2948#false} is VALID [2022-04-27 14:39:28,268 INFO L290 TraceCheckUtils]: 52: Hoare triple {2948#false} ~cond := #in~cond; {2948#false} is VALID [2022-04-27 14:39:28,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {2948#false} assume 0 == ~cond; {2948#false} is VALID [2022-04-27 14:39:28,269 INFO L290 TraceCheckUtils]: 54: Hoare triple {2948#false} assume !false; {2948#false} is VALID [2022-04-27 14:39:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 14:39:28,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:28,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {2948#false} assume !false; {2948#false} is VALID [2022-04-27 14:39:28,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {2948#false} assume 0 == ~cond; {2948#false} is VALID [2022-04-27 14:39:28,586 INFO L290 TraceCheckUtils]: 52: Hoare triple {2948#false} ~cond := #in~cond; {2948#false} is VALID [2022-04-27 14:39:28,586 INFO L272 TraceCheckUtils]: 51: Hoare triple {2948#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2948#false} is VALID [2022-04-27 14:39:28,586 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2947#true} {2948#false} #57#return; {2948#false} is VALID [2022-04-27 14:39:28,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:39:28,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:39:28,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:39:28,587 INFO L272 TraceCheckUtils]: 46: Hoare triple {2948#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)); {2947#true} is VALID [2022-04-27 14:39:28,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {3147#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {2948#false} is VALID [2022-04-27 14:39:28,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {3151#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3147#(< |main_#t~post5| 100)} is VALID [2022-04-27 14:39:28,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {3151#(< ~counter~0 100)} 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; {3151#(< ~counter~0 100)} is VALID [2022-04-27 14:39:28,589 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2947#true} {3151#(< ~counter~0 100)} #55#return; {3151#(< ~counter~0 100)} is VALID [2022-04-27 14:39:28,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:39:28,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:39:28,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:39:28,589 INFO L272 TraceCheckUtils]: 38: Hoare triple {3151#(< ~counter~0 100)} 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)); {2947#true} is VALID [2022-04-27 14:39:28,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {3151#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {3151#(< ~counter~0 100)} is VALID [2022-04-27 14:39:28,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {3176#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3151#(< ~counter~0 100)} is VALID [2022-04-27 14:39:28,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {3176#(< ~counter~0 99)} 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; {3176#(< ~counter~0 99)} is VALID [2022-04-27 14:39:28,593 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2947#true} {3176#(< ~counter~0 99)} #55#return; {3176#(< ~counter~0 99)} is VALID [2022-04-27 14:39:28,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:39:28,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:39:28,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:39:28,594 INFO L272 TraceCheckUtils]: 30: Hoare triple {3176#(< ~counter~0 99)} 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)); {2947#true} is VALID [2022-04-27 14:39:28,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {3176#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {3176#(< ~counter~0 99)} is VALID [2022-04-27 14:39:28,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {3201#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3176#(< ~counter~0 99)} is VALID [2022-04-27 14:39:28,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {3201#(< ~counter~0 98)} 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; {3201#(< ~counter~0 98)} is VALID [2022-04-27 14:39:28,596 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2947#true} {3201#(< ~counter~0 98)} #55#return; {3201#(< ~counter~0 98)} is VALID [2022-04-27 14:39:28,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:39:28,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:39:28,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:39:28,596 INFO L272 TraceCheckUtils]: 22: Hoare triple {3201#(< ~counter~0 98)} 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)); {2947#true} is VALID [2022-04-27 14:39:28,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {3201#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {3201#(< ~counter~0 98)} is VALID [2022-04-27 14:39:28,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {3226#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3201#(< ~counter~0 98)} is VALID [2022-04-27 14:39:28,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {3226#(< ~counter~0 97)} 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; {3226#(< ~counter~0 97)} is VALID [2022-04-27 14:39:28,598 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2947#true} {3226#(< ~counter~0 97)} #55#return; {3226#(< ~counter~0 97)} is VALID [2022-04-27 14:39:28,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:39:28,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:39:28,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:39:28,598 INFO L272 TraceCheckUtils]: 14: Hoare triple {3226#(< ~counter~0 97)} 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)); {2947#true} is VALID [2022-04-27 14:39:28,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {3226#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {3226#(< ~counter~0 97)} is VALID [2022-04-27 14:39:28,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {3251#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3226#(< ~counter~0 97)} is VALID [2022-04-27 14:39:28,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {3251#(< ~counter~0 96)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3251#(< ~counter~0 96)} is VALID [2022-04-27 14:39:28,600 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2947#true} {3251#(< ~counter~0 96)} #53#return; {3251#(< ~counter~0 96)} is VALID [2022-04-27 14:39:28,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:39:28,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:39:28,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:39:28,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {3251#(< ~counter~0 96)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2947#true} is VALID [2022-04-27 14:39:28,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {3251#(< ~counter~0 96)} 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; {3251#(< ~counter~0 96)} is VALID [2022-04-27 14:39:28,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {3251#(< ~counter~0 96)} call #t~ret6 := main(); {3251#(< ~counter~0 96)} is VALID [2022-04-27 14:39:28,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3251#(< ~counter~0 96)} {2947#true} #61#return; {3251#(< ~counter~0 96)} is VALID [2022-04-27 14:39:28,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {3251#(< ~counter~0 96)} assume true; {3251#(< ~counter~0 96)} is VALID [2022-04-27 14:39:28,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {2947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3251#(< ~counter~0 96)} is VALID [2022-04-27 14:39:28,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {2947#true} call ULTIMATE.init(); {2947#true} is VALID [2022-04-27 14:39:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:39:28,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:28,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729026500] [2022-04-27 14:39:28,602 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:28,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746248572] [2022-04-27 14:39:28,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746248572] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:39:28,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:39:28,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 14:39:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574930822] [2022-04-27 14:39:28,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:28,603 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 55 [2022-04-27 14:39:28,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:28,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:39:28,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:28,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:39:28,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:28,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:39:28,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:39:28,692 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:39:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:29,291 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2022-04-27 14:39:29,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:39:29,292 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 55 [2022-04-27 14:39:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:39:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 145 transitions. [2022-04-27 14:39:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:39:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 145 transitions. [2022-04-27 14:39:29,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 145 transitions. [2022-04-27 14:39:29,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:29,430 INFO L225 Difference]: With dead ends: 140 [2022-04-27 14:39:29,430 INFO L226 Difference]: Without dead ends: 130 [2022-04-27 14:39:29,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:39:29,431 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 134 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:29,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 152 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:39:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-27 14:39:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2022-04-27 14:39:29,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:29,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:39:29,492 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:39:29,493 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:39:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:29,497 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-27 14:39:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-27 14:39:29,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:29,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:29,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 130 states. [2022-04-27 14:39:29,498 INFO L87 Difference]: Start difference. First operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 130 states. [2022-04-27 14:39:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:29,501 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-27 14:39:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-27 14:39:29,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:29,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:29,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:29,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:39:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-04-27 14:39:29,505 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 55 [2022-04-27 14:39:29,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:29,505 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-04-27 14:39:29,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:39:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-04-27 14:39:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 14:39:29,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:29,506 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:29,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 14:39:29,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 14:39:29,707 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:29,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 4 times [2022-04-27 14:39:29,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:29,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502956429] [2022-04-27 14:39:29,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:29,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:29,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:29,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764064992] [2022-04-27 14:39:29,722 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:39:29,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:29,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:29,723 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:39:29,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 14:39:29,775 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:39:29,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:39:29,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:39:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:29,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:30,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {3917#true} call ULTIMATE.init(); {3917#true} is VALID [2022-04-27 14:39:30,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {3917#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3917#true} is VALID [2022-04-27 14:39:30,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:39:30,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3917#true} {3917#true} #61#return; {3917#true} is VALID [2022-04-27 14:39:30,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {3917#true} call #t~ret6 := main(); {3917#true} is VALID [2022-04-27 14:39:30,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {3917#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; {3917#true} is VALID [2022-04-27 14:39:30,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {3917#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:39:30,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:39:30,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:39:30,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:39:30,191 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3917#true} {3917#true} #53#return; {3917#true} is VALID [2022-04-27 14:39:30,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {3917#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:30,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {3955#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:30,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {3955#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:30,193 INFO L272 TraceCheckUtils]: 14: Hoare triple {3955#(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)); {3917#true} is VALID [2022-04-27 14:39:30,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:39:30,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:39:30,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:39:30,194 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3917#true} {3955#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:30,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {3955#(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; {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:39:30,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {3980#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:39:30,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {3980#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:39:30,195 INFO L272 TraceCheckUtils]: 22: Hoare triple {3980#(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)); {3917#true} is VALID [2022-04-27 14:39:30,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:39:30,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:39:30,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:39:30,196 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3917#true} {3980#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:39:30,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {3980#(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; {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:39:30,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:39:30,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:39:30,199 INFO L272 TraceCheckUtils]: 30: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) 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)); {3917#true} is VALID [2022-04-27 14:39:30,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:39:30,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:39:30,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:39:30,199 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3917#true} {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:39:30,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) 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; {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:39:30,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:39:30,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:39:30,201 INFO L272 TraceCheckUtils]: 38: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) 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)); {3917#true} is VALID [2022-04-27 14:39:30,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:39:30,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:39:30,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:39:30,202 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3917#true} {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #55#return; {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:39:30,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) 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; {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:39:30,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:39:30,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:39:30,207 INFO L272 TraceCheckUtils]: 46: Hoare triple {4055#(and (= main_~y~0 4) (< 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)); {3917#true} is VALID [2022-04-27 14:39:30,207 INFO L290 TraceCheckUtils]: 47: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:39:30,207 INFO L290 TraceCheckUtils]: 48: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:39:30,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:39:30,208 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3917#true} {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:39:30,208 INFO L290 TraceCheckUtils]: 51: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:39:30,209 INFO L272 TraceCheckUtils]: 52: Hoare triple {4080#(and (= main_~y~0 4) (< 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)); {3917#true} is VALID [2022-04-27 14:39:30,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:39:30,209 INFO L290 TraceCheckUtils]: 54: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:39:30,209 INFO L290 TraceCheckUtils]: 55: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:39:30,209 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3917#true} {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:39:30,210 INFO L272 TraceCheckUtils]: 57: Hoare triple {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4099#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:30,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {4099#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4103#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:30,211 INFO L290 TraceCheckUtils]: 59: Hoare triple {4103#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3918#false} is VALID [2022-04-27 14:39:30,211 INFO L290 TraceCheckUtils]: 60: Hoare triple {3918#false} assume !false; {3918#false} is VALID [2022-04-27 14:39:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:39:30,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:30,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:30,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502956429] [2022-04-27 14:39:30,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:30,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764064992] [2022-04-27 14:39:30,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764064992] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:30,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:30,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:39:30,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842147752] [2022-04-27 14:39:30,534 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:30,535 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-27 14:39:30,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:30,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:39:30,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:30,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:39:30,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:30,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:39:30,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:39:30,578 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:39:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:31,108 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 14:39:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:39:31,109 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-27 14:39:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:39:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-27 14:39:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:39:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-27 14:39:31,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-27 14:39:31,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:31,168 INFO L225 Difference]: With dead ends: 110 [2022-04-27 14:39:31,168 INFO L226 Difference]: Without dead ends: 104 [2022-04-27 14:39:31,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:39:31,169 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:31,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 267 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:39:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-27 14:39:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-04-27 14:39:31,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:31,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:39:31,219 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:39:31,219 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:39:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:31,222 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-27 14:39:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-27 14:39:31,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:31,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:31,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 104 states. [2022-04-27 14:39:31,223 INFO L87 Difference]: Start difference. First operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 104 states. [2022-04-27 14:39:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:31,225 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-27 14:39:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-27 14:39:31,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:31,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:31,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:31,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:39:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2022-04-27 14:39:31,228 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 61 [2022-04-27 14:39:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:31,228 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2022-04-27 14:39:31,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:39:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-27 14:39:31,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 14:39:31,229 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:31,229 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:31,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 14:39:31,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 14:39:31,439 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:31,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:31,440 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 5 times [2022-04-27 14:39:31,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:31,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450307090] [2022-04-27 14:39:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:31,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:31,467 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:31,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445560890] [2022-04-27 14:39:31,467 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:39:31,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:31,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:31,468 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:39:31,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 14:39:33,232 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:39:33,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:39:33,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 14:39:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:33,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:33,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {4686#true} call ULTIMATE.init(); {4686#true} is VALID [2022-04-27 14:39:33,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {4686#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4686#true} is VALID [2022-04-27 14:39:33,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:39:33,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4686#true} {4686#true} #61#return; {4686#true} is VALID [2022-04-27 14:39:33,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {4686#true} call #t~ret6 := main(); {4686#true} is VALID [2022-04-27 14:39:33,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {4686#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; {4686#true} is VALID [2022-04-27 14:39:33,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {4686#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:39:33,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:39:33,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:39:33,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:39:33,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4686#true} {4686#true} #53#return; {4686#true} is VALID [2022-04-27 14:39:33,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {4686#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:33,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {4724#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:33,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {4724#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:33,807 INFO L272 TraceCheckUtils]: 14: Hoare triple {4724#(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)); {4686#true} is VALID [2022-04-27 14:39:33,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:39:33,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:39:33,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:39:33,808 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4686#true} {4724#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:33,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {4724#(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; {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:39:33,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:39:33,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 100);havoc #t~post5; {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:39:33,809 INFO L272 TraceCheckUtils]: 22: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:39:33,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:39:33,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:39:33,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:39:33,810 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4686#true} {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:39:33,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:39:33,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:39:33,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:39:33,811 INFO L272 TraceCheckUtils]: 30: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:39:33,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:39:33,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:39:33,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:39:33,812 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4686#true} {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #55#return; {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:39:33,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:39:33,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:39:33,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:39:33,813 INFO L272 TraceCheckUtils]: 38: Hoare triple {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:39:33,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:39:33,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:39:33,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:39:33,815 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4686#true} {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #55#return; {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:39:33,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:39:33,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:39:33,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:39:33,817 INFO L272 TraceCheckUtils]: 46: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:39:33,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:39:33,817 INFO L290 TraceCheckUtils]: 48: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:39:33,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:39:33,818 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4686#true} {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} #55#return; {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:39:33,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:39:33,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:39:33,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:39:33,820 INFO L272 TraceCheckUtils]: 54: Hoare triple {4849#(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)); {4686#true} is VALID [2022-04-27 14:39:33,820 INFO L290 TraceCheckUtils]: 55: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:39:33,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:39:33,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:39:33,820 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4686#true} {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #55#return; {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:39:33,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {4874#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:39:33,821 INFO L272 TraceCheckUtils]: 60: Hoare triple {4874#(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)); {4686#true} is VALID [2022-04-27 14:39:33,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:39:33,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:39:33,821 INFO L290 TraceCheckUtils]: 63: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:39:33,822 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4686#true} {4874#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {4874#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 14:39:33,823 INFO L272 TraceCheckUtils]: 65: Hoare triple {4874#(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)); {4893#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:33,823 INFO L290 TraceCheckUtils]: 66: Hoare triple {4893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:33,824 INFO L290 TraceCheckUtils]: 67: Hoare triple {4897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4687#false} is VALID [2022-04-27 14:39:33,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {4687#false} assume !false; {4687#false} is VALID [2022-04-27 14:39:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 14:39:33,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:34,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:34,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450307090] [2022-04-27 14:39:34,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:34,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445560890] [2022-04-27 14:39:34,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445560890] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:34,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:34,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:39:34,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280987945] [2022-04-27 14:39:34,497 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:34,498 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-27 14:39:34,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:34,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:39:34,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:34,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:39:34,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:34,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:39:34,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:39:34,544 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:39:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:35,175 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-04-27 14:39:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:39:35,175 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-27 14:39:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:39:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-27 14:39:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:39:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-27 14:39:35,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-27 14:39:35,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:35,230 INFO L225 Difference]: With dead ends: 109 [2022-04-27 14:39:35,230 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 14:39:35,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:39:35,231 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:35,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:39:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 14:39:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-27 14:39:35,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:35,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:39:35,281 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:39:35,281 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:39:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:35,283 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-04-27 14:39:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-27 14:39:35,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:35,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:35,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand 103 states. [2022-04-27 14:39:35,284 INFO L87 Difference]: Start difference. First operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand 103 states. [2022-04-27 14:39:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:35,287 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-04-27 14:39:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-27 14:39:35,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:35,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:35,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:35,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:39:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2022-04-27 14:39:35,290 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 69 [2022-04-27 14:39:35,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:35,290 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2022-04-27 14:39:35,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:39:35,290 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-27 14:39:35,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 14:39:35,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:35,291 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:35,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 14:39:35,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 14:39:35,498 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:35,498 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 6 times [2022-04-27 14:39:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:35,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167365668] [2022-04-27 14:39:35,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:35,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:35,512 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:35,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1942118730] [2022-04-27 14:39:35,512 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:39:35,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:35,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:35,513 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:39:35,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 14:39:51,482 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:39:51,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:39:51,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:39:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:39:51,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:39:52,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2022-04-27 14:39:52,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {5574#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5574#true} is VALID [2022-04-27 14:39:52,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-27 14:39:52,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5574#true} {5574#true} #61#return; {5574#true} is VALID [2022-04-27 14:39:52,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {5574#true} call #t~ret6 := main(); {5574#true} is VALID [2022-04-27 14:39:52,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {5574#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; {5574#true} is VALID [2022-04-27 14:39:52,003 INFO L272 TraceCheckUtils]: 6: Hoare triple {5574#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5574#true} is VALID [2022-04-27 14:39:52,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-27 14:39:52,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-27 14:39:52,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-27 14:39:52,003 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5574#true} {5574#true} #53#return; {5574#true} is VALID [2022-04-27 14:39:52,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {5574#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:52,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {5612#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:52,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {5612#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {5612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:52,005 INFO L272 TraceCheckUtils]: 14: Hoare triple {5612#(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)); {5574#true} is VALID [2022-04-27 14:39:52,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-27 14:39:52,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-27 14:39:52,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-27 14:39:52,006 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5574#true} {5612#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {5612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:39:52,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {5612#(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; {5637#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:39:52,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {5637#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5637#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:39:52,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {5637#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {5637#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:39:52,007 INFO L272 TraceCheckUtils]: 22: Hoare triple {5637#(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)); {5574#true} is VALID [2022-04-27 14:39:52,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-27 14:39:52,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-27 14:39:52,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-27 14:39:52,008 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5574#true} {5637#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {5637#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:39:52,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {5637#(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; {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:39:52,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:39:52,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:39:52,009 INFO L272 TraceCheckUtils]: 30: Hoare triple {5662#(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)); {5574#true} is VALID [2022-04-27 14:39:52,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-27 14:39:52,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-27 14:39:52,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-27 14:39:52,010 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5574#true} {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #55#return; {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:39:52,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {5662#(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; {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:39:52,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:39:52,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:39:52,012 INFO L272 TraceCheckUtils]: 38: Hoare triple {5687#(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)); {5574#true} is VALID [2022-04-27 14:39:52,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-27 14:39:52,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-27 14:39:52,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-27 14:39:52,012 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5574#true} {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:39:52,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {5687#(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; {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:39:52,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:39:52,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:39:52,014 INFO L272 TraceCheckUtils]: 46: Hoare triple {5712#(and (= 2 (+ (- 2) main_~c~0)) (= 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)); {5574#true} is VALID [2022-04-27 14:39:52,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-27 14:39:52,014 INFO L290 TraceCheckUtils]: 48: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-27 14:39:52,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-27 14:39:52,014 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5574#true} {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #55#return; {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:39:52,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {5712#(and (= 2 (+ (- 2) main_~c~0)) (= 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; {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:52,015 INFO L290 TraceCheckUtils]: 52: Hoare triple {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:52,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:52,016 INFO L272 TraceCheckUtils]: 54: Hoare triple {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5574#true} is VALID [2022-04-27 14:39:52,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-27 14:39:52,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-27 14:39:52,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-27 14:39:52,017 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5574#true} {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:39:52,017 INFO L290 TraceCheckUtils]: 59: Hoare triple {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:39:52,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:39:52,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:39:52,018 INFO L272 TraceCheckUtils]: 62: Hoare triple {5762#(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)); {5574#true} is VALID [2022-04-27 14:39:52,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-27 14:39:52,018 INFO L290 TraceCheckUtils]: 64: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-27 14:39:52,018 INFO L290 TraceCheckUtils]: 65: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-27 14:39:52,019 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5574#true} {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:39:52,020 INFO L290 TraceCheckUtils]: 67: Hoare triple {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {5787#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:39:52,020 INFO L272 TraceCheckUtils]: 68: Hoare triple {5787#(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)); {5574#true} is VALID [2022-04-27 14:39:52,020 INFO L290 TraceCheckUtils]: 69: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-27 14:39:52,020 INFO L290 TraceCheckUtils]: 70: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-27 14:39:52,020 INFO L290 TraceCheckUtils]: 71: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-27 14:39:52,021 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5574#true} {5787#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {5787#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:39:52,021 INFO L272 TraceCheckUtils]: 73: Hoare triple {5787#(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)); {5806#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:39:52,022 INFO L290 TraceCheckUtils]: 74: Hoare triple {5806#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5810#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:39:52,022 INFO L290 TraceCheckUtils]: 75: Hoare triple {5810#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5575#false} is VALID [2022-04-27 14:39:52,022 INFO L290 TraceCheckUtils]: 76: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2022-04-27 14:39:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 14:39:52,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:39:52,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:39:52,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167365668] [2022-04-27 14:39:52,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:39:52,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942118730] [2022-04-27 14:39:52,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942118730] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:39:52,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:39:52,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:39:52,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072159555] [2022-04-27 14:39:52,319 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:39:52,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-27 14:39:52,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:39:52,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:39:52,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:52,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:39:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:39:52,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:39:52,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:39:52,387 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:39:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:53,077 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-04-27 14:39:53,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:39:53,077 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-27 14:39:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:39:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:39:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-27 14:39:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:39:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-27 14:39:53,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-27 14:39:53,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:39:53,135 INFO L225 Difference]: With dead ends: 108 [2022-04-27 14:39:53,135 INFO L226 Difference]: Without dead ends: 102 [2022-04-27 14:39:53,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:39:53,136 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:39:53,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 371 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:39:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-27 14:39:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-27 14:39:53,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:39:53,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:39:53,187 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:39:53,187 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:39:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:53,189 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-04-27 14:39:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-27 14:39:53,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:53,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:53,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 102 states. [2022-04-27 14:39:53,190 INFO L87 Difference]: Start difference. First operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 102 states. [2022-04-27 14:39:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:39:53,192 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-04-27 14:39:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-27 14:39:53,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:39:53,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:39:53,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:39:53,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:39:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:39:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-04-27 14:39:53,195 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 77 [2022-04-27 14:39:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:39:53,195 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-04-27 14:39:53,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:39:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-27 14:39:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 14:39:53,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:39:53,196 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:39:53,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 14:39:53,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 14:39:53,397 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:39:53,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:39:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 7 times [2022-04-27 14:39:53,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:39:53,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825002126] [2022-04-27 14:39:53,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:39:53,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:39:53,425 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:39:53,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1468072762] [2022-04-27 14:39:53,425 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:39:53,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:39:53,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:39:53,429 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:39:53,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 14:40:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:40:05,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 14:40:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:40:05,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:40:05,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {6381#true} call ULTIMATE.init(); {6381#true} is VALID [2022-04-27 14:40:05,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {6381#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6381#true} is VALID [2022-04-27 14:40:05,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:40:05,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6381#true} {6381#true} #61#return; {6381#true} is VALID [2022-04-27 14:40:05,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {6381#true} call #t~ret6 := main(); {6381#true} is VALID [2022-04-27 14:40:05,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {6381#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; {6381#true} is VALID [2022-04-27 14:40:05,959 INFO L272 TraceCheckUtils]: 6: Hoare triple {6381#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:40:05,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:40:05,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:40:05,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:40:05,959 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6381#true} {6381#true} #53#return; {6381#true} is VALID [2022-04-27 14:40:05,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {6381#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:05,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {6419#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:05,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {6419#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:05,960 INFO L272 TraceCheckUtils]: 14: Hoare triple {6419#(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)); {6381#true} is VALID [2022-04-27 14:40:05,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:40:05,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:40:05,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:40:05,961 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6381#true} {6419#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:05,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {6419#(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; {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:40:05,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:40:05,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 100);havoc #t~post5; {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:40:05,962 INFO L272 TraceCheckUtils]: 22: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:40:05,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:40:05,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:40:05,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:40:05,963 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6381#true} {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:40:05,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:40:05,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:40:05,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:40:05,964 INFO L272 TraceCheckUtils]: 30: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~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)); {6381#true} is VALID [2022-04-27 14:40:05,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:40:05,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:40:05,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:40:05,971 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6381#true} {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #55#return; {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:40:05,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:40:05,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:40:05,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:40:05,973 INFO L272 TraceCheckUtils]: 38: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:40:05,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:40:05,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:40:05,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:40:05,974 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6381#true} {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #55#return; {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:40:05,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:40:05,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:40:05,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:40:05,976 INFO L272 TraceCheckUtils]: 46: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:40:05,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:40:05,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:40:05,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:40:05,977 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6381#true} {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} #55#return; {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:40:05,977 INFO L290 TraceCheckUtils]: 51: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:40:05,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:40:05,978 INFO L290 TraceCheckUtils]: 53: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:40:05,979 INFO L272 TraceCheckUtils]: 54: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:40:05,979 INFO L290 TraceCheckUtils]: 55: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:40:05,979 INFO L290 TraceCheckUtils]: 56: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:40:05,979 INFO L290 TraceCheckUtils]: 57: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:40:05,979 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6381#true} {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} #55#return; {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:40:05,980 INFO L290 TraceCheckUtils]: 59: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:40:05,981 INFO L290 TraceCheckUtils]: 60: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:40:05,981 INFO L290 TraceCheckUtils]: 61: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:40:05,981 INFO L272 TraceCheckUtils]: 62: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 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)); {6381#true} is VALID [2022-04-27 14:40:05,981 INFO L290 TraceCheckUtils]: 63: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:40:05,981 INFO L290 TraceCheckUtils]: 64: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:40:05,981 INFO L290 TraceCheckUtils]: 65: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:40:05,982 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6381#true} {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} #55#return; {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:40:05,983 INFO L290 TraceCheckUtils]: 67: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:40:05,983 INFO L290 TraceCheckUtils]: 68: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:40:05,983 INFO L290 TraceCheckUtils]: 69: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:40:05,984 INFO L272 TraceCheckUtils]: 70: Hoare triple {6594#(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)); {6381#true} is VALID [2022-04-27 14:40:05,984 INFO L290 TraceCheckUtils]: 71: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:40:05,984 INFO L290 TraceCheckUtils]: 72: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:40:05,984 INFO L290 TraceCheckUtils]: 73: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:40:05,984 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6381#true} {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #55#return; {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:40:05,985 INFO L290 TraceCheckUtils]: 75: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:40:05,985 INFO L272 TraceCheckUtils]: 76: Hoare triple {6619#(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)); {6381#true} is VALID [2022-04-27 14:40:05,985 INFO L290 TraceCheckUtils]: 77: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:40:05,985 INFO L290 TraceCheckUtils]: 78: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:40:05,986 INFO L290 TraceCheckUtils]: 79: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:40:05,986 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6381#true} {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:40:05,987 INFO L272 TraceCheckUtils]: 81: Hoare triple {6619#(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)); {6638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:40:05,987 INFO L290 TraceCheckUtils]: 82: Hoare triple {6638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:40:05,988 INFO L290 TraceCheckUtils]: 83: Hoare triple {6642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6382#false} is VALID [2022-04-27 14:40:05,988 INFO L290 TraceCheckUtils]: 84: Hoare triple {6382#false} assume !false; {6382#false} is VALID [2022-04-27 14:40:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 14:40:05,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:40:07,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:40:07,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825002126] [2022-04-27 14:40:07,041 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:40:07,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468072762] [2022-04-27 14:40:07,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468072762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:40:07,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:40:07,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:40:07,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603850794] [2022-04-27 14:40:07,042 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:40:07,047 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-27 14:40:07,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:40:07,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:40:07,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:40:07,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:40:07,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:40:07,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:40:07,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:40:07,118 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:40:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:08,046 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-04-27 14:40:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:40:08,046 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-27 14:40:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:40:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:40:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-27 14:40:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:40:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-27 14:40:08,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-27 14:40:08,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:40:08,105 INFO L225 Difference]: With dead ends: 107 [2022-04-27 14:40:08,105 INFO L226 Difference]: Without dead ends: 101 [2022-04-27 14:40:08,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:40:08,106 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:40:08,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 423 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:40:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-27 14:40:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-27 14:40:08,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:40:08,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:40:08,160 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:40:08,160 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:40:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:08,162 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-27 14:40:08,162 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-27 14:40:08,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:40:08,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:40:08,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 101 states. [2022-04-27 14:40:08,163 INFO L87 Difference]: Start difference. First operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 101 states. [2022-04-27 14:40:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:08,165 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-27 14:40:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-27 14:40:08,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:40:08,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:40:08,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:40:08,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:40:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:40:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2022-04-27 14:40:08,168 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 85 [2022-04-27 14:40:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:40:08,168 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2022-04-27 14:40:08,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:40:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-27 14:40:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-27 14:40:08,169 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:40:08,169 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:40:08,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 14:40:08,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 14:40:08,376 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:40:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:40:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 8 times [2022-04-27 14:40:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:40:08,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656644991] [2022-04-27 14:40:08,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:40:08,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:40:08,391 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:40:08,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165976988] [2022-04-27 14:40:08,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:40:08,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:40:08,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:40:08,392 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:40:08,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 14:40:13,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:40:13,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:40:13,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:40:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:40:13,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:40:14,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {7357#true} call ULTIMATE.init(); {7357#true} is VALID [2022-04-27 14:40:14,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {7357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7357#true} is VALID [2022-04-27 14:40:14,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:40:14,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7357#true} {7357#true} #61#return; {7357#true} is VALID [2022-04-27 14:40:14,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {7357#true} call #t~ret6 := main(); {7357#true} is VALID [2022-04-27 14:40:14,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {7357#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; {7357#true} is VALID [2022-04-27 14:40:14,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {7357#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:40:14,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:40:14,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:40:14,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:40:14,459 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7357#true} {7357#true} #53#return; {7357#true} is VALID [2022-04-27 14:40:14,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {7357#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:14,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {7395#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:14,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {7395#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:14,460 INFO L272 TraceCheckUtils]: 14: Hoare triple {7395#(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)); {7357#true} is VALID [2022-04-27 14:40:14,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:40:14,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:40:14,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:40:14,461 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7357#true} {7395#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:14,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {7395#(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; {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:40:14,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:40:14,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:40:14,462 INFO L272 TraceCheckUtils]: 22: Hoare triple {7420#(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)); {7357#true} is VALID [2022-04-27 14:40:14,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:40:14,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:40:14,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:40:14,463 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7357#true} {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:40:14,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {7420#(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; {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:40:14,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:40:14,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:40:14,464 INFO L272 TraceCheckUtils]: 30: Hoare triple {7445#(and (= main_~y~0 2) (= 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)); {7357#true} is VALID [2022-04-27 14:40:14,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:40:14,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:40:14,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:40:14,465 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7357#true} {7445#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:40:14,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:40:14,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:40:14,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:40:14,467 INFO L272 TraceCheckUtils]: 38: Hoare triple {7470#(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)); {7357#true} is VALID [2022-04-27 14:40:14,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:40:14,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:40:14,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:40:14,467 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7357#true} {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:40:14,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {7470#(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; {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:40:14,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:40:14,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:40:14,469 INFO L272 TraceCheckUtils]: 46: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:40:14,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:40:14,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:40:14,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:40:14,470 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7357#true} {7495#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:40:14,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:40:14,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:40:14,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:40:14,471 INFO L272 TraceCheckUtils]: 54: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:40:14,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:40:14,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:40:14,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:40:14,472 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7357#true} {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #55#return; {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:40:14,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:40:14,473 INFO L290 TraceCheckUtils]: 60: Hoare triple {7545#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:40:14,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {7545#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:40:14,473 INFO L272 TraceCheckUtils]: 62: Hoare triple {7545#(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)); {7357#true} is VALID [2022-04-27 14:40:14,473 INFO L290 TraceCheckUtils]: 63: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:40:14,473 INFO L290 TraceCheckUtils]: 64: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:40:14,473 INFO L290 TraceCheckUtils]: 65: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:40:14,474 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7357#true} {7545#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:40:14,475 INFO L290 TraceCheckUtils]: 67: Hoare triple {7545#(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; {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:40:14,475 INFO L290 TraceCheckUtils]: 68: Hoare triple {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:40:14,475 INFO L290 TraceCheckUtils]: 69: Hoare triple {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(#t~post5 < 100);havoc #t~post5; {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:40:14,476 INFO L272 TraceCheckUtils]: 70: Hoare triple {7570#(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)); {7357#true} is VALID [2022-04-27 14:40:14,476 INFO L290 TraceCheckUtils]: 71: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:40:14,476 INFO L290 TraceCheckUtils]: 72: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:40:14,476 INFO L290 TraceCheckUtils]: 73: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:40:14,476 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7357#true} {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} #55#return; {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:40:14,477 INFO L290 TraceCheckUtils]: 75: Hoare triple {7570#(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; {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:40:14,477 INFO L290 TraceCheckUtils]: 76: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:40:14,478 INFO L290 TraceCheckUtils]: 77: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:40:14,478 INFO L272 TraceCheckUtils]: 78: Hoare triple {7595#(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)); {7357#true} is VALID [2022-04-27 14:40:14,478 INFO L290 TraceCheckUtils]: 79: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:40:14,478 INFO L290 TraceCheckUtils]: 80: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:40:14,478 INFO L290 TraceCheckUtils]: 81: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:40:14,479 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {7357#true} {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:40:14,480 INFO L290 TraceCheckUtils]: 83: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:40:14,480 INFO L272 TraceCheckUtils]: 84: Hoare triple {7620#(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)); {7357#true} is VALID [2022-04-27 14:40:14,480 INFO L290 TraceCheckUtils]: 85: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:40:14,480 INFO L290 TraceCheckUtils]: 86: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:40:14,480 INFO L290 TraceCheckUtils]: 87: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:40:14,481 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7357#true} {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:40:14,481 INFO L272 TraceCheckUtils]: 89: Hoare triple {7620#(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)); {7639#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:40:14,482 INFO L290 TraceCheckUtils]: 90: Hoare triple {7639#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7643#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:40:14,482 INFO L290 TraceCheckUtils]: 91: Hoare triple {7643#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7358#false} is VALID [2022-04-27 14:40:14,482 INFO L290 TraceCheckUtils]: 92: Hoare triple {7358#false} assume !false; {7358#false} is VALID [2022-04-27 14:40:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 14:40:14,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:40:14,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:40:14,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656644991] [2022-04-27 14:40:14,755 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:40:14,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165976988] [2022-04-27 14:40:14,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165976988] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:40:14,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:40:14,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:40:14,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609771442] [2022-04-27 14:40:14,755 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:40:14,756 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-27 14:40:14,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:40:14,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:40:14,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:40:14,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:40:14,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:40:14,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:40:14,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:40:14,803 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:40:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:15,790 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2022-04-27 14:40:15,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:40:15,790 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-27 14:40:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:40:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:40:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-27 14:40:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:40:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-27 14:40:15,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-27 14:40:15,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:40:15,865 INFO L225 Difference]: With dead ends: 106 [2022-04-27 14:40:15,865 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 14:40:15,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:40:15,866 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:40:15,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 491 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:40:15,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 14:40:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-27 14:40:15,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:40:15,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:40:15,914 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:40:15,915 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:40:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:15,916 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-27 14:40:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 14:40:15,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:40:15,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:40:15,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-27 14:40:15,917 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-27 14:40:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:15,918 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-27 14:40:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 14:40:15,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:40:15,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:40:15,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:40:15,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:40:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:40:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-27 14:40:15,921 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 93 [2022-04-27 14:40:15,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:40:15,921 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-27 14:40:15,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:40:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 14:40:15,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 14:40:15,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:40:15,923 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:40:15,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 14:40:16,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 14:40:16,132 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:40:16,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:40:16,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 9 times [2022-04-27 14:40:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:40:16,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944203429] [2022-04-27 14:40:16,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:40:16,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:40:16,146 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:40:16,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1170875091] [2022-04-27 14:40:16,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:40:16,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:40:16,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:40:16,147 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:40:16,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process