/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/ps6-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:53:47,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:53:47,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:53:47,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:53:47,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:53:47,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:53:47,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:53:47,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:53:47,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:53:47,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:53:47,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:53:47,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:53:47,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:53:47,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:53:47,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:53:47,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:53:47,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:53:47,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:53:47,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:53:47,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:53:47,120 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:53:47,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:53:47,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:53:47,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:53:47,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:53:47,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:53:47,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:53:47,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:53:47,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:53:47,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:53:47,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:53:47,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:53:47,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:53:47,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:53:47,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:53:47,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:53:47,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:53:47,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:53:47,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:53:47,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:53:47,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:53:47,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:53:47,141 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:53:47,177 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:53:47,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:53:47,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:53:47,178 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:53:47,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:53:47,178 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:53:47,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:53:47,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:53:47,179 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:53:47,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:53:47,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:53:47,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:53:47,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:53:47,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:53:47,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:53:47,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:53:47,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:53:47,182 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:53:47,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:53:47,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:53:47,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:53:47,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:53:47,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:53:47,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:53:47,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:53:47,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:53:47,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:53:47,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:53:47,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:53:47,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:53:47,184 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:53:47,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:53:47,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:53:47,184 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:53:47,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:53:47,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:53:47,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:53:47,429 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:53:47,429 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:53:47,430 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound100.c [2022-04-27 14:53:47,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3123f01a/750038f167de4e008ac03973cf6a9347/FLAG074232b22 [2022-04-27 14:53:47,903 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:53:47,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound100.c [2022-04-27 14:53:47,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3123f01a/750038f167de4e008ac03973cf6a9347/FLAG074232b22 [2022-04-27 14:53:48,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3123f01a/750038f167de4e008ac03973cf6a9347 [2022-04-27 14:53:48,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:53:48,326 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:53:48,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:53:48,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:53:48,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:53:48,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:53:48" (1/1) ... [2022-04-27 14:53:48,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698c910e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:48, skipping insertion in model container [2022-04-27 14:53:48,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:53:48" (1/1) ... [2022-04-27 14:53:48,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:53:48,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:53:48,520 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/ps6-ll_valuebound100.c[458,471] [2022-04-27 14:53:48,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:53:48,565 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:53:48,581 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/ps6-ll_valuebound100.c[458,471] [2022-04-27 14:53:48,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:53:48,611 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:53:48,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:48 WrapperNode [2022-04-27 14:53:48,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:53:48,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:53:48,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:53:48,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:53:48,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:48" (1/1) ... [2022-04-27 14:53:48,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:48" (1/1) ... [2022-04-27 14:53:48,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:48" (1/1) ... [2022-04-27 14:53:48,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:48" (1/1) ... [2022-04-27 14:53:48,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:48" (1/1) ... [2022-04-27 14:53:48,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:48" (1/1) ... [2022-04-27 14:53:48,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:48" (1/1) ... [2022-04-27 14:53:48,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:53:48,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:53:48,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:53:48,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:53:48,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:48" (1/1) ... [2022-04-27 14:53:48,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:53:48,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:48,684 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:53:48,707 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:53:48,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:53:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:53:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:53:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:53:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:53:48,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:53:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:53:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:53:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:53:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:53:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:53:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:53:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:53:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:53:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:53:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:53:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:53:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:53:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:53:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:53:48,789 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:53:48,791 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:53:48,946 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:53:48,951 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:53:48,951 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:53:48,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:53:48 BoogieIcfgContainer [2022-04-27 14:53:48,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:53:48,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:53:48,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:53:48,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:53:48,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:53:48" (1/3) ... [2022-04-27 14:53:48,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b05c4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:53:48, skipping insertion in model container [2022-04-27 14:53:48,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:53:48" (2/3) ... [2022-04-27 14:53:48,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b05c4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:53:48, skipping insertion in model container [2022-04-27 14:53:48,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:53:48" (3/3) ... [2022-04-27 14:53:48,959 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound100.c [2022-04-27 14:53:48,971 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:53:48,971 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:53:49,005 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:53:49,010 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@2c57dcf5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c39c03 [2022-04-27 14:53:49,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:53:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:53:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:53:49,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:49,023 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:49,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-27 14:53:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:49,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557291943] [2022-04-27 14:53:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:49,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:53:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:49,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 14:53:49,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:53:49,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-27 14:53:49,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:53:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:49,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:53:49,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:53:49,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:53:49,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:53:49,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 14:53:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:49,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:53:49,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:53:49,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:53:49,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 14:53:49,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:53:49,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 14:53:49,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:53:49,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-27 14:53:49,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-27 14:53:49,264 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:53:49,264 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {32#true} is VALID [2022-04-27 14:53:49,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:53:49,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:53:49,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:53:49,266 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:53:49,266 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-27 14:53:49,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:53:49,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:53:49,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:53:49,268 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 14:53:49,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-27 14:53:49,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-27 14:53:49,269 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-27 14:53:49,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 14:53:49,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 14:53:49,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 14:53:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:53:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:49,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557291943] [2022-04-27 14:53:49,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557291943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:53:49,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:53:49,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:53:49,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30107815] [2022-04-27 14:53:49,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:53:49,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:53:49,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:49,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:53:49,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:49,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:53:49,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:49,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:53:49,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:53:49,341 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:53:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:49,648 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 14:53:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:53:49,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:53:49,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:53:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 14:53:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:53:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 14:53:49,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-27 14:53:49,766 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:53:49,773 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:53:49,774 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 14:53:49,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:53:49,779 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:49,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:53:49,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 14:53:49,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 14:53:49,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:49,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:53:49,815 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:53:49,815 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:53:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:49,820 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 14:53:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:53:49,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:49,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:49,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 14:53:49,822 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 14:53:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:49,825 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 14:53:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:53:49,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:49,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:49,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:49,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:53:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 14:53:49,832 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-27 14:53:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:49,832 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 14:53:49,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:53:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:53:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:53:49,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:49,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:49,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:53:49,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:49,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-27 14:53:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:49,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980819250] [2022-04-27 14:53:49,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:49,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:49,855 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:49,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311484530] [2022-04-27 14:53:49,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:49,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:49,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:49,858 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:53:49,859 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:53:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:49,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:53:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:49,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:50,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2022-04-27 14:53:50,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {202#true} is VALID [2022-04-27 14:53:50,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:53:50,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #63#return; {202#true} is VALID [2022-04-27 14:53:50,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret5 := main(); {202#true} is VALID [2022-04-27 14:53:50,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {202#true} is VALID [2022-04-27 14:53:50,116 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {202#true} is VALID [2022-04-27 14:53:50,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-27 14:53:50,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-27 14:53:50,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:53:50,117 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} #53#return; {202#true} is VALID [2022-04-27 14:53:50,117 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {202#true} is VALID [2022-04-27 14:53:50,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-27 14:53:50,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-27 14:53:50,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-27 14:53:50,118 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} #55#return; {202#true} is VALID [2022-04-27 14:53:50,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:50,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:50,124 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:50,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:50,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {203#false} is VALID [2022-04-27 14:53:50,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-04-27 14:53:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:53:50,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:53:50,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:50,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980819250] [2022-04-27 14:53:50,127 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:50,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311484530] [2022-04-27 14:53:50,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311484530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:53:50,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:53:50,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:53:50,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758819297] [2022-04-27 14:53:50,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:53:50,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 14:53:50,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:50,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:53:50,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:50,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:53:50,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:50,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:53:50,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:53:50,163 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:53:51,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:51,310 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 14:53:51,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:53:51,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 14:53:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:53:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 14:53:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:53:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 14:53:51,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 14:53:51,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:51,367 INFO L225 Difference]: With dead ends: 35 [2022-04-27 14:53:51,367 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:53:51,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:53:51,373 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:51,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:53:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:53:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:53:51,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:51,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:51,388 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:51,388 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:51,395 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 14:53:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:53:51,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:51,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:51,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-27 14:53:51,397 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-27 14:53:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:51,400 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 14:53:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:53:51,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:51,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:51,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:51,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 14:53:51,405 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-27 14:53:51,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:51,405 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 14:53:51,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:53:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 14:53:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 14:53:51,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:51,406 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:51,428 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:53:51,607 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:53:51,607 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:51,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:51,608 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-27 14:53:51,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:51,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133083417] [2022-04-27 14:53:51,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:51,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:51,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:51,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [330131936] [2022-04-27 14:53:51,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:51,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:51,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:51,631 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:53:51,651 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:53:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:51,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:53:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:51,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:51,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-27 14:53:51,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {434#true} is VALID [2022-04-27 14:53:51,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:51,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-27 14:53:51,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-27 14:53:51,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {434#true} is VALID [2022-04-27 14:53:51,910 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {434#true} is VALID [2022-04-27 14:53:51,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:53:51,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:53:51,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:51,911 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-27 14:53:51,911 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-27 14:53:51,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:53:51,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:53:51,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:51,912 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-27 14:53:51,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:51,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:51,913 INFO L272 TraceCheckUtils]: 18: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {434#true} is VALID [2022-04-27 14:53:51,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:53:51,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:53:51,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:51,915 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {487#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:51,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-27 14:53:51,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-27 14:53:51,918 INFO L272 TraceCheckUtils]: 25: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:51,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:51,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-27 14:53:51,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 14:53:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:53:51,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:53:52,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 14:53:52,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-27 14:53:52,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:52,156 INFO L272 TraceCheckUtils]: 25: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:52,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:53:52,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 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 * ~y~0 + ~x~0; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:53:52,393 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #57#return; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:53:52,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:52,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:53:52,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:53:52,394 INFO L272 TraceCheckUtils]: 18: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {434#true} is VALID [2022-04-27 14:53:52,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:53:52,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:53:52,396 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-27 14:53:52,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:52,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:53:52,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:53:52,396 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-27 14:53:52,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-27 14:53:52,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:52,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-27 14:53:52,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-27 14:53:52,397 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {434#true} is VALID [2022-04-27 14:53:52,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {434#true} is VALID [2022-04-27 14:53:52,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-27 14:53:52,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-27 14:53:52,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 14:53:52,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {434#true} is VALID [2022-04-27 14:53:52,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-27 14:53:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:53:52,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:52,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133083417] [2022-04-27 14:53:52,399 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:52,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330131936] [2022-04-27 14:53:52,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330131936] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:53:52,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:53:52,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:53:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127198604] [2022-04-27 14:53:52,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:53:52,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 14:53:52,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:52,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:53:52,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:52,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:53:52,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:52,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:53:52,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:53:52,577 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:53:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:52,710 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:53:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:53:52,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 14:53:52,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:53:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:53:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:53:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:53:52,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:53:52,904 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:53:52,905 INFO L225 Difference]: With dead ends: 37 [2022-04-27 14:53:52,905 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 14:53:52,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:53:52,906 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:52,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:53:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 14:53:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 14:53:52,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:52,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:52,914 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:52,914 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:52,917 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 14:53:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:53:52,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:52,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:52,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 14:53:52,918 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 14:53:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:52,920 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 14:53:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:53:52,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:52,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:52,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:52,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:53:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-27 14:53:52,923 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-27 14:53:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:52,924 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-27 14:53:52,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:53:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 14:53:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 14:53:52,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:52,925 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:52,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 14:53:53,130 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:53:53,130 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:53,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:53,131 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-27 14:53:53,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:53,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459131586] [2022-04-27 14:53:53,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:53,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:53,146 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:53,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989808714] [2022-04-27 14:53:53,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:53,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:53,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:53,148 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:53:53,154 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:53:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:53,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:53:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:53,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:53,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2022-04-27 14:53:53,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {784#true} is VALID [2022-04-27 14:53:53,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:53:53,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #63#return; {784#true} is VALID [2022-04-27 14:53:53,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2022-04-27 14:53:53,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {784#true} is VALID [2022-04-27 14:53:53,560 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {784#true} is VALID [2022-04-27 14:53:53,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:53:53,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:53:53,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:53:53,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} #53#return; {784#true} is VALID [2022-04-27 14:53:53,561 INFO L272 TraceCheckUtils]: 11: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {784#true} is VALID [2022-04-27 14:53:53,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:53:53,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:53:53,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:53:53,562 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} #55#return; {784#true} is VALID [2022-04-27 14:53:53,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:53,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:53,574 INFO L272 TraceCheckUtils]: 18: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:53:53,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:53:53,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:53:53,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:53:53,575 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {784#true} {837#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:53,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:53:53,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:53:53,577 INFO L272 TraceCheckUtils]: 25: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:53:53,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:53:53,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:53:53,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:53:53,578 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {784#true} {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:53:53,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:53:53,579 INFO L272 TraceCheckUtils]: 31: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {784#true} is VALID [2022-04-27 14:53:53,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-27 14:53:53,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-27 14:53:53,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-27 14:53:53,580 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {784#true} {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:53:53,582 INFO L272 TraceCheckUtils]: 36: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:53,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:53,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {785#false} is VALID [2022-04-27 14:53:53,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-27 14:53:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 14:53:53,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:53:53,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:53,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459131586] [2022-04-27 14:53:53,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:53,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989808714] [2022-04-27 14:53:53,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989808714] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:53:53,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:53:53,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:53:53,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938858829] [2022-04-27 14:53:53,992 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:53:53,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 14:53:53,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:53,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:53:54,021 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:53:54,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:53:54,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:54,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:53:54,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:53:54,041 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:53:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:54,293 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 14:53:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:53:54,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 14:53:54,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:53:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 14:53:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:53:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 14:53:54,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-27 14:53:54,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:54,345 INFO L225 Difference]: With dead ends: 42 [2022-04-27 14:53:54,345 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:53:54,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:53:54,346 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:54,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:53:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:53:54,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 14:53:54,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:54,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:53:54,358 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:53:54,358 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:53:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:54,360 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 14:53:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:53:54,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:54,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:54,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 14:53:54,362 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 14:53:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:54,364 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 14:53:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:53:54,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:54,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:54,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:54,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:53:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-27 14:53:54,367 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-27 14:53:54,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:54,367 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-27 14:53:54,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 14:53:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 14:53:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 14:53:54,369 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:54,369 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:54,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 14:53:54,591 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:53:54,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:54,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 2 times [2022-04-27 14:53:54,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:54,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311174210] [2022-04-27 14:53:54,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:54,608 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:54,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592058608] [2022-04-27 14:53:54,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:53:54,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:54,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:54,610 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:53:54,631 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:53:54,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:53:54,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:53:54,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:53:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:54,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:55,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {1160#true} call ULTIMATE.init(); {1160#true} is VALID [2022-04-27 14:53:55,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {1160#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1160#true} is VALID [2022-04-27 14:53:55,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:55,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} #63#return; {1160#true} is VALID [2022-04-27 14:53:55,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {1160#true} call #t~ret5 := main(); {1160#true} is VALID [2022-04-27 14:53:55,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {1160#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1160#true} is VALID [2022-04-27 14:53:55,056 INFO L272 TraceCheckUtils]: 6: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:53:55,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:53:55,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:53:55,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:55,057 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1160#true} {1160#true} #53#return; {1160#true} is VALID [2022-04-27 14:53:55,057 INFO L272 TraceCheckUtils]: 11: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:53:55,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:53:55,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:53:55,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:55,058 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1160#true} {1160#true} #55#return; {1160#true} is VALID [2022-04-27 14:53:55,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {1160#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:55,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:55,059 INFO L272 TraceCheckUtils]: 18: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:53:55,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:53:55,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:53:55,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:55,060 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1160#true} {1213#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:55,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:53:55,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:53:55,061 INFO L272 TraceCheckUtils]: 25: Hoare triple {1235#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:53:55,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:53:55,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:53:55,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:55,064 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1160#true} {1235#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:53:55,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {1235#(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 * ~y~0 + ~x~0; {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:53:55,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:53:55,067 INFO L272 TraceCheckUtils]: 32: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:53:55,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:53:55,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:53:55,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:55,070 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1160#true} {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #57#return; {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:53:55,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 14:53:55,071 INFO L272 TraceCheckUtils]: 38: Hoare triple {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1160#true} is VALID [2022-04-27 14:53:55,071 INFO L290 TraceCheckUtils]: 39: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-27 14:53:55,071 INFO L290 TraceCheckUtils]: 40: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-27 14:53:55,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-27 14:53:55,072 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1160#true} {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} #59#return; {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 14:53:55,073 INFO L272 TraceCheckUtils]: 43: Hoare triple {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:55,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:55,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1161#false} is VALID [2022-04-27 14:53:55,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {1161#false} assume !false; {1161#false} is VALID [2022-04-27 14:53:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 14:53:55,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:53:55,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:55,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311174210] [2022-04-27 14:53:55,464 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:55,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592058608] [2022-04-27 14:53:55,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592058608] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:53:55,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:53:55,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:53:55,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082290915] [2022-04-27 14:53:55,464 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:53:55,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 14:53:55,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:55,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:53:55,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:55,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:53:55,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:55,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:53:55,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:53:55,500 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:53:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:55,794 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-27 14:53:55,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:53:55,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 14:53:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:53:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 14:53:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:53:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 14:53:55,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-27 14:53:55,836 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:53:55,838 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:53:55,838 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 14:53:55,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:53:55,839 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:55,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:53:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 14:53:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 14:53:55,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:55,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:53:55,851 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:53:55,851 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:53:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:55,853 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 14:53:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:53:55,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:55,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:55,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-27 14:53:55,854 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-27 14:53:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:55,856 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 14:53:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:53:55,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:55,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:55,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:55,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:53:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-27 14:53:55,859 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-27 14:53:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:55,860 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-27 14:53:55,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:53:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 14:53:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 14:53:55,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:55,861 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:55,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:53:56,067 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:53:56,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:56,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 3 times [2022-04-27 14:53:56,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:56,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403534037] [2022-04-27 14:53:56,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:56,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:56,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:56,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [145753329] [2022-04-27 14:53:56,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:53:56,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:56,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:56,085 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:53:56,094 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:53:56,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:53:56,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:53:56,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:53:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:56,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:56,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2022-04-27 14:53:56,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#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); {1574#true} is VALID [2022-04-27 14:53:56,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:56,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #63#return; {1574#true} is VALID [2022-04-27 14:53:56,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret5 := main(); {1574#true} is VALID [2022-04-27 14:53:56,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#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; {1574#true} is VALID [2022-04-27 14:53:56,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:56,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:56,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:56,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:56,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1574#true} {1574#true} #53#return; {1574#true} is VALID [2022-04-27 14:53:56,607 INFO L272 TraceCheckUtils]: 11: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:56,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:56,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:56,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:56,608 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1574#true} {1574#true} #55#return; {1574#true} is VALID [2022-04-27 14:53:56,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {1574#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1627#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:56,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {1627#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1627#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:56,609 INFO L272 TraceCheckUtils]: 18: Hoare triple {1627#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:56,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:56,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:56,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:56,610 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1574#true} {1627#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1627#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:56,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#(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 * ~y~0 + ~x~0; {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:53:56,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:53:56,611 INFO L272 TraceCheckUtils]: 25: Hoare triple {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:56,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:56,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:56,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:56,612 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1574#true} {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:53:56,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {1649#(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 * ~y~0 + ~x~0; {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:53:56,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:53:56,613 INFO L272 TraceCheckUtils]: 32: Hoare triple {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:56,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:56,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:56,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:56,614 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1574#true} {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #57#return; {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:53:56,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:53:56,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:53:56,615 INFO L272 TraceCheckUtils]: 39: Hoare triple {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:56,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:56,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:56,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:56,616 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1574#true} {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:53:56,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:53:56,617 INFO L272 TraceCheckUtils]: 45: Hoare triple {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1574#true} is VALID [2022-04-27 14:53:56,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-27 14:53:56,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-27 14:53:56,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-27 14:53:56,618 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1574#true} {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #59#return; {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:53:56,622 INFO L272 TraceCheckUtils]: 50: Hoare triple {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1734#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:56,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {1734#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1738#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:56,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {1738#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1575#false} is VALID [2022-04-27 14:53:56,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-27 14:53:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 14:53:56,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:53:56,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:56,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403534037] [2022-04-27 14:53:56,969 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:56,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145753329] [2022-04-27 14:53:56,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145753329] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:53:56,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:53:56,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:53:56,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050220250] [2022-04-27 14:53:56,970 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:53:56,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 14:53:56,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:56,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:53:57,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:57,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:53:57,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:57,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:53:57,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:53:57,007 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:53:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:57,387 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-27 14:53:57,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:53:57,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 14:53:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:53:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 14:53:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:53:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 14:53:57,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-27 14:53:57,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:57,440 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:53:57,440 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 14:53:57,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:53:57,441 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:57,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:53:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 14:53:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-27 14:53:57,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:57,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:53:57,454 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:53:57,455 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:53:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:57,457 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 14:53:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:53:57,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:57,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:57,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-27 14:53:57,458 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-27 14:53:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:57,460 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 14:53:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:53:57,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:57,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:57,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:57,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:53:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-27 14:53:57,462 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-27 14:53:57,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:57,462 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-27 14:53:57,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:53:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 14:53:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 14:53:57,464 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:57,464 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:57,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 14:53:57,670 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:53:57,670 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:57,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:57,670 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 4 times [2022-04-27 14:53:57,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:57,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867747005] [2022-04-27 14:53:57,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:57,683 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:57,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207726587] [2022-04-27 14:53:57,683 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:53:57,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:57,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:57,684 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:53:57,708 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:53:57,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:53:57,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:53:57,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:53:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:57,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:53:58,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2026#true} is VALID [2022-04-27 14:53:58,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {2026#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); {2026#true} is VALID [2022-04-27 14:53:58,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:58,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #63#return; {2026#true} is VALID [2022-04-27 14:53:58,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret5 := main(); {2026#true} is VALID [2022-04-27 14:53:58,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {2026#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; {2026#true} is VALID [2022-04-27 14:53:58,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {2026#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:58,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:58,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:58,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:58,152 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2026#true} {2026#true} #53#return; {2026#true} is VALID [2022-04-27 14:53:58,152 INFO L272 TraceCheckUtils]: 11: Hoare triple {2026#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:58,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:58,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:58,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:58,153 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2026#true} {2026#true} #55#return; {2026#true} is VALID [2022-04-27 14:53:58,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {2026#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:58,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {2079#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:58,154 INFO L272 TraceCheckUtils]: 18: Hoare triple {2079#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:58,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:58,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:58,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:58,155 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2026#true} {2079#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:53:58,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {2079#(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 * ~y~0 + ~x~0; {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:53:58,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:53:58,156 INFO L272 TraceCheckUtils]: 25: Hoare triple {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:58,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:58,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:58,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:58,158 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2026#true} {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:53:58,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:53:58,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:53:58,159 INFO L272 TraceCheckUtils]: 32: Hoare triple {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:58,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:58,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:58,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:58,160 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2026#true} {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:53:58,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:53:58,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:53:58,161 INFO L272 TraceCheckUtils]: 39: Hoare triple {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:58,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:58,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:58,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:58,162 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2026#true} {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #57#return; {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:53:58,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:53:58,163 INFO L290 TraceCheckUtils]: 45: Hoare triple {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:53:58,163 INFO L272 TraceCheckUtils]: 46: Hoare triple {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:58,163 INFO L290 TraceCheckUtils]: 47: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:58,163 INFO L290 TraceCheckUtils]: 48: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:58,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:58,165 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2026#true} {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:53:58,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:53:58,166 INFO L272 TraceCheckUtils]: 52: Hoare triple {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2026#true} is VALID [2022-04-27 14:53:58,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-27 14:53:58,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-27 14:53:58,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-27 14:53:58,167 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2026#true} {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:53:58,168 INFO L272 TraceCheckUtils]: 57: Hoare triple {2189#(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)); {2208#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:53:58,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {2208#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2212#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:53:58,169 INFO L290 TraceCheckUtils]: 59: Hoare triple {2212#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2027#false} is VALID [2022-04-27 14:53:58,169 INFO L290 TraceCheckUtils]: 60: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2022-04-27 14:53:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 14:53:58,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:53:58,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:53:58,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867747005] [2022-04-27 14:53:58,465 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:53:58,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207726587] [2022-04-27 14:53:58,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207726587] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:53:58,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:53:58,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:53:58,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995191043] [2022-04-27 14:53:58,465 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:53:58,466 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 14:53:58,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:53:58,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:53:58,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:53:58,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:53:58,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:53:58,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:53:58,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:53:58,504 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:53:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:58,948 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-27 14:53:58,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:53:58,948 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 14:53:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:53:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:53:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 14:53:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:53:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 14:53:58,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-27 14:53:59,000 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:53:59,002 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:53:59,002 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:53:59,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:53:59,003 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:53:59,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:53:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:53:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:53:59,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:53:59,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:53:59,019 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:53:59,019 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:53:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:59,021 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:53:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:53:59,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:59,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:59,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 14:53:59,022 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 14:53:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:53:59,024 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:53:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:53:59,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:53:59,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:53:59,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:53:59,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:53:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:53:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-27 14:53:59,026 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-27 14:53:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:53:59,027 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-27 14:53:59,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 14:53:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:53:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 14:53:59,028 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:53:59,028 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:53:59,050 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:53:59,243 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:53:59,244 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:53:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:53:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 5 times [2022-04-27 14:53:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:53:59,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641015295] [2022-04-27 14:53:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:53:59,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:53:59,257 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:53:59,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696064352] [2022-04-27 14:53:59,258 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:53:59,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:53:59,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:53:59,259 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:53:59,264 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:53:59,798 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:53:59,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:53:59,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:53:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:53:59,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:00,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {2516#true} call ULTIMATE.init(); {2516#true} is VALID [2022-04-27 14:54:00,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {2516#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); {2516#true} is VALID [2022-04-27 14:54:00,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:54:00,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2516#true} {2516#true} #63#return; {2516#true} is VALID [2022-04-27 14:54:00,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {2516#true} call #t~ret5 := main(); {2516#true} is VALID [2022-04-27 14:54:00,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {2516#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; {2516#true} is VALID [2022-04-27 14:54:00,279 INFO L272 TraceCheckUtils]: 6: Hoare triple {2516#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:54:00,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:54:00,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:54:00,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:54:00,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2516#true} {2516#true} #53#return; {2516#true} is VALID [2022-04-27 14:54:00,279 INFO L272 TraceCheckUtils]: 11: Hoare triple {2516#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:54:00,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:54:00,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:54:00,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:54:00,280 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2516#true} {2516#true} #55#return; {2516#true} is VALID [2022-04-27 14:54:00,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {2516#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2569#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:00,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {2569#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2569#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:00,285 INFO L272 TraceCheckUtils]: 18: Hoare triple {2569#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:54:00,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:54:00,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:54:00,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:54:00,286 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2516#true} {2569#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2569#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:00,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {2569#(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 * ~y~0 + ~x~0; {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:00,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:00,288 INFO L272 TraceCheckUtils]: 25: Hoare triple {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:54:00,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:54:00,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:54:00,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:54:00,289 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2516#true} {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:00,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {2591#(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 * ~y~0 + ~x~0; {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:54:00,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:54:00,290 INFO L272 TraceCheckUtils]: 32: Hoare triple {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:54:00,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:54:00,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:54:00,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:54:00,290 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2516#true} {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:54:00,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:54:00,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:54:00,292 INFO L272 TraceCheckUtils]: 39: Hoare triple {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:54:00,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:54:00,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:54:00,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:54:00,292 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2516#true} {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:54:00,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {2635#(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 * ~y~0 + ~x~0; {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:54:00,293 INFO L290 TraceCheckUtils]: 45: Hoare triple {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:54:00,294 INFO L272 TraceCheckUtils]: 46: Hoare triple {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:54:00,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:54:00,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:54:00,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:54:00,294 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2516#true} {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:54:00,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:00,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:00,296 INFO L272 TraceCheckUtils]: 53: Hoare triple {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:54:00,296 INFO L290 TraceCheckUtils]: 54: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:54:00,296 INFO L290 TraceCheckUtils]: 55: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:54:00,296 INFO L290 TraceCheckUtils]: 56: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:54:00,296 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2516#true} {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:00,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:00,297 INFO L272 TraceCheckUtils]: 59: Hoare triple {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2516#true} is VALID [2022-04-27 14:54:00,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-27 14:54:00,298 INFO L290 TraceCheckUtils]: 61: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-27 14:54:00,298 INFO L290 TraceCheckUtils]: 62: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 14:54:00,303 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2516#true} {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #59#return; {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:00,304 INFO L272 TraceCheckUtils]: 64: Hoare triple {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:00,304 INFO L290 TraceCheckUtils]: 65: Hoare triple {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:00,305 INFO L290 TraceCheckUtils]: 66: Hoare triple {2724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2517#false} is VALID [2022-04-27 14:54:00,305 INFO L290 TraceCheckUtils]: 67: Hoare triple {2517#false} assume !false; {2517#false} is VALID [2022-04-27 14:54:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-27 14:54:00,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:00,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:00,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641015295] [2022-04-27 14:54:00,605 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:00,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696064352] [2022-04-27 14:54:00,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696064352] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:00,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:00,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:54:00,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912430723] [2022-04-27 14:54:00,606 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:00,606 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 14:54:00,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:00,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:54:00,646 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:54:00,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:54:00,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:00,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:54:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:54:00,647 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:54:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:01,189 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 14:54:01,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:54:01,190 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 14:54:01,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:54:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 14:54:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:54:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-27 14:54:01,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-27 14:54:01,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:01,248 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:54:01,248 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 14:54:01,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:54:01,249 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:01,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:54:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 14:54:01,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 14:54:01,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:01,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:54:01,266 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:54:01,267 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:54:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:01,269 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 14:54:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:54:01,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:01,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:01,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-27 14:54:01,270 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-27 14:54:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:01,272 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 14:54:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:54:01,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:01,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:01,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:01,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:54:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-27 14:54:01,274 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-27 14:54:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:01,275 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-27 14:54:01,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 14:54:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 14:54:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 14:54:01,277 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:01,277 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:01,283 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:54:01,483 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:54:01,483 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:01,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:01,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 6 times [2022-04-27 14:54:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:01,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580143085] [2022-04-27 14:54:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:01,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:01,497 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:01,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812640433] [2022-04-27 14:54:01,497 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:54:01,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:01,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:01,498 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:54:01,503 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:54:01,913 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:54:01,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:01,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-27 14:54:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:01,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:02,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {3044#true} call ULTIMATE.init(); {3044#true} is VALID [2022-04-27 14:54:02,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {3044#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); {3044#true} is VALID [2022-04-27 14:54:02,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:54:02,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3044#true} {3044#true} #63#return; {3044#true} is VALID [2022-04-27 14:54:02,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {3044#true} call #t~ret5 := main(); {3044#true} is VALID [2022-04-27 14:54:02,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {3044#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; {3044#true} is VALID [2022-04-27 14:54:02,501 INFO L272 TraceCheckUtils]: 6: Hoare triple {3044#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:54:02,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:54:02,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:54:02,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:54:02,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3044#true} {3044#true} #53#return; {3044#true} is VALID [2022-04-27 14:54:02,502 INFO L272 TraceCheckUtils]: 11: Hoare triple {3044#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:54:02,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:54:02,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:54:02,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:54:02,502 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3044#true} {3044#true} #55#return; {3044#true} is VALID [2022-04-27 14:54:02,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {3044#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:02,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {3097#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:02,503 INFO L272 TraceCheckUtils]: 18: Hoare triple {3097#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:54:02,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:54:02,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:54:02,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:54:02,504 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3044#true} {3097#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:02,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {3097#(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 * ~y~0 + ~x~0; {3119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:02,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {3119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {3119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:02,504 INFO L272 TraceCheckUtils]: 25: Hoare triple {3119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:54:02,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:54:02,505 INFO L290 TraceCheckUtils]: 27: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:54:02,505 INFO L290 TraceCheckUtils]: 28: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:54:02,505 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3044#true} {3119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {3119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:54:02,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {3119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:02,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:02,506 INFO L272 TraceCheckUtils]: 32: Hoare triple {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:54:02,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:54:02,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:54:02,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:54:02,507 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3044#true} {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} #57#return; {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:02,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 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 * ~y~0 + ~x~0; {3163#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} is VALID [2022-04-27 14:54:02,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {3163#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} assume !false; {3163#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} is VALID [2022-04-27 14:54:02,509 INFO L272 TraceCheckUtils]: 39: Hoare triple {3163#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:54:02,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:54:02,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:54:02,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:54:02,510 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3044#true} {3163#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} #57#return; {3163#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} is VALID [2022-04-27 14:54:02,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {3163#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3185#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 14:54:02,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {3185#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 14:54:02,511 INFO L272 TraceCheckUtils]: 46: Hoare triple {3185#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:54:02,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:54:02,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:54:02,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:54:02,512 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3044#true} {3185#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} #57#return; {3185#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 14:54:02,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {3185#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:02,513 INFO L290 TraceCheckUtils]: 52: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} assume !false; {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:02,513 INFO L272 TraceCheckUtils]: 53: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:54:02,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:54:02,514 INFO L290 TraceCheckUtils]: 55: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:54:02,514 INFO L290 TraceCheckUtils]: 56: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:54:02,515 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3044#true} {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} #57#return; {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:02,516 INFO L290 TraceCheckUtils]: 58: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 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 * ~y~0 + ~x~0; {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:54:02,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:54:02,516 INFO L272 TraceCheckUtils]: 60: Hoare triple {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:54:02,516 INFO L290 TraceCheckUtils]: 61: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:54:02,516 INFO L290 TraceCheckUtils]: 62: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:54:02,516 INFO L290 TraceCheckUtils]: 63: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:54:02,517 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3044#true} {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:54:02,517 INFO L290 TraceCheckUtils]: 65: Hoare triple {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:54:02,517 INFO L272 TraceCheckUtils]: 66: Hoare triple {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-27 14:54:02,518 INFO L290 TraceCheckUtils]: 67: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-27 14:54:02,518 INFO L290 TraceCheckUtils]: 68: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-27 14:54:02,518 INFO L290 TraceCheckUtils]: 69: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-27 14:54:02,518 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3044#true} {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:54:02,519 INFO L272 TraceCheckUtils]: 71: Hoare triple {3251#(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)); {3270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:02,519 INFO L290 TraceCheckUtils]: 72: Hoare triple {3270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:02,519 INFO L290 TraceCheckUtils]: 73: Hoare triple {3274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3045#false} is VALID [2022-04-27 14:54:02,520 INFO L290 TraceCheckUtils]: 74: Hoare triple {3045#false} assume !false; {3045#false} is VALID [2022-04-27 14:54:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-27 14:54:02,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:03,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:03,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580143085] [2022-04-27 14:54:03,479 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:03,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812640433] [2022-04-27 14:54:03,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812640433] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:03,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:03,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:54:03,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545516900] [2022-04-27 14:54:03,480 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:03,480 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-27 14:54:03,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:03,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:54:03,520 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:54:03,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:54:03,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:03,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:54:03,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:54:03,521 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:54:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:04,241 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-27 14:54:04,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:54:04,242 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-27 14:54:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:54:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-27 14:54:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:54:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-27 14:54:04,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-27 14:54:04,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:04,296 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:54:04,296 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 14:54:04,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:54:04,297 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:04,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:54:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 14:54:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 14:54:04,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:04,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:54:04,320 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:54:04,320 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:54:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:04,322 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-27 14:54:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 14:54:04,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:04,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:04,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-27 14:54:04,323 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-27 14:54:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:04,325 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-27 14:54:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 14:54:04,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:04,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:04,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:04,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:54:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-27 14:54:04,327 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-27 14:54:04,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:04,328 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-27 14:54:04,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 14:54:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 14:54:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 14:54:04,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:04,329 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:04,339 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:54:04,535 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:54:04,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 7 times [2022-04-27 14:54:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:04,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473858210] [2022-04-27 14:54:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:04,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:04,562 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:04,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303404879] [2022-04-27 14:54:04,563 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:54:04,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:04,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:04,566 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:54:04,593 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:54:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:54,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 14:54:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:55,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:55,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {3720#true} call ULTIMATE.init(); {3720#true} is VALID [2022-04-27 14:54:55,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {3720#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3720#true} is VALID [2022-04-27 14:54:55,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-27 14:54:55,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3720#true} {3720#true} #63#return; {3720#true} is VALID [2022-04-27 14:54:55,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {3720#true} call #t~ret5 := main(); {3720#true} is VALID [2022-04-27 14:54:55,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {3720#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3720#true} is VALID [2022-04-27 14:54:55,510 INFO L272 TraceCheckUtils]: 6: Hoare triple {3720#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {3720#true} is VALID [2022-04-27 14:54:55,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-27 14:54:55,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-27 14:54:55,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-27 14:54:55,510 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3720#true} {3720#true} #53#return; {3720#true} is VALID [2022-04-27 14:54:55,510 INFO L272 TraceCheckUtils]: 11: Hoare triple {3720#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3720#true} is VALID [2022-04-27 14:54:55,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-27 14:54:55,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-27 14:54:55,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-27 14:54:55,511 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3720#true} {3720#true} #55#return; {3720#true} is VALID [2022-04-27 14:54:55,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {3720#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3773#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:55,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {3773#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3773#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:55,512 INFO L272 TraceCheckUtils]: 18: Hoare triple {3773#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3720#true} is VALID [2022-04-27 14:54:55,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-27 14:54:55,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-27 14:54:55,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-27 14:54:55,513 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3720#true} {3773#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3773#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:55,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {3773#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3795#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:54:55,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {3795#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {3795#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:54:55,514 INFO L272 TraceCheckUtils]: 25: Hoare triple {3795#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3720#true} is VALID [2022-04-27 14:54:55,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-27 14:54:55,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-27 14:54:55,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-27 14:54:55,515 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3720#true} {3795#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {3795#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:54:55,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {3795#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3817#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:54:55,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {3817#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {3817#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:54:55,516 INFO L272 TraceCheckUtils]: 32: Hoare triple {3817#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3720#true} is VALID [2022-04-27 14:54:55,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-27 14:54:55,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-27 14:54:55,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-27 14:54:55,517 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3720#true} {3817#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {3817#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:54:55,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {3817#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:54:55,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:54:55,518 INFO L272 TraceCheckUtils]: 39: Hoare triple {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3720#true} is VALID [2022-04-27 14:54:55,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-27 14:54:55,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-27 14:54:55,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-27 14:54:55,519 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3720#true} {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:54:55,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {3839#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:54:55,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:54:55,520 INFO L272 TraceCheckUtils]: 46: Hoare triple {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3720#true} is VALID [2022-04-27 14:54:55,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-27 14:54:55,520 INFO L290 TraceCheckUtils]: 48: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-27 14:54:55,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-27 14:54:55,521 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3720#true} {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:54:55,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {3861#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:54:55,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:54:55,522 INFO L272 TraceCheckUtils]: 53: Hoare triple {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3720#true} is VALID [2022-04-27 14:54:55,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-27 14:54:55,544 INFO L290 TraceCheckUtils]: 55: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-27 14:54:55,544 INFO L290 TraceCheckUtils]: 56: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-27 14:54:55,551 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3720#true} {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #57#return; {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:54:55,551 INFO L290 TraceCheckUtils]: 58: Hoare triple {3883#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3905#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:54:55,552 INFO L290 TraceCheckUtils]: 59: Hoare triple {3905#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {3905#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:54:55,552 INFO L272 TraceCheckUtils]: 60: Hoare triple {3905#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3720#true} is VALID [2022-04-27 14:54:55,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-27 14:54:55,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-27 14:54:55,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-27 14:54:55,553 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3720#true} {3905#(and (= main_~y~0 6) (= main_~c~0 6))} #57#return; {3905#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:54:55,553 INFO L290 TraceCheckUtils]: 65: Hoare triple {3905#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:54:55,554 INFO L290 TraceCheckUtils]: 66: Hoare triple {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:54:55,554 INFO L272 TraceCheckUtils]: 67: Hoare triple {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3720#true} is VALID [2022-04-27 14:54:55,554 INFO L290 TraceCheckUtils]: 68: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-27 14:54:55,554 INFO L290 TraceCheckUtils]: 69: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-27 14:54:55,554 INFO L290 TraceCheckUtils]: 70: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-27 14:54:55,555 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3720#true} {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:54:55,555 INFO L290 TraceCheckUtils]: 72: Hoare triple {3927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3949#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:54:55,555 INFO L272 TraceCheckUtils]: 73: Hoare triple {3949#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3720#true} is VALID [2022-04-27 14:54:55,556 INFO L290 TraceCheckUtils]: 74: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-27 14:54:55,556 INFO L290 TraceCheckUtils]: 75: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-27 14:54:55,556 INFO L290 TraceCheckUtils]: 76: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-27 14:54:55,556 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3720#true} {3949#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #59#return; {3949#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:54:55,557 INFO L272 TraceCheckUtils]: 78: Hoare triple {3949#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3968#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:55,557 INFO L290 TraceCheckUtils]: 79: Hoare triple {3968#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3972#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:55,558 INFO L290 TraceCheckUtils]: 80: Hoare triple {3972#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3721#false} is VALID [2022-04-27 14:54:55,558 INFO L290 TraceCheckUtils]: 81: Hoare triple {3721#false} assume !false; {3721#false} is VALID [2022-04-27 14:54:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-27 14:54:55,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:55,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:55,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473858210] [2022-04-27 14:54:55,946 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:55,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303404879] [2022-04-27 14:54:55,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303404879] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:55,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:55,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:54:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379550886] [2022-04-27 14:54:55,947 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:55,949 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-27 14:54:55,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:55,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:54:55,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:55,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:54:55,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:55,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:54:55,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:54:55,993 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:54:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:56,697 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-27 14:54:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:54:56,698 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-27 14:54:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:54:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-27 14:54:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:54:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-27 14:54:56,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-27 14:54:56,754 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:54:56,754 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:54:56,754 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 14:54:56,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:54:56,755 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:56,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:54:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 14:54:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 14:54:56,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:56,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:54:56,787 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:54:56,787 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:54:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:56,789 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-27 14:54:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:54:56,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:56,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:56,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-27 14:54:56,790 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-27 14:54:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:56,792 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-27 14:54:56,792 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:54:56,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:56,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:56,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:56,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:54:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-27 14:54:56,794 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-27 14:54:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:56,794 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-27 14:54:56,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 14:54:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:54:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-27 14:54:56,795 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:56,795 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:56,836 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:54:57,011 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:54:57,011 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:57,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:57,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 8 times [2022-04-27 14:54:57,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:57,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325217448] [2022-04-27 14:54:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:57,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:57,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:57,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118349300] [2022-04-27 14:54:57,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:54:57,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:57,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:57,035 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:54:57,048 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:54:57,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:54:57,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:57,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:54:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:57,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:58,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {4324#true} call ULTIMATE.init(); {4324#true} is VALID [2022-04-27 14:54:58,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {4324#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {4324#true} is VALID [2022-04-27 14:54:58,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4324#true} {4324#true} #63#return; {4324#true} is VALID [2022-04-27 14:54:58,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {4324#true} call #t~ret5 := main(); {4324#true} is VALID [2022-04-27 14:54:58,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {4324#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4324#true} is VALID [2022-04-27 14:54:58,269 INFO L272 TraceCheckUtils]: 6: Hoare triple {4324#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {4324#true} is VALID [2022-04-27 14:54:58,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-27 14:54:58,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-27 14:54:58,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4324#true} {4324#true} #53#return; {4324#true} is VALID [2022-04-27 14:54:58,270 INFO L272 TraceCheckUtils]: 11: Hoare triple {4324#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4324#true} is VALID [2022-04-27 14:54:58,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-27 14:54:58,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-27 14:54:58,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,270 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4324#true} {4324#true} #55#return; {4324#true} is VALID [2022-04-27 14:54:58,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {4324#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4377#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:58,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {4377#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4377#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:58,271 INFO L272 TraceCheckUtils]: 18: Hoare triple {4377#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4324#true} is VALID [2022-04-27 14:54:58,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-27 14:54:58,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-27 14:54:58,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,272 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4324#true} {4377#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4377#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:58,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {4377#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:58,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:58,274 INFO L272 TraceCheckUtils]: 25: Hoare triple {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4324#true} is VALID [2022-04-27 14:54:58,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-27 14:54:58,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-27 14:54:58,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,274 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4324#true} {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:58,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {4399#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:58,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:58,276 INFO L272 TraceCheckUtils]: 32: Hoare triple {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4324#true} is VALID [2022-04-27 14:54:58,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-27 14:54:58,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-27 14:54:58,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,276 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4324#true} {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #57#return; {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:58,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {4421#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4443#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:58,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {4443#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4443#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:58,278 INFO L272 TraceCheckUtils]: 39: Hoare triple {4443#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4324#true} is VALID [2022-04-27 14:54:58,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-27 14:54:58,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-27 14:54:58,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,278 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4324#true} {4443#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {4443#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:58,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {4443#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:54:58,279 INFO L290 TraceCheckUtils]: 45: Hoare triple {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:54:58,279 INFO L272 TraceCheckUtils]: 46: Hoare triple {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4324#true} is VALID [2022-04-27 14:54:58,280 INFO L290 TraceCheckUtils]: 47: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-27 14:54:58,280 INFO L290 TraceCheckUtils]: 48: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-27 14:54:58,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,280 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4324#true} {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #57#return; {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:54:58,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {4465#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:54:58,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:54:58,281 INFO L272 TraceCheckUtils]: 53: Hoare triple {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4324#true} is VALID [2022-04-27 14:54:58,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-27 14:54:58,282 INFO L290 TraceCheckUtils]: 55: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-27 14:54:58,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,282 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4324#true} {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #57#return; {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:54:58,283 INFO L290 TraceCheckUtils]: 58: Hoare triple {4487#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:54:58,283 INFO L290 TraceCheckUtils]: 59: Hoare triple {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:54:58,283 INFO L272 TraceCheckUtils]: 60: Hoare triple {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4324#true} is VALID [2022-04-27 14:54:58,284 INFO L290 TraceCheckUtils]: 61: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-27 14:54:58,284 INFO L290 TraceCheckUtils]: 62: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-27 14:54:58,284 INFO L290 TraceCheckUtils]: 63: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,284 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4324#true} {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #57#return; {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:54:58,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {4509#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:54:58,285 INFO L290 TraceCheckUtils]: 66: Hoare triple {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:54:58,285 INFO L272 TraceCheckUtils]: 67: Hoare triple {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4324#true} is VALID [2022-04-27 14:54:58,285 INFO L290 TraceCheckUtils]: 68: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-27 14:54:58,286 INFO L290 TraceCheckUtils]: 69: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-27 14:54:58,286 INFO L290 TraceCheckUtils]: 70: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,286 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4324#true} {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} #57#return; {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:54:58,287 INFO L290 TraceCheckUtils]: 72: Hoare triple {4531#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:54:58,287 INFO L290 TraceCheckUtils]: 73: Hoare triple {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:54:58,287 INFO L272 TraceCheckUtils]: 74: Hoare triple {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4324#true} is VALID [2022-04-27 14:54:58,287 INFO L290 TraceCheckUtils]: 75: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-27 14:54:58,288 INFO L290 TraceCheckUtils]: 76: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-27 14:54:58,288 INFO L290 TraceCheckUtils]: 77: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,288 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4324#true} {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #57#return; {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:54:58,289 INFO L290 TraceCheckUtils]: 79: Hoare triple {4553#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4575#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:54:58,289 INFO L272 TraceCheckUtils]: 80: Hoare triple {4575#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4324#true} is VALID [2022-04-27 14:54:58,289 INFO L290 TraceCheckUtils]: 81: Hoare triple {4324#true} ~cond := #in~cond; {4324#true} is VALID [2022-04-27 14:54:58,289 INFO L290 TraceCheckUtils]: 82: Hoare triple {4324#true} assume !(0 == ~cond); {4324#true} is VALID [2022-04-27 14:54:58,290 INFO L290 TraceCheckUtils]: 83: Hoare triple {4324#true} assume true; {4324#true} is VALID [2022-04-27 14:54:58,291 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4324#true} {4575#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #59#return; {4575#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:54:58,291 INFO L272 TraceCheckUtils]: 85: Hoare triple {4575#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:58,292 INFO L290 TraceCheckUtils]: 86: Hoare triple {4594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:58,292 INFO L290 TraceCheckUtils]: 87: Hoare triple {4598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4325#false} is VALID [2022-04-27 14:54:58,292 INFO L290 TraceCheckUtils]: 88: Hoare triple {4325#false} assume !false; {4325#false} is VALID [2022-04-27 14:54:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-27 14:54:58,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:58,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325217448] [2022-04-27 14:54:58,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:58,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118349300] [2022-04-27 14:54:58,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118349300] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:58,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:58,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:54:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756924890] [2022-04-27 14:54:58,593 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:58,593 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-27 14:54:58,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:58,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:54:58,646 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:54:58,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:54:58,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:58,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:54:58,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:54:58,647 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:54:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:59,479 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-27 14:54:59,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:54:59,480 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-27 14:54:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:54:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-27 14:54:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:54:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-27 14:54:59,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-27 14:54:59,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:59,533 INFO L225 Difference]: With dead ends: 63 [2022-04-27 14:54:59,533 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 14:54:59,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:54:59,534 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:59,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:54:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 14:54:59,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-27 14:54:59,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:59,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:54:59,559 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:54:59,559 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:54:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:59,562 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-27 14:54:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 14:54:59,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:59,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:59,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-27 14:54:59,563 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-27 14:54:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:59,564 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-27 14:54:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 14:54:59,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:59,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:59,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:59,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:54:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-27 14:54:59,567 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-27 14:54:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:59,567 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-27 14:54:59,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 14:54:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 14:54:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-27 14:54:59,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:59,568 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:59,576 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:54:59,774 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:54:59,774 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:59,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:59,775 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 9 times [2022-04-27 14:54:59,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:59,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386326358] [2022-04-27 14:54:59,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:59,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:59,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111818858] [2022-04-27 14:54:59,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:54:59,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:59,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:59,801 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:54:59,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process