/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/ps5-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:57:11,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:57:11,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:57:11,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:57:11,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:57:11,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:57:11,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:57:11,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:57:11,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:57:11,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:57:11,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:57:11,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:57:11,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:57:11,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:57:11,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:57:11,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:57:11,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:57:11,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:57:11,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:57:11,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:57:11,123 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:57:11,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:57:11,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:57:11,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:57:11,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:57:11,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:57:11,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:57:11,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:57:11,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:57:11,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:57:11,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:57:11,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:57:11,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:57:11,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:57:11,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:57:11,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:57:11,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:57:11,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:57:11,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:57:11,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:57:11,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:57:11,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:57:11,138 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 11:57:11,160 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:57:11,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:57:11,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:57:11,160 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:57:11,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:57:11,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:57:11,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:57:11,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:57:11,161 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:57:11,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:57:11,162 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:57:11,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:57:11,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:57:11,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:57:11,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:57:11,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:57:11,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:57:11,163 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:57:11,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:57:11,164 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:57:11,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:57:11,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:57:11,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:57:11,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:57:11,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:57:11,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:57:11,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:57:11,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:57:11,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:57:11,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:57:11,165 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:57:11,165 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:57:11,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:57:11,165 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 11:57:11,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:57:11,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:57:11,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:57:11,354 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:57:11,354 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:57:11,355 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps5-ll.c [2022-04-27 11:57:11,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf5f30756/8def6eb03bd349519ba1f5b42035a813/FLAG745aa2d71 [2022-04-27 11:57:11,762 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:57:11,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps5-ll.c [2022-04-27 11:57:11,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf5f30756/8def6eb03bd349519ba1f5b42035a813/FLAG745aa2d71 [2022-04-27 11:57:12,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf5f30756/8def6eb03bd349519ba1f5b42035a813 [2022-04-27 11:57:12,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:57:12,194 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:57:12,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:57:12,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:57:12,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:57:12,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:57:12" (1/1) ... [2022-04-27 11:57:12,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8baf64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:57:12, skipping insertion in model container [2022-04-27 11:57:12,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:57:12" (1/1) ... [2022-04-27 11:57:12,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:57:12,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:57:12,335 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/ps5-ll.c[458,471] [2022-04-27 11:57:12,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:57:12,364 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:57:12,371 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/ps5-ll.c[458,471] [2022-04-27 11:57:12,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:57:12,384 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:57:12,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:57:12 WrapperNode [2022-04-27 11:57:12,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:57:12,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:57:12,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:57:12,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:57:12,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:57:12" (1/1) ... [2022-04-27 11:57:12,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:57:12" (1/1) ... [2022-04-27 11:57:12,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:57:12" (1/1) ... [2022-04-27 11:57:12,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:57:12" (1/1) ... [2022-04-27 11:57:12,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:57:12" (1/1) ... [2022-04-27 11:57:12,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:57:12" (1/1) ... [2022-04-27 11:57:12,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:57:12" (1/1) ... [2022-04-27 11:57:12,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:57:12,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:57:12,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:57:12,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:57:12,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:57:12" (1/1) ... [2022-04-27 11:57:12,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:57:12,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:57:12,428 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 11:57:12,435 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 11:57:12,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:57:12,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:57:12,457 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:57:12,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:57:12,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:57:12,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:57:12,457 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:57:12,457 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:57:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:57:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:57:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 11:57:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:57:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:57:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:57:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:57:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:57:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:57:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:57:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:57:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:57:12,498 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:57:12,499 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:57:12,596 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:57:12,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:57:12,602 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:57:12,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:57:12 BoogieIcfgContainer [2022-04-27 11:57:12,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:57:12,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:57:12,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:57:12,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:57:12,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:57:12" (1/3) ... [2022-04-27 11:57:12,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b547371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:57:12, skipping insertion in model container [2022-04-27 11:57:12,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:57:12" (2/3) ... [2022-04-27 11:57:12,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b547371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:57:12, skipping insertion in model container [2022-04-27 11:57:12,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:57:12" (3/3) ... [2022-04-27 11:57:12,609 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll.c [2022-04-27 11:57:12,619 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:57:12,619 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:57:12,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:57:12,656 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@23f8579a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4023b0cc [2022-04-27 11:57:12,656 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:57:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:57:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:57:12,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:57:12,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:57:12,668 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:57:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:57:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-27 11:57:12,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:57:12,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038211913] [2022-04-27 11:57:12,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:57:12,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:57:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:57:12,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:57:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:57:12,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(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); {31#true} is VALID [2022-04-27 11:57:12,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 11:57:12,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 11:57:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:57:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:57:12,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 11:57:12,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 11:57:12,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 11:57:12,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 11:57:12,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:57:12,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(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); {31#true} is VALID [2022-04-27 11:57:12,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 11:57:12,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 11:57:12,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-27 11:57:12,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#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; {31#true} is VALID [2022-04-27 11:57:12,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {31#true} is VALID [2022-04-27 11:57:12,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 11:57:12,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 11:57:12,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 11:57:12,816 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 11:57:12,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-27 11:57:12,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-27 11:57:12,816 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-27 11:57:12,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-27 11:57:12,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-27 11:57:12,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-27 11:57:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:57:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:57:12,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038211913] [2022-04-27 11:57:12,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038211913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:57:12,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:57:12,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:57:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200572077] [2022-04-27 11:57:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:57:12,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:57:12,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:57:12,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:57:12,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:57:12,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:57:12,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:57:12,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:57:12,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:57:12,885 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:57:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:12,961 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 11:57:12,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:57:12,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:57:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:57:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:57:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 11:57:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:57:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 11:57:12,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-27 11:57:13,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:57:13,046 INFO L225 Difference]: With dead ends: 47 [2022-04-27 11:57:13,046 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 11:57:13,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:57:13,057 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:57:13,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:57:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 11:57:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 11:57:13,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:57:13,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:57:13,097 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:57:13,098 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:57:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:13,110 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 11:57:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 11:57:13,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:57:13,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:57:13,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 11:57:13,111 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 11:57:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:13,114 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 11:57:13,114 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 11:57:13,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:57:13,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:57:13,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:57:13,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:57:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:57:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-27 11:57:13,117 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-27 11:57:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:57:13,118 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-27 11:57:13,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:57:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 11:57:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:57:13,119 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:57:13,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:57:13,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:57:13,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:57:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:57:13,120 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-27 11:57:13,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:57:13,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671549282] [2022-04-27 11:57:13,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:57:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:57:13,135 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:57:13,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1523478863] [2022-04-27 11:57:13,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:57:13,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:57:13,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:57:13,147 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 11:57:13,153 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 11:57:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:57:13,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:57:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:57:13,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:57:13,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {186#true} is VALID [2022-04-27 11:57:13,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#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); {186#true} is VALID [2022-04-27 11:57:13,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 11:57:13,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #60#return; {186#true} is VALID [2022-04-27 11:57:13,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret5 := main(); {186#true} is VALID [2022-04-27 11:57:13,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#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; {186#true} is VALID [2022-04-27 11:57:13,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {186#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {186#true} is VALID [2022-04-27 11:57:13,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#true} ~cond := #in~cond; {186#true} is VALID [2022-04-27 11:57:13,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#true} assume !(0 == ~cond); {186#true} is VALID [2022-04-27 11:57:13,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 11:57:13,352 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {186#true} {186#true} #52#return; {186#true} is VALID [2022-04-27 11:57:13,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:57:13,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:57:13,355 INFO L272 TraceCheckUtils]: 13: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:57:13,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:57:13,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {187#false} is VALID [2022-04-27 11:57:13,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-04-27 11:57:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:57:13,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:57:13,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:57:13,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671549282] [2022-04-27 11:57:13,358 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:57:13,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523478863] [2022-04-27 11:57:13,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523478863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:57:13,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:57:13,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:57:13,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554911446] [2022-04-27 11:57:13,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:57:13,364 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:57:13,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:57:13,365 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:57:13,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:57:13,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:57:13,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:57:13,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:57:13,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:57:13,380 INFO L87 Difference]: Start difference. First operand 23 states and 25 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:57:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:13,520 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 11:57:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:57:13,521 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:57:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:57:13,521 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:57:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 11:57:13,524 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:57:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 11:57:13,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-27 11:57:13,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:57:13,558 INFO L225 Difference]: With dead ends: 34 [2022-04-27 11:57:13,558 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 11:57:13,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 11:57:13,559 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 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 11:57:13,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:57:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 11:57:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 11:57:13,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:57:13,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:57:13,570 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:57:13,571 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:57:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:13,576 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 11:57:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 11:57:13,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:57:13,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:57:13,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 11:57:13,578 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 11:57:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:13,582 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 11:57:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 11:57:13,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:57:13,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:57:13,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:57:13,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:57:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:57:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-27 11:57:13,593 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-27 11:57:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:57:13,593 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-27 11:57:13,593 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:57:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 11:57:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 11:57:13,594 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:57:13,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:57:13,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:57:13,795 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 11:57:13,795 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:57:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:57:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-27 11:57:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:57:13,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693779024] [2022-04-27 11:57:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:57:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:57:13,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:57:13,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67540105] [2022-04-27 11:57:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:57:13,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:57:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:57:13,809 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 11:57:13,810 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 11:57:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:57:13,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:57:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:57:13,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:57:14,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 11:57:14,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#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); {397#true} is VALID [2022-04-27 11:57:14,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 11:57:14,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 11:57:14,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 11:57:14,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#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; {397#true} is VALID [2022-04-27 11:57:14,047 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {397#true} is VALID [2022-04-27 11:57:14,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 11:57:14,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 11:57:14,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 11:57:14,051 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 11:57:14,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:57:14,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:57:14,053 INFO L272 TraceCheckUtils]: 13: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {397#true} is VALID [2022-04-27 11:57:14,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 11:57:14,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 11:57:14,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 11:57:14,057 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {435#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:57:14,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {457#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 11:57:14,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !false; {457#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 11:57:14,059 INFO L272 TraceCheckUtils]: 20: Hoare triple {457#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:57:14,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:57:14,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 11:57:14,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 11:57:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:57:14,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:57:14,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 11:57:14,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 11:57:14,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:57:14,359 INFO L272 TraceCheckUtils]: 20: Hoare triple {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:57:14,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 11:57:14,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 11:57:14,688 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #54#return; {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 11:57:14,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 11:57:14,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 11:57:14,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 11:57:14,689 INFO L272 TraceCheckUtils]: 13: Hoare triple {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {397#true} is VALID [2022-04-27 11:57:14,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 11:57:14,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-27 11:57:14,695 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 11:57:14,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 11:57:14,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 11:57:14,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 11:57:14,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {397#true} is VALID [2022-04-27 11:57:14,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#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; {397#true} is VALID [2022-04-27 11:57:14,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 11:57:14,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 11:57:14,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 11:57:14,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#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); {397#true} is VALID [2022-04-27 11:57:14,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 11:57:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:57:14,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:57:14,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693779024] [2022-04-27 11:57:14,697 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:57:14,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67540105] [2022-04-27 11:57:14,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67540105] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:57:14,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:57:14,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 11:57:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393338265] [2022-04-27 11:57:14,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:57:14,698 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 11:57:14,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:57:14,698 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:57:15,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:57:15,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:57:15,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:57:15,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:57:15,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:57:15,016 INFO L87 Difference]: Start difference. First operand 30 states and 32 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:57:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:15,126 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-27 11:57:15,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:57:15,126 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 11:57:15,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:57:15,127 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:57:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 11:57:15,128 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:57:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 11:57:15,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-27 11:57:17,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:57:17,962 INFO L225 Difference]: With dead ends: 36 [2022-04-27 11:57:17,962 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 11:57:17,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:57:17,963 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 67 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 11:57:17,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 67 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:57:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 11:57:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 11:57:17,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:57:17,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:57:17,973 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:57:17,974 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:57:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:17,975 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 11:57:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-27 11:57:17,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:57:17,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:57:17,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 11:57:17,976 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 11:57:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:17,977 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 11:57:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-27 11:57:17,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:57:17,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:57:17,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:57:17,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:57:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:57:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-27 11:57:17,979 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2022-04-27 11:57:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:57:17,979 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-27 11:57:17,980 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:57:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-27 11:57:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:57:17,980 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:57:17,980 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:57:17,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:57:18,184 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 11:57:18,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:57:18,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:57:18,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1106328449, now seen corresponding path program 1 times [2022-04-27 11:57:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:57:18,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607396741] [2022-04-27 11:57:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:57:18,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:57:18,197 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:57:18,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646303540] [2022-04-27 11:57:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:57:18,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:57:18,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:57:18,204 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 11:57:18,204 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 11:57:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:57:18,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:57:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:57:18,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:57:18,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {711#true} call ULTIMATE.init(); {711#true} is VALID [2022-04-27 11:57:18,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#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); {711#true} is VALID [2022-04-27 11:57:18,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {711#true} assume true; {711#true} is VALID [2022-04-27 11:57:18,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {711#true} {711#true} #60#return; {711#true} is VALID [2022-04-27 11:57:18,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {711#true} call #t~ret5 := main(); {711#true} is VALID [2022-04-27 11:57:18,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {711#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; {711#true} is VALID [2022-04-27 11:57:18,550 INFO L272 TraceCheckUtils]: 6: Hoare triple {711#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {711#true} is VALID [2022-04-27 11:57:18,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {711#true} ~cond := #in~cond; {711#true} is VALID [2022-04-27 11:57:18,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {711#true} assume !(0 == ~cond); {711#true} is VALID [2022-04-27 11:57:18,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {711#true} assume true; {711#true} is VALID [2022-04-27 11:57:18,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {711#true} {711#true} #52#return; {711#true} is VALID [2022-04-27 11:57:18,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {711#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {749#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:57:18,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {749#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {749#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:57:18,552 INFO L272 TraceCheckUtils]: 13: Hoare triple {749#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {711#true} is VALID [2022-04-27 11:57:18,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {711#true} ~cond := #in~cond; {711#true} is VALID [2022-04-27 11:57:18,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {711#true} assume !(0 == ~cond); {711#true} is VALID [2022-04-27 11:57:18,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {711#true} assume true; {711#true} is VALID [2022-04-27 11:57:18,555 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {711#true} {749#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {749#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:57:18,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {749#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 11:57:18,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 11:57:18,556 INFO L272 TraceCheckUtils]: 20: Hoare triple {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {711#true} is VALID [2022-04-27 11:57:18,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {711#true} ~cond := #in~cond; {711#true} is VALID [2022-04-27 11:57:18,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {711#true} assume !(0 == ~cond); {711#true} is VALID [2022-04-27 11:57:18,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {711#true} assume true; {711#true} is VALID [2022-04-27 11:57:18,557 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {711#true} {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 11:57:18,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {793#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 11:57:18,557 INFO L272 TraceCheckUtils]: 26: Hoare triple {793#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {711#true} is VALID [2022-04-27 11:57:18,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {711#true} ~cond := #in~cond; {711#true} is VALID [2022-04-27 11:57:18,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {711#true} assume !(0 == ~cond); {711#true} is VALID [2022-04-27 11:57:18,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {711#true} assume true; {711#true} is VALID [2022-04-27 11:57:18,559 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {711#true} {793#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #56#return; {793#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 11:57:18,568 INFO L272 TraceCheckUtils]: 31: Hoare triple {793#(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)); {812#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:57:18,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {812#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {816#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:57:18,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {816#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {712#false} is VALID [2022-04-27 11:57:18,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {712#false} assume !false; {712#false} is VALID [2022-04-27 11:57:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:57:18,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:57:18,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:57:18,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607396741] [2022-04-27 11:57:18,842 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:57:18,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646303540] [2022-04-27 11:57:18,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646303540] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:57:18,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:57:18,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 11:57:18,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422269180] [2022-04-27 11:57:18,843 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:57:18,843 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2022-04-27 11:57:18,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:57:18,844 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 11:57:18,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:57:18,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:57:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:57:18,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:57:18,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:57:18,871 INFO L87 Difference]: Start difference. First operand 32 states and 33 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 11:57:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:19,118 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-27 11:57:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:57:19,118 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2022-04-27 11:57:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:57:19,119 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 11:57:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-27 11:57:19,120 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 11:57:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-27 11:57:19,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-27 11:57:19,144 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 11:57:19,145 INFO L225 Difference]: With dead ends: 41 [2022-04-27 11:57:19,145 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 11:57:19,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:57:19,146 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:57:19,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:57:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 11:57:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 11:57:19,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:57:19,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 11:57:19,154 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 11:57:19,154 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 11:57:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:19,156 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-27 11:57:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-27 11:57:19,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:57:19,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:57:19,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 35 states. [2022-04-27 11:57:19,156 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 35 states. [2022-04-27 11:57:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:19,160 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-27 11:57:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-27 11:57:19,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:57:19,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:57:19,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:57:19,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:57:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 11:57:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-27 11:57:19,162 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 35 [2022-04-27 11:57:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:57:19,162 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-27 11:57:19,163 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 11:57:19,163 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-27 11:57:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 11:57:19,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:57:19,164 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:57:19,184 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 11:57:19,364 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 11:57:19,364 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:57:19,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:57:19,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1564024736, now seen corresponding path program 2 times [2022-04-27 11:57:19,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:57:19,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932628216] [2022-04-27 11:57:19,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:57:19,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:57:19,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:57:19,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010186160] [2022-04-27 11:57:19,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:57:19,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:57:19,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:57:19,377 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 11:57:19,379 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 11:57:19,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:57:19,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:57:19,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 11:57:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:57:19,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:57:19,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2022-04-27 11:57:19,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#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); {1066#true} is VALID [2022-04-27 11:57:19,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-27 11:57:19,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1066#true} {1066#true} #60#return; {1066#true} is VALID [2022-04-27 11:57:19,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {1066#true} call #t~ret5 := main(); {1066#true} is VALID [2022-04-27 11:57:19,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {1066#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; {1066#true} is VALID [2022-04-27 11:57:19,717 INFO L272 TraceCheckUtils]: 6: Hoare triple {1066#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1066#true} is VALID [2022-04-27 11:57:19,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-27 11:57:19,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-27 11:57:19,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-27 11:57:19,718 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1066#true} {1066#true} #52#return; {1066#true} is VALID [2022-04-27 11:57:19,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {1066#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1104#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:57:19,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {1104#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1104#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:57:19,719 INFO L272 TraceCheckUtils]: 13: Hoare triple {1104#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1066#true} is VALID [2022-04-27 11:57:19,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-27 11:57:19,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-27 11:57:19,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-27 11:57:19,720 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1066#true} {1104#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1104#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:57:19,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1126#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 11:57:19,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {1126#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1126#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 11:57:19,720 INFO L272 TraceCheckUtils]: 20: Hoare triple {1126#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1066#true} is VALID [2022-04-27 11:57:19,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-27 11:57:19,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-27 11:57:19,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-27 11:57:19,721 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1066#true} {1126#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {1126#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 11:57:19,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 11:57:19,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 11:57:19,722 INFO L272 TraceCheckUtils]: 27: Hoare triple {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1066#true} is VALID [2022-04-27 11:57:19,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-27 11:57:19,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-27 11:57:19,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-27 11:57:19,723 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1066#true} {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #54#return; {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 11:57:19,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1170#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 11:57:19,724 INFO L272 TraceCheckUtils]: 33: Hoare triple {1170#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1066#true} is VALID [2022-04-27 11:57:19,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-27 11:57:19,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-27 11:57:19,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-27 11:57:19,724 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1066#true} {1170#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} #56#return; {1170#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 11:57:19,725 INFO L272 TraceCheckUtils]: 38: Hoare triple {1170#(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)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:57:19,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:57:19,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1067#false} is VALID [2022-04-27 11:57:19,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-27 11:57:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:57:19,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:57:19,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:57:19,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932628216] [2022-04-27 11:57:19,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:57:19,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010186160] [2022-04-27 11:57:19,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010186160] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:57:19,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:57:19,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 11:57:19,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042991209] [2022-04-27 11:57:19,987 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:57:19,988 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-27 11:57:19,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:57:19,988 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 11:57:20,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:57:20,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:57:20,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:57:20,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:57:20,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:57:20,019 INFO L87 Difference]: Start difference. First operand 35 states and 37 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 11:57:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:20,273 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-27 11:57:20,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:57:20,274 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-27 11:57:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:57:20,274 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 11:57:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-27 11:57:20,275 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 11:57:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-27 11:57:20,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-27 11:57:20,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:57:20,307 INFO L225 Difference]: With dead ends: 44 [2022-04-27 11:57:20,307 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 11:57:20,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:57:20,308 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:57:20,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 154 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:57:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 11:57:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 11:57:20,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:57:20,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 11:57:20,317 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 11:57:20,318 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 11:57:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:20,319 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-27 11:57:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 11:57:20,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:57:20,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:57:20,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 38 states. [2022-04-27 11:57:20,320 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 38 states. [2022-04-27 11:57:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:57:20,321 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-27 11:57:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 11:57:20,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:57:20,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:57:20,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:57:20,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:57:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 11:57:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-27 11:57:20,323 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 42 [2022-04-27 11:57:20,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:57:20,324 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-27 11:57:20,324 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 11:57:20,324 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 11:57:20,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 11:57:20,325 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:57:20,325 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:57:20,331 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 11:57:20,529 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 11:57:20,530 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:57:20,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:57:20,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1951214241, now seen corresponding path program 3 times [2022-04-27 11:57:20,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:57:20,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864332621] [2022-04-27 11:57:20,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:57:20,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:57:20,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:57:20,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1405267233] [2022-04-27 11:57:20,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:57:20,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:57:20,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:57:20,550 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 11:57:20,551 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 12:08:36,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 12:08:36,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:08:36,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 12:08:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:08:36,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:08:36,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2022-04-27 12:08:36,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {1459#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); {1459#true} is VALID [2022-04-27 12:08:36,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2022-04-27 12:08:36,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #60#return; {1459#true} is VALID [2022-04-27 12:08:36,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret5 := main(); {1459#true} is VALID [2022-04-27 12:08:36,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {1459#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; {1459#true} is VALID [2022-04-27 12:08:36,585 INFO L272 TraceCheckUtils]: 6: Hoare triple {1459#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1459#true} is VALID [2022-04-27 12:08:36,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {1459#true} ~cond := #in~cond; {1459#true} is VALID [2022-04-27 12:08:36,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {1459#true} assume !(0 == ~cond); {1459#true} is VALID [2022-04-27 12:08:36,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {1459#true} assume true; {1459#true} is VALID [2022-04-27 12:08:36,585 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1459#true} {1459#true} #52#return; {1459#true} is VALID [2022-04-27 12:08:36,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {1459#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1497#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:36,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {1497#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1497#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:36,587 INFO L272 TraceCheckUtils]: 13: Hoare triple {1497#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1459#true} is VALID [2022-04-27 12:08:36,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {1459#true} ~cond := #in~cond; {1459#true} is VALID [2022-04-27 12:08:36,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {1459#true} assume !(0 == ~cond); {1459#true} is VALID [2022-04-27 12:08:36,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {1459#true} assume true; {1459#true} is VALID [2022-04-27 12:08:36,588 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1459#true} {1497#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1497#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:36,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {1497#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:08:36,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:08:36,589 INFO L272 TraceCheckUtils]: 20: Hoare triple {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1459#true} is VALID [2022-04-27 12:08:36,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {1459#true} ~cond := #in~cond; {1459#true} is VALID [2022-04-27 12:08:36,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {1459#true} assume !(0 == ~cond); {1459#true} is VALID [2022-04-27 12:08:36,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {1459#true} assume true; {1459#true} is VALID [2022-04-27 12:08:36,589 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1459#true} {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:08:36,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:08:36,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:08:36,590 INFO L272 TraceCheckUtils]: 27: Hoare triple {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1459#true} is VALID [2022-04-27 12:08:36,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {1459#true} ~cond := #in~cond; {1459#true} is VALID [2022-04-27 12:08:36,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {1459#true} assume !(0 == ~cond); {1459#true} is VALID [2022-04-27 12:08:36,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {1459#true} assume true; {1459#true} is VALID [2022-04-27 12:08:36,594 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1459#true} {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:08:36,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {1541#(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 + ~x~0; {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 12:08:36,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 12:08:36,595 INFO L272 TraceCheckUtils]: 34: Hoare triple {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1459#true} is VALID [2022-04-27 12:08:36,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {1459#true} ~cond := #in~cond; {1459#true} is VALID [2022-04-27 12:08:36,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {1459#true} assume !(0 == ~cond); {1459#true} is VALID [2022-04-27 12:08:36,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {1459#true} assume true; {1459#true} is VALID [2022-04-27 12:08:36,596 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1459#true} {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #54#return; {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 12:08:36,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1585#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 12:08:36,596 INFO L272 TraceCheckUtils]: 40: Hoare triple {1585#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1459#true} is VALID [2022-04-27 12:08:36,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {1459#true} ~cond := #in~cond; {1459#true} is VALID [2022-04-27 12:08:36,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {1459#true} assume !(0 == ~cond); {1459#true} is VALID [2022-04-27 12:08:36,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {1459#true} assume true; {1459#true} is VALID [2022-04-27 12:08:36,597 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1459#true} {1585#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #56#return; {1585#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 12:08:36,597 INFO L272 TraceCheckUtils]: 45: Hoare triple {1585#(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)); {1604#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:08:36,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {1604#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1608#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:08:36,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {1608#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1460#false} is VALID [2022-04-27 12:08:36,598 INFO L290 TraceCheckUtils]: 48: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2022-04-27 12:08:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 12:08:36,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:08:36,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:08:36,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864332621] [2022-04-27 12:08:36,831 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:08:36,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405267233] [2022-04-27 12:08:36,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405267233] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:08:36,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:08:36,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 12:08:36,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771507083] [2022-04-27 12:08:36,832 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:08:36,832 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 49 [2022-04-27 12:08:36,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:08:36,832 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 12:08:36,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:36,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:08:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:08:36,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:08:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:08:36,858 INFO L87 Difference]: Start difference. First operand 38 states and 41 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 12:08:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:37,150 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-27 12:08:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:08:37,151 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 49 [2022-04-27 12:08:37,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:08:37,151 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 12:08:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-27 12:08:37,152 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 12:08:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-27 12:08:37,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2022-04-27 12:08:37,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:37,189 INFO L225 Difference]: With dead ends: 47 [2022-04-27 12:08:37,189 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 12:08:37,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:08:37,190 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:08:37,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 185 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:08:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 12:08:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 12:08:37,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:08:37,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 12:08:37,201 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 12:08:37,201 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 12:08:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:37,203 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-27 12:08:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-27 12:08:37,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:37,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:37,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 41 states. [2022-04-27 12:08:37,203 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 41 states. [2022-04-27 12:08:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:37,206 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-27 12:08:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-27 12:08:37,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:37,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:37,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:08:37,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:08:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 12:08:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-27 12:08:37,210 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 49 [2022-04-27 12:08:37,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:08:37,210 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-27 12:08:37,210 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 12:08:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-27 12:08:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 12:08:37,212 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:08:37,212 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:08:37,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:08:37,427 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 12:08:37,427 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:08:37,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:08:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash 327675008, now seen corresponding path program 4 times [2022-04-27 12:08:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:08:37,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424017068] [2022-04-27 12:08:37,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:08:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:08:37,438 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:08:37,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858874273] [2022-04-27 12:08:37,438 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 12:08:37,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:08:37,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:08:37,443 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 12:08:37,444 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 12:08:37,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 12:08:37,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:08:37,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 12:08:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:08:37,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:08:37,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {1890#true} call ULTIMATE.init(); {1890#true} is VALID [2022-04-27 12:08:37,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {1890#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); {1890#true} is VALID [2022-04-27 12:08:37,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 12:08:37,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #60#return; {1890#true} is VALID [2022-04-27 12:08:37,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret5 := main(); {1890#true} is VALID [2022-04-27 12:08:37,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {1890#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; {1890#true} is VALID [2022-04-27 12:08:37,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {1890#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1890#true} is VALID [2022-04-27 12:08:37,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 12:08:37,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 12:08:37,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 12:08:37,792 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1890#true} {1890#true} #52#return; {1890#true} is VALID [2022-04-27 12:08:37,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {1890#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1928#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:37,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {1928#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1928#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:37,793 INFO L272 TraceCheckUtils]: 13: Hoare triple {1928#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1890#true} is VALID [2022-04-27 12:08:37,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 12:08:37,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 12:08:37,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 12:08:37,794 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1890#true} {1928#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1928#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:37,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {1928#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:08:37,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:08:37,795 INFO L272 TraceCheckUtils]: 20: Hoare triple {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1890#true} is VALID [2022-04-27 12:08:37,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 12:08:37,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 12:08:37,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 12:08:37,795 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1890#true} {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:08:37,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:08:37,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:08:37,796 INFO L272 TraceCheckUtils]: 27: Hoare triple {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1890#true} is VALID [2022-04-27 12:08:37,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 12:08:37,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 12:08:37,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 12:08:37,797 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1890#true} {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:08:37,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {1972#(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 + ~x~0; {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 12:08:37,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 12:08:37,799 INFO L272 TraceCheckUtils]: 34: Hoare triple {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1890#true} is VALID [2022-04-27 12:08:37,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 12:08:37,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 12:08:37,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 12:08:37,800 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1890#true} {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #54#return; {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 12:08:37,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {1994#(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 + ~x~0; {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 12:08:37,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 12:08:37,803 INFO L272 TraceCheckUtils]: 41: Hoare triple {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1890#true} is VALID [2022-04-27 12:08:37,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 12:08:37,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 12:08:37,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 12:08:37,804 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1890#true} {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 12:08:37,804 INFO L290 TraceCheckUtils]: 46: Hoare triple {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2038#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 12:08:37,804 INFO L272 TraceCheckUtils]: 47: Hoare triple {2038#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1890#true} is VALID [2022-04-27 12:08:37,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 12:08:37,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 12:08:37,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 12:08:37,805 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1890#true} {2038#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #56#return; {2038#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 12:08:37,805 INFO L272 TraceCheckUtils]: 52: Hoare triple {2038#(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)); {2057#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:08:37,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {2057#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2061#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:08:37,806 INFO L290 TraceCheckUtils]: 54: Hoare triple {2061#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1891#false} is VALID [2022-04-27 12:08:37,806 INFO L290 TraceCheckUtils]: 55: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2022-04-27 12:08:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 12:08:37,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:08:38,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:08:38,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424017068] [2022-04-27 12:08:38,085 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:08:38,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858874273] [2022-04-27 12:08:38,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858874273] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:08:38,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:08:38,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 12:08:38,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643823734] [2022-04-27 12:08:38,086 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:08:38,086 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 56 [2022-04-27 12:08:38,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:08:38,087 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 12:08:38,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:38,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:08:38,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:08:38,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:08:38,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 12:08:38,118 INFO L87 Difference]: Start difference. First operand 41 states and 45 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 12:08:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:38,560 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-04-27 12:08:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:08:38,560 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 56 [2022-04-27 12:08:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:08:38,561 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 12:08:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-27 12:08:38,562 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 12:08:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-27 12:08:38,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2022-04-27 12:08:38,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:38,598 INFO L225 Difference]: With dead ends: 50 [2022-04-27 12:08:38,598 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 12:08:38,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 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 12:08:38,599 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:08:38,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 218 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:08:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 12:08:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 12:08:38,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:08:38,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 12:08:38,612 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 12:08:38,612 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 12:08:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:38,614 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-27 12:08:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-27 12:08:38,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:38,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:38,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 44 states. [2022-04-27 12:08:38,614 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 44 states. [2022-04-27 12:08:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:38,616 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-27 12:08:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-27 12:08:38,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:38,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:38,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:08:38,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:08:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 12:08:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-04-27 12:08:38,617 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 56 [2022-04-27 12:08:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:08:38,617 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-04-27 12:08:38,618 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 12:08:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-27 12:08:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 12:08:38,618 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:08:38,618 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:08:38,647 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 12:08:38,819 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 12:08:38,819 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:08:38,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:08:38,819 INFO L85 PathProgramCache]: Analyzing trace with hash -16244287, now seen corresponding path program 5 times [2022-04-27 12:08:38,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:08:38,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433593867] [2022-04-27 12:08:38,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:08:38,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:08:38,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:08:38,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1309977099] [2022-04-27 12:08:38,833 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 12:08:38,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:08:38,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:08:38,856 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 12:08:38,900 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 12:09:52,090 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 12:09:52,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:09:52,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 12:09:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:09:52,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:09:52,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-27 12:09:52,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#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); {2359#true} is VALID [2022-04-27 12:09:52,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:09:52,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2359#true} {2359#true} #60#return; {2359#true} is VALID [2022-04-27 12:09:52,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {2359#true} call #t~ret5 := main(); {2359#true} is VALID [2022-04-27 12:09:52,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#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; {2359#true} is VALID [2022-04-27 12:09:52,506 INFO L272 TraceCheckUtils]: 6: Hoare triple {2359#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:09:52,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:09:52,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:09:52,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:09:52,506 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2359#true} {2359#true} #52#return; {2359#true} is VALID [2022-04-27 12:09:52,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {2359#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2397#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:09:52,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {2397#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2397#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:09:52,507 INFO L272 TraceCheckUtils]: 13: Hoare triple {2397#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:09:52,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:09:52,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:09:52,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:09:52,508 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2359#true} {2397#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2397#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:09:52,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {2397#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:09:52,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:09:52,509 INFO L272 TraceCheckUtils]: 20: Hoare triple {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:09:52,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:09:52,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:09:52,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:09:52,510 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2359#true} {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:09:52,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 12:09:52,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 12:09:52,511 INFO L272 TraceCheckUtils]: 27: Hoare triple {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:09:52,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:09:52,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:09:52,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:09:52,511 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2359#true} {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 12:09:52,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:09:52,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:09:52,512 INFO L272 TraceCheckUtils]: 34: Hoare triple {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:09:52,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:09:52,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:09:52,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:09:52,513 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2359#true} {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:09:52,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:09:52,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:09:52,514 INFO L272 TraceCheckUtils]: 41: Hoare triple {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:09:52,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:09:52,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:09:52,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:09:52,515 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2359#true} {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #54#return; {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:09:52,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 12:09:52,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 12:09:52,516 INFO L272 TraceCheckUtils]: 48: Hoare triple {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:09:52,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:09:52,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:09:52,516 INFO L290 TraceCheckUtils]: 51: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:09:52,516 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2359#true} {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #54#return; {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 12:09:52,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2529#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 12:09:52,517 INFO L272 TraceCheckUtils]: 54: Hoare triple {2529#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:09:52,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:09:52,517 INFO L290 TraceCheckUtils]: 56: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:09:52,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:09:52,518 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2359#true} {2529#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #56#return; {2529#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 12:09:52,519 INFO L272 TraceCheckUtils]: 59: Hoare triple {2529#(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)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:09:52,519 INFO L290 TraceCheckUtils]: 60: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:09:52,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2360#false} is VALID [2022-04-27 12:09:52,519 INFO L290 TraceCheckUtils]: 62: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-27 12:09:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 12:09:52,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:09:52,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:09:52,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433593867] [2022-04-27 12:09:52,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:09:52,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309977099] [2022-04-27 12:09:52,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309977099] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:09:52,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:09:52,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 12:09:52,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621218880] [2022-04-27 12:09:52,804 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:09:52,805 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 63 [2022-04-27 12:09:52,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:09:52,805 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 12:09:52,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:09:52,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 12:09:52,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:09:52,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 12:09:52,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:09:52,838 INFO L87 Difference]: Start difference. First operand 44 states and 49 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 12:09:53,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:09:53,343 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-04-27 12:09:53,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:09:53,344 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 63 [2022-04-27 12:09:53,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:09:53,344 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 12:09:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-04-27 12:09:53,345 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 12:09:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-04-27 12:09:53,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2022-04-27 12:09:53,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:09:53,382 INFO L225 Difference]: With dead ends: 53 [2022-04-27 12:09:53,383 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 12:09:53,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 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 12:09:53,383 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:09:53,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 253 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:09:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 12:09:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 12:09:53,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:09:53,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 12:09:53,406 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 12:09:53,406 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 12:09:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:09:53,408 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-27 12:09:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-27 12:09:53,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:09:53,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:09:53,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 47 states. [2022-04-27 12:09:53,409 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 47 states. [2022-04-27 12:09:53,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:09:53,410 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-27 12:09:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-27 12:09:53,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:09:53,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:09:53,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:09:53,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:09:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 12:09:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-04-27 12:09:53,412 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 63 [2022-04-27 12:09:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:09:53,412 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-04-27 12:09:53,412 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 12:09:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-27 12:09:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-27 12:09:53,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:09:53,413 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:09:53,442 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 12:09:53,627 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 12:09:53,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:09:53,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:09:53,628 INFO L85 PathProgramCache]: Analyzing trace with hash 570339680, now seen corresponding path program 6 times [2022-04-27 12:09:53,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:09:53,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667851864] [2022-04-27 12:09:53,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:09:53,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:09:53,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:09:53,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018430750] [2022-04-27 12:09:53,644 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 12:09:53,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:09:53,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:09:53,646 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 12:09:53,647 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 12:10:07,598 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 12:10:07,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:10:07,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 12:10:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:10:07,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:10:07,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {2866#true} call ULTIMATE.init(); {2866#true} is VALID [2022-04-27 12:10:07,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {2866#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); {2866#true} is VALID [2022-04-27 12:10:07,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-27 12:10:07,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2866#true} {2866#true} #60#return; {2866#true} is VALID [2022-04-27 12:10:07,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {2866#true} call #t~ret5 := main(); {2866#true} is VALID [2022-04-27 12:10:07,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {2866#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; {2866#true} is VALID [2022-04-27 12:10:07,991 INFO L272 TraceCheckUtils]: 6: Hoare triple {2866#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2866#true} is VALID [2022-04-27 12:10:07,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {2866#true} ~cond := #in~cond; {2866#true} is VALID [2022-04-27 12:10:07,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {2866#true} assume !(0 == ~cond); {2866#true} is VALID [2022-04-27 12:10:07,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-27 12:10:07,991 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2866#true} {2866#true} #52#return; {2866#true} is VALID [2022-04-27 12:10:07,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {2866#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2904#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:10:07,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {2904#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2904#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:10:08,000 INFO L272 TraceCheckUtils]: 13: Hoare triple {2904#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2866#true} is VALID [2022-04-27 12:10:08,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {2866#true} ~cond := #in~cond; {2866#true} is VALID [2022-04-27 12:10:08,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {2866#true} assume !(0 == ~cond); {2866#true} is VALID [2022-04-27 12:10:08,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-27 12:10:08,000 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2866#true} {2904#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2904#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:10:08,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {2904#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:10:08,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:10:08,001 INFO L272 TraceCheckUtils]: 20: Hoare triple {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2866#true} is VALID [2022-04-27 12:10:08,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {2866#true} ~cond := #in~cond; {2866#true} is VALID [2022-04-27 12:10:08,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {2866#true} assume !(0 == ~cond); {2866#true} is VALID [2022-04-27 12:10:08,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-27 12:10:08,003 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2866#true} {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:10:08,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 12:10:08,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 12:10:08,003 INFO L272 TraceCheckUtils]: 27: Hoare triple {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2866#true} is VALID [2022-04-27 12:10:08,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {2866#true} ~cond := #in~cond; {2866#true} is VALID [2022-04-27 12:10:08,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {2866#true} assume !(0 == ~cond); {2866#true} is VALID [2022-04-27 12:10:08,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-27 12:10:08,005 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2866#true} {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 12:10:08,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 12:10:08,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 12:10:08,006 INFO L272 TraceCheckUtils]: 34: Hoare triple {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2866#true} is VALID [2022-04-27 12:10:08,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {2866#true} ~cond := #in~cond; {2866#true} is VALID [2022-04-27 12:10:08,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {2866#true} assume !(0 == ~cond); {2866#true} is VALID [2022-04-27 12:10:08,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-27 12:10:08,007 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2866#true} {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 12:10:08,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2992#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:10:08,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {2992#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {2992#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:10:08,011 INFO L272 TraceCheckUtils]: 41: Hoare triple {2992#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2866#true} is VALID [2022-04-27 12:10:08,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {2866#true} ~cond := #in~cond; {2866#true} is VALID [2022-04-27 12:10:08,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {2866#true} assume !(0 == ~cond); {2866#true} is VALID [2022-04-27 12:10:08,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-27 12:10:08,017 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2866#true} {2992#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {2992#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:10:08,017 INFO L290 TraceCheckUtils]: 46: Hoare triple {2992#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 12:10:08,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 12:10:08,018 INFO L272 TraceCheckUtils]: 48: Hoare triple {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2866#true} is VALID [2022-04-27 12:10:08,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {2866#true} ~cond := #in~cond; {2866#true} is VALID [2022-04-27 12:10:08,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {2866#true} assume !(0 == ~cond); {2866#true} is VALID [2022-04-27 12:10:08,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-27 12:10:08,019 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2866#true} {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 12:10:08,019 INFO L290 TraceCheckUtils]: 53: Hoare triple {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 12:10:08,020 INFO L290 TraceCheckUtils]: 54: Hoare triple {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 12:10:08,020 INFO L272 TraceCheckUtils]: 55: Hoare triple {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2866#true} is VALID [2022-04-27 12:10:08,020 INFO L290 TraceCheckUtils]: 56: Hoare triple {2866#true} ~cond := #in~cond; {2866#true} is VALID [2022-04-27 12:10:08,020 INFO L290 TraceCheckUtils]: 57: Hoare triple {2866#true} assume !(0 == ~cond); {2866#true} is VALID [2022-04-27 12:10:08,020 INFO L290 TraceCheckUtils]: 58: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-27 12:10:08,020 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2866#true} {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #54#return; {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 12:10:08,021 INFO L290 TraceCheckUtils]: 60: Hoare triple {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3058#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 12:10:08,021 INFO L272 TraceCheckUtils]: 61: Hoare triple {3058#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2866#true} is VALID [2022-04-27 12:10:08,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {2866#true} ~cond := #in~cond; {2866#true} is VALID [2022-04-27 12:10:08,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {2866#true} assume !(0 == ~cond); {2866#true} is VALID [2022-04-27 12:10:08,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {2866#true} assume true; {2866#true} is VALID [2022-04-27 12:10:08,022 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {2866#true} {3058#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #56#return; {3058#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 12:10:08,022 INFO L272 TraceCheckUtils]: 66: Hoare triple {3058#(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)); {3077#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:10:08,023 INFO L290 TraceCheckUtils]: 67: Hoare triple {3077#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3081#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:10:08,023 INFO L290 TraceCheckUtils]: 68: Hoare triple {3081#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2867#false} is VALID [2022-04-27 12:10:08,023 INFO L290 TraceCheckUtils]: 69: Hoare triple {2867#false} assume !false; {2867#false} is VALID [2022-04-27 12:10:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 12:10:08,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:10:08,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:10:08,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667851864] [2022-04-27 12:10:08,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:10:08,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018430750] [2022-04-27 12:10:08,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018430750] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:10:08,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:10:08,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 12:10:08,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781578940] [2022-04-27 12:10:08,269 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:10:08,270 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 70 [2022-04-27 12:10:08,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:10:08,270 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 12:10:08,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:10:08,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 12:10:08,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:10:08,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 12:10:08,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:10:08,303 INFO L87 Difference]: Start difference. First operand 47 states and 53 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 12:10:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:10:08,903 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-04-27 12:10:08,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 12:10:08,904 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 70 [2022-04-27 12:10:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:10:08,904 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 12:10:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-27 12:10:08,906 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 12:10:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-27 12:10:08,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2022-04-27 12:10:08,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:10:08,954 INFO L225 Difference]: With dead ends: 56 [2022-04-27 12:10:08,954 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 12:10:08,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 12:10:08,956 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:10:08,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 290 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:10:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 12:10:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-27 12:10:08,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:10:08,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 12:10:08,974 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 12:10:08,974 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 12:10:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:10:08,976 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-04-27 12:10:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-27 12:10:08,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:10:08,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:10:08,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 50 states. [2022-04-27 12:10:08,981 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 50 states. [2022-04-27 12:10:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:10:08,983 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-04-27 12:10:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-27 12:10:08,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:10:08,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:10:08,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:10:08,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:10:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 12:10:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-04-27 12:10:08,985 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 70 [2022-04-27 12:10:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:10:08,985 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-04-27 12:10:08,985 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 12:10:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-27 12:10:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 12:10:08,986 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:10:08,986 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:10:08,998 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 12:10:09,196 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 12:10:09,197 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:10:09,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:10:09,197 INFO L85 PathProgramCache]: Analyzing trace with hash 724836577, now seen corresponding path program 7 times [2022-04-27 12:10:09,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:10:09,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984377224] [2022-04-27 12:10:09,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:10:09,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:10:09,208 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:10:09,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775634645] [2022-04-27 12:10:09,209 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 12:10:09,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:10:09,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:10:09,210 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 12:10:09,215 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 12:10:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:10:26,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 12:10:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:10:26,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:10:26,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {3411#true} call ULTIMATE.init(); {3411#true} is VALID [2022-04-27 12:10:26,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {3411#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); {3411#true} is VALID [2022-04-27 12:10:26,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {3411#true} assume true; {3411#true} is VALID [2022-04-27 12:10:26,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3411#true} {3411#true} #60#return; {3411#true} is VALID [2022-04-27 12:10:26,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {3411#true} call #t~ret5 := main(); {3411#true} is VALID [2022-04-27 12:10:26,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {3411#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; {3411#true} is VALID [2022-04-27 12:10:26,688 INFO L272 TraceCheckUtils]: 6: Hoare triple {3411#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3411#true} is VALID [2022-04-27 12:10:26,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {3411#true} ~cond := #in~cond; {3411#true} is VALID [2022-04-27 12:10:26,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {3411#true} assume !(0 == ~cond); {3411#true} is VALID [2022-04-27 12:10:26,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {3411#true} assume true; {3411#true} is VALID [2022-04-27 12:10:26,689 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3411#true} {3411#true} #52#return; {3411#true} is VALID [2022-04-27 12:10:26,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {3411#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3449#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:10:26,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {3449#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3449#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:10:26,690 INFO L272 TraceCheckUtils]: 13: Hoare triple {3449#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3411#true} is VALID [2022-04-27 12:10:26,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {3411#true} ~cond := #in~cond; {3411#true} is VALID [2022-04-27 12:10:26,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {3411#true} assume !(0 == ~cond); {3411#true} is VALID [2022-04-27 12:10:26,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {3411#true} assume true; {3411#true} is VALID [2022-04-27 12:10:26,690 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3411#true} {3449#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3449#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:10:26,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {3449#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:10:26,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:10:26,691 INFO L272 TraceCheckUtils]: 20: Hoare triple {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3411#true} is VALID [2022-04-27 12:10:26,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {3411#true} ~cond := #in~cond; {3411#true} is VALID [2022-04-27 12:10:26,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {3411#true} assume !(0 == ~cond); {3411#true} is VALID [2022-04-27 12:10:26,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {3411#true} assume true; {3411#true} is VALID [2022-04-27 12:10:26,692 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3411#true} {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:10:26,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:10:26,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:10:26,693 INFO L272 TraceCheckUtils]: 27: Hoare triple {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3411#true} is VALID [2022-04-27 12:10:26,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {3411#true} ~cond := #in~cond; {3411#true} is VALID [2022-04-27 12:10:26,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {3411#true} assume !(0 == ~cond); {3411#true} is VALID [2022-04-27 12:10:26,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {3411#true} assume true; {3411#true} is VALID [2022-04-27 12:10:26,693 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3411#true} {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:10:26,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {3493#(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 + ~x~0; {3515#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:10:26,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {3515#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {3515#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:10:26,694 INFO L272 TraceCheckUtils]: 34: Hoare triple {3515#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3411#true} is VALID [2022-04-27 12:10:26,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {3411#true} ~cond := #in~cond; {3411#true} is VALID [2022-04-27 12:10:26,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {3411#true} assume !(0 == ~cond); {3411#true} is VALID [2022-04-27 12:10:26,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {3411#true} assume true; {3411#true} is VALID [2022-04-27 12:10:26,695 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3411#true} {3515#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {3515#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:10:26,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {3515#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:10:26,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:10:26,696 INFO L272 TraceCheckUtils]: 41: Hoare triple {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3411#true} is VALID [2022-04-27 12:10:26,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {3411#true} ~cond := #in~cond; {3411#true} is VALID [2022-04-27 12:10:26,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {3411#true} assume !(0 == ~cond); {3411#true} is VALID [2022-04-27 12:10:26,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {3411#true} assume true; {3411#true} is VALID [2022-04-27 12:10:26,697 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3411#true} {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:10:26,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:10:26,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:10:26,697 INFO L272 TraceCheckUtils]: 48: Hoare triple {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3411#true} is VALID [2022-04-27 12:10:26,698 INFO L290 TraceCheckUtils]: 49: Hoare triple {3411#true} ~cond := #in~cond; {3411#true} is VALID [2022-04-27 12:10:26,698 INFO L290 TraceCheckUtils]: 50: Hoare triple {3411#true} assume !(0 == ~cond); {3411#true} is VALID [2022-04-27 12:10:26,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {3411#true} assume true; {3411#true} is VALID [2022-04-27 12:10:26,698 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3411#true} {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:10:26,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:10:26,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:10:26,699 INFO L272 TraceCheckUtils]: 55: Hoare triple {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3411#true} is VALID [2022-04-27 12:10:26,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {3411#true} ~cond := #in~cond; {3411#true} is VALID [2022-04-27 12:10:26,699 INFO L290 TraceCheckUtils]: 57: Hoare triple {3411#true} assume !(0 == ~cond); {3411#true} is VALID [2022-04-27 12:10:26,699 INFO L290 TraceCheckUtils]: 58: Hoare triple {3411#true} assume true; {3411#true} is VALID [2022-04-27 12:10:26,700 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3411#true} {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:10:26,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 12:10:26,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !false; {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 12:10:26,700 INFO L272 TraceCheckUtils]: 62: Hoare triple {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3411#true} is VALID [2022-04-27 12:10:26,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {3411#true} ~cond := #in~cond; {3411#true} is VALID [2022-04-27 12:10:26,701 INFO L290 TraceCheckUtils]: 64: Hoare triple {3411#true} assume !(0 == ~cond); {3411#true} is VALID [2022-04-27 12:10:26,701 INFO L290 TraceCheckUtils]: 65: Hoare triple {3411#true} assume true; {3411#true} is VALID [2022-04-27 12:10:26,701 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3411#true} {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #54#return; {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 12:10:26,702 INFO L290 TraceCheckUtils]: 67: Hoare triple {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3625#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 12:10:26,702 INFO L272 TraceCheckUtils]: 68: Hoare triple {3625#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3411#true} is VALID [2022-04-27 12:10:26,702 INFO L290 TraceCheckUtils]: 69: Hoare triple {3411#true} ~cond := #in~cond; {3411#true} is VALID [2022-04-27 12:10:26,702 INFO L290 TraceCheckUtils]: 70: Hoare triple {3411#true} assume !(0 == ~cond); {3411#true} is VALID [2022-04-27 12:10:26,702 INFO L290 TraceCheckUtils]: 71: Hoare triple {3411#true} assume true; {3411#true} is VALID [2022-04-27 12:10:26,702 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {3411#true} {3625#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #56#return; {3625#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 12:10:26,703 INFO L272 TraceCheckUtils]: 73: Hoare triple {3625#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3644#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:10:26,703 INFO L290 TraceCheckUtils]: 74: Hoare triple {3644#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3648#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:10:26,704 INFO L290 TraceCheckUtils]: 75: Hoare triple {3648#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3412#false} is VALID [2022-04-27 12:10:26,704 INFO L290 TraceCheckUtils]: 76: Hoare triple {3412#false} assume !false; {3412#false} is VALID [2022-04-27 12:10:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 12:10:26,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:10:26,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:10:26,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984377224] [2022-04-27 12:10:26,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:10:26,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775634645] [2022-04-27 12:10:26,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775634645] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:10:26,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:10:26,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 12:10:26,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718638555] [2022-04-27 12:10:26,963 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:10:26,964 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 77 [2022-04-27 12:10:26,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:10:26,964 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 12:10:26,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:10:26,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 12:10:26,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:10:27,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 12:10:27,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 12:10:27,000 INFO L87 Difference]: Start difference. First operand 50 states and 57 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 12:10:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:10:27,680 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-27 12:10:27,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:10:27,680 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 77 [2022-04-27 12:10:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:10:27,681 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 12:10:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 12:10:27,682 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 12:10:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 12:10:27,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-27 12:10:27,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:10:27,736 INFO L225 Difference]: With dead ends: 59 [2022-04-27 12:10:27,736 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 12:10:27,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-27 12:10:27,736 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:10:27,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 329 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:10:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 12:10:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-27 12:10:27,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:10:27,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 12:10:27,759 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 12:10:27,759 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 12:10:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:10:27,760 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 12:10:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 12:10:27,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:10:27,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:10:27,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 53 states. [2022-04-27 12:10:27,761 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 53 states. [2022-04-27 12:10:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:10:27,762 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 12:10:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 12:10:27,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:10:27,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:10:27,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:10:27,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:10:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 12:10:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-04-27 12:10:27,763 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 77 [2022-04-27 12:10:27,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:10:27,763 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-04-27 12:10:27,763 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 12:10:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 12:10:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 12:10:27,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:10:27,764 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:10:27,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-27 12:10:27,973 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 12:10:27,973 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:10:27,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:10:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1196125760, now seen corresponding path program 8 times [2022-04-27 12:10:27,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:10:27,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701126743] [2022-04-27 12:10:27,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:10:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:10:27,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:10:27,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556078830] [2022-04-27 12:10:27,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:10:27,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:10:27,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:10:27,985 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 12:10:27,986 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 12:11:00,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:11:00,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:11:00,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-27 12:11:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:11:00,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:11:00,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {3994#true} call ULTIMATE.init(); {3994#true} is VALID [2022-04-27 12:11:00,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {3994#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); {3994#true} is VALID [2022-04-27 12:11:00,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {3994#true} assume true; {3994#true} is VALID [2022-04-27 12:11:00,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3994#true} {3994#true} #60#return; {3994#true} is VALID [2022-04-27 12:11:00,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {3994#true} call #t~ret5 := main(); {3994#true} is VALID [2022-04-27 12:11:00,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {3994#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; {3994#true} is VALID [2022-04-27 12:11:00,629 INFO L272 TraceCheckUtils]: 6: Hoare triple {3994#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3994#true} is VALID [2022-04-27 12:11:00,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {3994#true} ~cond := #in~cond; {3994#true} is VALID [2022-04-27 12:11:00,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {3994#true} assume !(0 == ~cond); {3994#true} is VALID [2022-04-27 12:11:00,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {3994#true} assume true; {3994#true} is VALID [2022-04-27 12:11:00,629 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3994#true} {3994#true} #52#return; {3994#true} is VALID [2022-04-27 12:11:00,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {3994#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4032#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:11:00,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {4032#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4032#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:11:00,630 INFO L272 TraceCheckUtils]: 13: Hoare triple {4032#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3994#true} is VALID [2022-04-27 12:11:00,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {3994#true} ~cond := #in~cond; {3994#true} is VALID [2022-04-27 12:11:00,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {3994#true} assume !(0 == ~cond); {3994#true} is VALID [2022-04-27 12:11:00,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {3994#true} assume true; {3994#true} is VALID [2022-04-27 12:11:00,631 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3994#true} {4032#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4032#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:11:00,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {4032#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 12:11:00,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 12:11:00,631 INFO L272 TraceCheckUtils]: 20: Hoare triple {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3994#true} is VALID [2022-04-27 12:11:00,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {3994#true} ~cond := #in~cond; {3994#true} is VALID [2022-04-27 12:11:00,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {3994#true} assume !(0 == ~cond); {3994#true} is VALID [2022-04-27 12:11:00,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {3994#true} assume true; {3994#true} is VALID [2022-04-27 12:11:00,634 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3994#true} {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 12:11:00,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {4054#(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 + ~x~0; {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} assume !false; {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,635 INFO L272 TraceCheckUtils]: 27: Hoare triple {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3994#true} is VALID [2022-04-27 12:11:00,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {3994#true} ~cond := #in~cond; {3994#true} is VALID [2022-04-27 12:11:00,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {3994#true} assume !(0 == ~cond); {3994#true} is VALID [2022-04-27 12:11:00,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {3994#true} assume true; {3994#true} is VALID [2022-04-27 12:11:00,636 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3994#true} {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} #54#return; {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 12:11:00,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 12:11:00,637 INFO L272 TraceCheckUtils]: 34: Hoare triple {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3994#true} is VALID [2022-04-27 12:11:00,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {3994#true} ~cond := #in~cond; {3994#true} is VALID [2022-04-27 12:11:00,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {3994#true} assume !(0 == ~cond); {3994#true} is VALID [2022-04-27 12:11:00,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {3994#true} assume true; {3994#true} is VALID [2022-04-27 12:11:00,637 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3994#true} {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #54#return; {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 12:11:00,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,638 INFO L272 TraceCheckUtils]: 41: Hoare triple {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3994#true} is VALID [2022-04-27 12:11:00,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {3994#true} ~cond := #in~cond; {3994#true} is VALID [2022-04-27 12:11:00,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {3994#true} assume !(0 == ~cond); {3994#true} is VALID [2022-04-27 12:11:00,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {3994#true} assume true; {3994#true} is VALID [2022-04-27 12:11:00,639 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3994#true} {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,639 INFO L272 TraceCheckUtils]: 48: Hoare triple {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3994#true} is VALID [2022-04-27 12:11:00,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {3994#true} ~cond := #in~cond; {3994#true} is VALID [2022-04-27 12:11:00,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {3994#true} assume !(0 == ~cond); {3994#true} is VALID [2022-04-27 12:11:00,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {3994#true} assume true; {3994#true} is VALID [2022-04-27 12:11:00,640 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3994#true} {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} #54#return; {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !false; {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,641 INFO L272 TraceCheckUtils]: 55: Hoare triple {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3994#true} is VALID [2022-04-27 12:11:00,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {3994#true} ~cond := #in~cond; {3994#true} is VALID [2022-04-27 12:11:00,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {3994#true} assume !(0 == ~cond); {3994#true} is VALID [2022-04-27 12:11:00,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {3994#true} assume true; {3994#true} is VALID [2022-04-27 12:11:00,642 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3994#true} {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #54#return; {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,642 INFO L290 TraceCheckUtils]: 60: Hoare triple {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,642 INFO L272 TraceCheckUtils]: 62: Hoare triple {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3994#true} is VALID [2022-04-27 12:11:00,643 INFO L290 TraceCheckUtils]: 63: Hoare triple {3994#true} ~cond := #in~cond; {3994#true} is VALID [2022-04-27 12:11:00,643 INFO L290 TraceCheckUtils]: 64: Hoare triple {3994#true} assume !(0 == ~cond); {3994#true} is VALID [2022-04-27 12:11:00,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {3994#true} assume true; {3994#true} is VALID [2022-04-27 12:11:00,643 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3994#true} {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:11:00,644 INFO L290 TraceCheckUtils]: 67: Hoare triple {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 12:11:00,644 INFO L290 TraceCheckUtils]: 68: Hoare triple {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 12:11:00,644 INFO L272 TraceCheckUtils]: 69: Hoare triple {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3994#true} is VALID [2022-04-27 12:11:00,644 INFO L290 TraceCheckUtils]: 70: Hoare triple {3994#true} ~cond := #in~cond; {3994#true} is VALID [2022-04-27 12:11:00,644 INFO L290 TraceCheckUtils]: 71: Hoare triple {3994#true} assume !(0 == ~cond); {3994#true} is VALID [2022-04-27 12:11:00,644 INFO L290 TraceCheckUtils]: 72: Hoare triple {3994#true} assume true; {3994#true} is VALID [2022-04-27 12:11:00,645 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3994#true} {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #54#return; {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 12:11:00,645 INFO L290 TraceCheckUtils]: 74: Hoare triple {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4230#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 12:11:00,645 INFO L272 TraceCheckUtils]: 75: Hoare triple {4230#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3994#true} is VALID [2022-04-27 12:11:00,645 INFO L290 TraceCheckUtils]: 76: Hoare triple {3994#true} ~cond := #in~cond; {3994#true} is VALID [2022-04-27 12:11:00,645 INFO L290 TraceCheckUtils]: 77: Hoare triple {3994#true} assume !(0 == ~cond); {3994#true} is VALID [2022-04-27 12:11:00,645 INFO L290 TraceCheckUtils]: 78: Hoare triple {3994#true} assume true; {3994#true} is VALID [2022-04-27 12:11:00,646 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {3994#true} {4230#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #56#return; {4230#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 12:11:00,646 INFO L272 TraceCheckUtils]: 80: Hoare triple {4230#(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)); {4249#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:11:00,647 INFO L290 TraceCheckUtils]: 81: Hoare triple {4249#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4253#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:11:00,647 INFO L290 TraceCheckUtils]: 82: Hoare triple {4253#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3995#false} is VALID [2022-04-27 12:11:00,647 INFO L290 TraceCheckUtils]: 83: Hoare triple {3995#false} assume !false; {3995#false} is VALID [2022-04-27 12:11:00,647 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 12:11:00,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:11:01,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:11:01,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701126743] [2022-04-27 12:11:01,457 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:11:01,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556078830] [2022-04-27 12:11:01,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556078830] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:11:01,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:11:01,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 12:11:01,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357974216] [2022-04-27 12:11:01,458 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:11:01,458 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 84 [2022-04-27 12:11:01,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:11:01,458 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 12:11:01,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:11:01,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 12:11:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:11:01,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 12:11:01,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2022-04-27 12:11:01,501 INFO L87 Difference]: Start difference. First operand 53 states and 61 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 12:11:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:11:02,465 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-04-27 12:11:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 12:11:02,466 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 84 [2022-04-27 12:11:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:11:02,466 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 12:11:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-27 12:11:02,467 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 12:11:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-27 12:11:02,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 68 transitions. [2022-04-27 12:11:02,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:11:02,531 INFO L225 Difference]: With dead ends: 62 [2022-04-27 12:11:02,532 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 12:11:02,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2022-04-27 12:11:02,532 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:11:02,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 363 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 12:11:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 12:11:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 12:11:02,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:11:02,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 12:11:02,571 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 12:11:02,572 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 12:11:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:11:02,574 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-04-27 12:11:02,574 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-04-27 12:11:02,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:11:02,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:11:02,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 56 states. [2022-04-27 12:11:02,575 INFO L87 Difference]: Start difference. First operand has 56 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 56 states. [2022-04-27 12:11:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:11:02,576 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-04-27 12:11:02,576 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-04-27 12:11:02,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:11:02,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:11:02,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:11:02,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:11:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 12:11:02,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-04-27 12:11:02,579 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 84 [2022-04-27 12:11:02,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:11:02,579 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-04-27 12:11:02,579 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 12:11:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-04-27 12:11:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 12:11:02,580 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:11:02,580 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:11:02,592 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 12:11:02,792 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 12:11:02,793 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:11:02,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:11:02,793 INFO L85 PathProgramCache]: Analyzing trace with hash -94164991, now seen corresponding path program 9 times [2022-04-27 12:11:02,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:11:02,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469432604] [2022-04-27 12:11:02,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:11:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:11:02,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:11:02,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765190932] [2022-04-27 12:11:02,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:11:02,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:11:02,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:11:02,809 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 12:11:02,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process