/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/loop-invgen/nested9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:48:07,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:48:07,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:48:07,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:48:07,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:48:07,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:48:07,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:48:07,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:48:07,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:48:07,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:48:07,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:48:07,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:48:07,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:48:07,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:48:07,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:48:07,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:48:07,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:48:07,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:48:07,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:48:07,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:48:07,391 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:48:07,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:48:07,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:48:07,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:48:07,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:48:07,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:48:07,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:48:07,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:48:07,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:48:07,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:48:07,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:48:07,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:48:07,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:48:07,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:48:07,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:48:07,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:48:07,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:48:07,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:48:07,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:48:07,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:48:07,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:48:07,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:48:07,409 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 10:48:07,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:48:07,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:48:07,429 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:48:07,430 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:48:07,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:48:07,430 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:48:07,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:48:07,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:48:07,431 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:48:07,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:48:07,431 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:48:07,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:48:07,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:48:07,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:48:07,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:48:07,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:48:07,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:48:07,432 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:48:07,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:48:07,432 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:48:07,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:48:07,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:48:07,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:48:07,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:48:07,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:48:07,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:48:07,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:48:07,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:48:07,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:48:07,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:48:07,433 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:48:07,433 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:48:07,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:48:07,433 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 10:48:07,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:48:07,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:48:07,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:48:07,603 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:48:07,604 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:48:07,605 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9.i [2022-04-27 10:48:07,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc9ffb39/d1d6a4e802394e95b828ed9ffb5d70c0/FLAGca6cc82da [2022-04-27 10:48:08,003 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:48:08,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i [2022-04-27 10:48:08,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc9ffb39/d1d6a4e802394e95b828ed9ffb5d70c0/FLAGca6cc82da [2022-04-27 10:48:08,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc9ffb39/d1d6a4e802394e95b828ed9ffb5d70c0 [2022-04-27 10:48:08,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:48:08,025 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:48:08,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:48:08,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:48:08,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:48:08,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:48:08" (1/1) ... [2022-04-27 10:48:08,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d6bf0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:08, skipping insertion in model container [2022-04-27 10:48:08,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:48:08" (1/1) ... [2022-04-27 10:48:08,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:48:08,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:48:08,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i[893,906] [2022-04-27 10:48:08,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:48:08,218 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:48:08,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i[893,906] [2022-04-27 10:48:08,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:48:08,251 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:48:08,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:08 WrapperNode [2022-04-27 10:48:08,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:48:08,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:48:08,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:48:08,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:48:08,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:08" (1/1) ... [2022-04-27 10:48:08,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:08" (1/1) ... [2022-04-27 10:48:08,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:08" (1/1) ... [2022-04-27 10:48:08,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:08" (1/1) ... [2022-04-27 10:48:08,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:08" (1/1) ... [2022-04-27 10:48:08,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:08" (1/1) ... [2022-04-27 10:48:08,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:08" (1/1) ... [2022-04-27 10:48:08,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:48:08,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:48:08,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:48:08,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:48:08,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:08" (1/1) ... [2022-04-27 10:48:08,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:48:08,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:48:08,321 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 10:48:08,339 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 10:48:08,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:48:08,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:48:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:48:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:48:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:48:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:48:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:48:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:48:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:48:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:48:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:48:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:48:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:48:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:48:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:48:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:48:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:48:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:48:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:48:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:48:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:48:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:48:08,419 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:48:08,420 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:48:08,599 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:48:08,603 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:48:08,603 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 10:48:08,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:48:08 BoogieIcfgContainer [2022-04-27 10:48:08,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:48:08,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:48:08,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:48:08,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:48:08,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:48:08" (1/3) ... [2022-04-27 10:48:08,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46faa8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:48:08, skipping insertion in model container [2022-04-27 10:48:08,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:08" (2/3) ... [2022-04-27 10:48:08,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46faa8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:48:08, skipping insertion in model container [2022-04-27 10:48:08,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:48:08" (3/3) ... [2022-04-27 10:48:08,609 INFO L111 eAbstractionObserver]: Analyzing ICFG nested9.i [2022-04-27 10:48:08,617 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:48:08,618 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:48:08,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:48:08,676 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@7ae87b6b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@378e513b [2022-04-27 10:48:08,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:48:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:48:08,692 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:48:08,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:48:08,693 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:48:08,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:48:08,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2111647297, now seen corresponding path program 1 times [2022-04-27 10:48:08,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:48:08,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597148135] [2022-04-27 10:48:08,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:48:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:08,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:48:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:09,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {32#true} is VALID [2022-04-27 10:48:09,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 10:48:09,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #94#return; {32#true} is VALID [2022-04-27 10:48:09,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:48:09,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {32#true} is VALID [2022-04-27 10:48:09,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 10:48:09,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #94#return; {32#true} is VALID [2022-04-27 10:48:09,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2022-04-27 10:48:09,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {32#true} is VALID [2022-04-27 10:48:09,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {32#true} is VALID [2022-04-27 10:48:09,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {32#true} is VALID [2022-04-27 10:48:09,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {32#true} is VALID [2022-04-27 10:48:09,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {32#true} is VALID [2022-04-27 10:48:09,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#true} ~i~0 := 0; {37#(= main_~i~0 0)} is VALID [2022-04-27 10:48:09,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {38#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-27 10:48:09,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:48:09,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 < ~j~0); {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:48:09,020 INFO L272 TraceCheckUtils]: 14: Hoare triple {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {40#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:48:09,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {41#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:48:09,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-27 10:48:09,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 10:48:09,022 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 10:48:09,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:48:09,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597148135] [2022-04-27 10:48:09,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597148135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:48:09,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:48:09,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:48:09,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606219958] [2022-04-27 10:48:09,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:48:09,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:48:09,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:48:09,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:48:09,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:09,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:48:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:48:09,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:48:09,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:48:09,068 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:48:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:09,520 INFO L93 Difference]: Finished difference Result 67 states and 98 transitions. [2022-04-27 10:48:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:48:09,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:48:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:48:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:48:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-27 10:48:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:48:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-27 10:48:09,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2022-04-27 10:48:09,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:09,620 INFO L225 Difference]: With dead ends: 67 [2022-04-27 10:48:09,621 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 10:48:09,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:48:09,627 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:48:09,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 54 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:48:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 10:48:09,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-27 10:48:09,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:48:09,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:48:09,657 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:48:09,657 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:48:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:09,661 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 10:48:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 10:48:09,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:09,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:09,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-27 10:48:09,662 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-27 10:48:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:09,664 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 10:48:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 10:48:09,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:09,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:09,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:48:09,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:48:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:48:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-27 10:48:09,668 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 18 [2022-04-27 10:48:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:48:09,668 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-27 10:48:09,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:48:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-27 10:48:09,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:48:09,669 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:48:09,669 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:48:09,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:48:09,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:48:09,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:48:09,670 INFO L85 PathProgramCache]: Analyzing trace with hash 192634036, now seen corresponding path program 1 times [2022-04-27 10:48:09,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:48:09,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085047118] [2022-04-27 10:48:09,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:09,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:48:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:09,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:48:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:09,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {283#true} is VALID [2022-04-27 10:48:09,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-27 10:48:09,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {283#true} {283#true} #94#return; {283#true} is VALID [2022-04-27 10:48:09,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {295#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:48:09,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {283#true} is VALID [2022-04-27 10:48:09,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-27 10:48:09,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {283#true} {283#true} #94#return; {283#true} is VALID [2022-04-27 10:48:09,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {283#true} call #t~ret7 := main(); {283#true} is VALID [2022-04-27 10:48:09,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {283#true} is VALID [2022-04-27 10:48:09,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {283#true} is VALID [2022-04-27 10:48:09,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {283#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {283#true} is VALID [2022-04-27 10:48:09,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {283#true} is VALID [2022-04-27 10:48:09,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {283#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {283#true} is VALID [2022-04-27 10:48:09,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#true} ~i~0 := 0; {288#(= main_~i~0 0)} is VALID [2022-04-27 10:48:09,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {288#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {289#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-27 10:48:09,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} assume !(~j~0 < 3 * ~i~0); {289#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-27 10:48:09,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {289#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {290#(<= 1 main_~n~0)} is VALID [2022-04-27 10:48:09,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {290#(<= 1 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {291#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:09,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {291#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:09,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {291#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {292#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:09,802 INFO L272 TraceCheckUtils]: 17: Hoare triple {292#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:48:09,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {293#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {294#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:48:09,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {294#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {284#false} is VALID [2022-04-27 10:48:09,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-04-27 10:48:09,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:48:09,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:48:09,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085047118] [2022-04-27 10:48:09,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085047118] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:48:09,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664256703] [2022-04-27 10:48:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:09,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:09,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:48:09,806 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 10:48:09,810 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 10:48:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:09,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:48:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:09,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:48:10,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {283#true} is VALID [2022-04-27 10:48:10,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#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);~__BLAST_NONDET~0 := 0; {283#true} is VALID [2022-04-27 10:48:10,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-27 10:48:10,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {283#true} {283#true} #94#return; {283#true} is VALID [2022-04-27 10:48:10,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {283#true} call #t~ret7 := main(); {283#true} is VALID [2022-04-27 10:48:10,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {283#true} is VALID [2022-04-27 10:48:10,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {283#true} is VALID [2022-04-27 10:48:10,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {283#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {283#true} is VALID [2022-04-27 10:48:10,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {283#true} is VALID [2022-04-27 10:48:10,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {283#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {283#true} is VALID [2022-04-27 10:48:10,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#true} ~i~0 := 0; {329#(<= 0 main_~i~0)} is VALID [2022-04-27 10:48:10,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {329#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {329#(<= 0 main_~i~0)} is VALID [2022-04-27 10:48:10,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {329#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {329#(<= 0 main_~i~0)} is VALID [2022-04-27 10:48:10,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {329#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {339#(<= 1 main_~i~0)} is VALID [2022-04-27 10:48:10,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {339#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {343#(and (< main_~i~0 main_~n~0) (<= 1 main_~i~0))} is VALID [2022-04-27 10:48:10,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {343#(and (< main_~i~0 main_~n~0) (<= 1 main_~i~0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {347#(and (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0) (<= 1 main_~i~0))} is VALID [2022-04-27 10:48:10,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {347#(and (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0) (<= 1 main_~i~0))} assume !!(~k~0 < ~j~0); {347#(and (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0) (<= 1 main_~i~0))} is VALID [2022-04-27 10:48:10,262 INFO L272 TraceCheckUtils]: 17: Hoare triple {347#(and (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0) (<= 1 main_~i~0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {354#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:48:10,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {354#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {358#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:48:10,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {358#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {284#false} is VALID [2022-04-27 10:48:10,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-04-27 10:48:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:48:10,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:48:10,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664256703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:48:10,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:48:10,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-04-27 10:48:10,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062919160] [2022-04-27 10:48:10,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:48:10,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 10:48:10,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:48:10,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:48:10,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:10,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:48:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:48:10,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:48:10,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:48:10,291 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:48:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:10,507 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-27 10:48:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:48:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 10:48:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:48:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:48:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-04-27 10:48:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:48:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-04-27 10:48:10,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2022-04-27 10:48:10,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:10,554 INFO L225 Difference]: With dead ends: 49 [2022-04-27 10:48:10,554 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 10:48:10,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-27 10:48:10,556 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:48:10,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 89 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:48:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 10:48:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2022-04-27 10:48:10,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:48:10,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:10,578 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:10,579 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:10,587 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-27 10:48:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-27 10:48:10,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:10,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:10,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-27 10:48:10,590 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-27 10:48:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:10,597 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-27 10:48:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-27 10:48:10,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:10,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:10,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:48:10,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:48:10,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-27 10:48:10,600 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2022-04-27 10:48:10,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:48:10,600 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-27 10:48:10,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:48:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-27 10:48:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:48:10,604 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:48:10,604 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, 1] [2022-04-27 10:48:10,625 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 10:48:10,804 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 10:48:10,805 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:48:10,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:48:10,805 INFO L85 PathProgramCache]: Analyzing trace with hash -450009679, now seen corresponding path program 1 times [2022-04-27 10:48:10,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:48:10,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839169366] [2022-04-27 10:48:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:10,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:48:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:10,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:48:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:10,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {571#true} is VALID [2022-04-27 10:48:10,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-27 10:48:10,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {571#true} {571#true} #94#return; {571#true} is VALID [2022-04-27 10:48:10,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 10:48:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:10,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {571#true} ~cond := #in~cond; {571#true} is VALID [2022-04-27 10:48:10,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#true} assume !(0 == ~cond); {571#true} is VALID [2022-04-27 10:48:10,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-27 10:48:10,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {571#true} {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} #92#return; {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:48:10,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {586#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:48:10,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {571#true} is VALID [2022-04-27 10:48:10,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-27 10:48:10,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {571#true} {571#true} #94#return; {571#true} is VALID [2022-04-27 10:48:10,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {571#true} call #t~ret7 := main(); {571#true} is VALID [2022-04-27 10:48:10,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {571#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {571#true} is VALID [2022-04-27 10:48:10,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {571#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {571#true} is VALID [2022-04-27 10:48:10,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {571#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {571#true} is VALID [2022-04-27 10:48:10,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {571#true} is VALID [2022-04-27 10:48:10,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {571#true} is VALID [2022-04-27 10:48:10,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#true} ~i~0 := 0; {576#(= main_~i~0 0)} is VALID [2022-04-27 10:48:10,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {577#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-27 10:48:10,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {577#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:48:10,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 < ~j~0); {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:48:10,944 INFO L272 TraceCheckUtils]: 14: Hoare triple {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {571#true} is VALID [2022-04-27 10:48:10,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {571#true} ~cond := #in~cond; {571#true} is VALID [2022-04-27 10:48:10,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {571#true} assume !(0 == ~cond); {571#true} is VALID [2022-04-27 10:48:10,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-27 10:48:10,945 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {571#true} {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} #92#return; {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:48:10,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {583#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 10:48:10,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {583#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} assume !!(~k~0 < ~j~0); {583#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 10:48:10,947 INFO L272 TraceCheckUtils]: 21: Hoare triple {583#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:48:10,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {584#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {585#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:48:10,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {585#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {572#false} is VALID [2022-04-27 10:48:10,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-27 10:48:10,948 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 10:48:10,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:48:10,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839169366] [2022-04-27 10:48:10,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839169366] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:48:10,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073755785] [2022-04-27 10:48:10,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:10,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:10,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:48:10,952 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 10:48:10,987 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 10:48:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:11,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 10:48:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:11,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:48:11,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-27 10:48:11,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#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);~__BLAST_NONDET~0 := 0; {571#true} is VALID [2022-04-27 10:48:11,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-27 10:48:11,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {571#true} {571#true} #94#return; {571#true} is VALID [2022-04-27 10:48:11,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {571#true} call #t~ret7 := main(); {571#true} is VALID [2022-04-27 10:48:11,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {571#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {571#true} is VALID [2022-04-27 10:48:11,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {571#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {571#true} is VALID [2022-04-27 10:48:11,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {571#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {571#true} is VALID [2022-04-27 10:48:11,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {571#true} is VALID [2022-04-27 10:48:11,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {571#true} is VALID [2022-04-27 10:48:11,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#true} ~i~0 := 0; {620#(<= main_~i~0 0)} is VALID [2022-04-27 10:48:11,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {620#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {624#(and (<= main_~i~0 0) (<= (* main_~i~0 2) main_~j~0))} is VALID [2022-04-27 10:48:11,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {624#(and (<= main_~i~0 0) (<= (* main_~i~0 2) main_~j~0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {572#false} is VALID [2022-04-27 10:48:11,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {572#false} assume !!(~k~0 < ~j~0); {572#false} is VALID [2022-04-27 10:48:11,103 INFO L272 TraceCheckUtils]: 14: Hoare triple {572#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {572#false} is VALID [2022-04-27 10:48:11,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-27 10:48:11,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {572#false} assume !(0 == ~cond); {572#false} is VALID [2022-04-27 10:48:11,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} assume true; {572#false} is VALID [2022-04-27 10:48:11,105 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {572#false} {572#false} #92#return; {572#false} is VALID [2022-04-27 10:48:11,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {572#false} is VALID [2022-04-27 10:48:11,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {572#false} assume !!(~k~0 < ~j~0); {572#false} is VALID [2022-04-27 10:48:11,115 INFO L272 TraceCheckUtils]: 21: Hoare triple {572#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {572#false} is VALID [2022-04-27 10:48:11,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-27 10:48:11,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-27 10:48:11,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-27 10:48:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:48:11,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:48:11,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073755785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:48:11,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:48:11,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-04-27 10:48:11,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861484961] [2022-04-27 10:48:11,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:48:11,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-27 10:48:11,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:48:11,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:48:11,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:11,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:48:11,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:48:11,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:48:11,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:48:11,133 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:48:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:11,172 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 10:48:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:48:11,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-27 10:48:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:48:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:48:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-27 10:48:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:48:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-27 10:48:11,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-04-27 10:48:11,200 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 10:48:11,201 INFO L225 Difference]: With dead ends: 52 [2022-04-27 10:48:11,202 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 10:48:11,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:48:11,203 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:48:11,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:48:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 10:48:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-27 10:48:11,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:48:11,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:11,223 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:11,223 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:11,224 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 10:48:11,224 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 10:48:11,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:11,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:11,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-27 10:48:11,225 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-27 10:48:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:11,227 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 10:48:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 10:48:11,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:11,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:11,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:48:11,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:48:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-27 10:48:11,228 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2022-04-27 10:48:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:48:11,229 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-27 10:48:11,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:48:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 10:48:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 10:48:11,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:48:11,230 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:48:11,257 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 10:48:11,443 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 10:48:11,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:48:11,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:48:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1971686684, now seen corresponding path program 1 times [2022-04-27 10:48:11,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:48:11,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394387686] [2022-04-27 10:48:11,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:48:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:11,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:48:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:11,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {863#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {849#true} is VALID [2022-04-27 10:48:11,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {849#true} assume true; {849#true} is VALID [2022-04-27 10:48:11,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {849#true} {849#true} #94#return; {849#true} is VALID [2022-04-27 10:48:11,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 10:48:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:11,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {849#true} ~cond := #in~cond; {849#true} is VALID [2022-04-27 10:48:11,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {849#true} assume !(0 == ~cond); {849#true} is VALID [2022-04-27 10:48:11,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {849#true} assume true; {849#true} is VALID [2022-04-27 10:48:11,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {849#true} {857#(<= main_~j~0 (+ main_~k~0 1))} #92#return; {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 10:48:11,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {849#true} call ULTIMATE.init(); {863#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:48:11,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {863#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {849#true} is VALID [2022-04-27 10:48:11,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {849#true} assume true; {849#true} is VALID [2022-04-27 10:48:11,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {849#true} {849#true} #94#return; {849#true} is VALID [2022-04-27 10:48:11,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {849#true} call #t~ret7 := main(); {849#true} is VALID [2022-04-27 10:48:11,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {849#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {849#true} is VALID [2022-04-27 10:48:11,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {849#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {849#true} is VALID [2022-04-27 10:48:11,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {849#true} is VALID [2022-04-27 10:48:11,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {849#true} is VALID [2022-04-27 10:48:11,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {849#true} is VALID [2022-04-27 10:48:11,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#true} ~i~0 := 0; {854#(= main_~i~0 0)} is VALID [2022-04-27 10:48:11,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {854#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {854#(= main_~i~0 0)} is VALID [2022-04-27 10:48:11,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {854#(= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {854#(= main_~i~0 0)} is VALID [2022-04-27 10:48:11,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {854#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {855#(<= main_~i~0 1)} is VALID [2022-04-27 10:48:11,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {855#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {856#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:48:11,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {856#(<= main_~j~0 (+ main_~i~0 1))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 10:48:11,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {857#(<= main_~j~0 (+ main_~k~0 1))} assume !!(~k~0 < ~j~0); {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 10:48:11,518 INFO L272 TraceCheckUtils]: 17: Hoare triple {857#(<= main_~j~0 (+ main_~k~0 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {849#true} is VALID [2022-04-27 10:48:11,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {849#true} ~cond := #in~cond; {849#true} is VALID [2022-04-27 10:48:11,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {849#true} assume !(0 == ~cond); {849#true} is VALID [2022-04-27 10:48:11,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {849#true} assume true; {849#true} is VALID [2022-04-27 10:48:11,519 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {849#true} {857#(<= main_~j~0 (+ main_~k~0 1))} #92#return; {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 10:48:11,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {857#(<= main_~j~0 (+ main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {862#(<= main_~j~0 main_~k~0)} is VALID [2022-04-27 10:48:11,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {862#(<= main_~j~0 main_~k~0)} assume !!(~k~0 < ~j~0); {850#false} is VALID [2022-04-27 10:48:11,520 INFO L272 TraceCheckUtils]: 24: Hoare triple {850#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {850#false} is VALID [2022-04-27 10:48:11,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {850#false} ~cond := #in~cond; {850#false} is VALID [2022-04-27 10:48:11,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {850#false} assume 0 == ~cond; {850#false} is VALID [2022-04-27 10:48:11,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {850#false} assume !false; {850#false} is VALID [2022-04-27 10:48:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:48:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:48:11,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394387686] [2022-04-27 10:48:11,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394387686] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:48:11,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677178049] [2022-04-27 10:48:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:11,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:11,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:48:11,528 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 10:48:11,529 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 10:48:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:11,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:48:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:11,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:48:12,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {849#true} call ULTIMATE.init(); {849#true} is VALID [2022-04-27 10:48:12,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {849#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);~__BLAST_NONDET~0 := 0; {849#true} is VALID [2022-04-27 10:48:12,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {849#true} assume true; {849#true} is VALID [2022-04-27 10:48:12,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {849#true} {849#true} #94#return; {849#true} is VALID [2022-04-27 10:48:12,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {849#true} call #t~ret7 := main(); {849#true} is VALID [2022-04-27 10:48:12,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {849#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {849#true} is VALID [2022-04-27 10:48:12,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {849#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {849#true} is VALID [2022-04-27 10:48:12,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {849#true} is VALID [2022-04-27 10:48:12,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {849#true} is VALID [2022-04-27 10:48:12,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {849#true} is VALID [2022-04-27 10:48:12,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#true} ~i~0 := 0; {897#(<= main_~i~0 0)} is VALID [2022-04-27 10:48:12,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {897#(<= main_~i~0 0)} is VALID [2022-04-27 10:48:12,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#(<= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {897#(<= main_~i~0 0)} is VALID [2022-04-27 10:48:12,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {897#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {855#(<= main_~i~0 1)} is VALID [2022-04-27 10:48:12,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {855#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {910#(and (<= main_~j~0 (* main_~i~0 2)) (<= main_~i~0 1))} is VALID [2022-04-27 10:48:12,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {910#(and (<= main_~j~0 (* main_~i~0 2)) (<= main_~i~0 1))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} is VALID [2022-04-27 10:48:12,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} assume !!(~k~0 < ~j~0); {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} is VALID [2022-04-27 10:48:12,127 INFO L272 TraceCheckUtils]: 17: Hoare triple {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {849#true} is VALID [2022-04-27 10:48:12,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {849#true} ~cond := #in~cond; {849#true} is VALID [2022-04-27 10:48:12,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {849#true} assume !(0 == ~cond); {849#true} is VALID [2022-04-27 10:48:12,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {849#true} assume true; {849#true} is VALID [2022-04-27 10:48:12,128 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {849#true} {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} #92#return; {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} is VALID [2022-04-27 10:48:12,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {936#(and (<= (+ (div (* (- 1) main_~j~0) (- 2)) 1) main_~k~0) (<= (div (- main_~j~0) (- 2)) 1))} is VALID [2022-04-27 10:48:12,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {936#(and (<= (+ (div (* (- 1) main_~j~0) (- 2)) 1) main_~k~0) (<= (div (- main_~j~0) (- 2)) 1))} assume !!(~k~0 < ~j~0); {850#false} is VALID [2022-04-27 10:48:12,129 INFO L272 TraceCheckUtils]: 24: Hoare triple {850#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {850#false} is VALID [2022-04-27 10:48:12,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {850#false} ~cond := #in~cond; {850#false} is VALID [2022-04-27 10:48:12,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {850#false} assume 0 == ~cond; {850#false} is VALID [2022-04-27 10:48:12,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {850#false} assume !false; {850#false} is VALID [2022-04-27 10:48:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:48:12,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:48:12,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {850#false} assume !false; {850#false} is VALID [2022-04-27 10:48:12,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {850#false} assume 0 == ~cond; {850#false} is VALID [2022-04-27 10:48:12,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {850#false} ~cond := #in~cond; {850#false} is VALID [2022-04-27 10:48:12,257 INFO L272 TraceCheckUtils]: 24: Hoare triple {850#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {850#false} is VALID [2022-04-27 10:48:12,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {862#(<= main_~j~0 main_~k~0)} assume !!(~k~0 < ~j~0); {850#false} is VALID [2022-04-27 10:48:12,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {857#(<= main_~j~0 (+ main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {862#(<= main_~j~0 main_~k~0)} is VALID [2022-04-27 10:48:12,258 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {849#true} {857#(<= main_~j~0 (+ main_~k~0 1))} #92#return; {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 10:48:12,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {849#true} assume true; {849#true} is VALID [2022-04-27 10:48:12,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {849#true} assume !(0 == ~cond); {849#true} is VALID [2022-04-27 10:48:12,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {849#true} ~cond := #in~cond; {849#true} is VALID [2022-04-27 10:48:12,259 INFO L272 TraceCheckUtils]: 17: Hoare triple {857#(<= main_~j~0 (+ main_~k~0 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {849#true} is VALID [2022-04-27 10:48:12,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {857#(<= main_~j~0 (+ main_~k~0 1))} assume !!(~k~0 < ~j~0); {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 10:48:12,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {856#(<= main_~j~0 (+ main_~i~0 1))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 10:48:12,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {855#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {856#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:48:12,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {897#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {855#(<= main_~i~0 1)} is VALID [2022-04-27 10:48:12,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#(<= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {897#(<= main_~i~0 0)} is VALID [2022-04-27 10:48:12,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {897#(<= main_~i~0 0)} is VALID [2022-04-27 10:48:12,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#true} ~i~0 := 0; {897#(<= main_~i~0 0)} is VALID [2022-04-27 10:48:12,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {849#true} is VALID [2022-04-27 10:48:12,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {849#true} is VALID [2022-04-27 10:48:12,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {849#true} is VALID [2022-04-27 10:48:12,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {849#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {849#true} is VALID [2022-04-27 10:48:12,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {849#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {849#true} is VALID [2022-04-27 10:48:12,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {849#true} call #t~ret7 := main(); {849#true} is VALID [2022-04-27 10:48:12,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {849#true} {849#true} #94#return; {849#true} is VALID [2022-04-27 10:48:12,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {849#true} assume true; {849#true} is VALID [2022-04-27 10:48:12,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {849#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);~__BLAST_NONDET~0 := 0; {849#true} is VALID [2022-04-27 10:48:12,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {849#true} call ULTIMATE.init(); {849#true} is VALID [2022-04-27 10:48:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:48:12,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677178049] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:48:12,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:48:12,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-27 10:48:12,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378871904] [2022-04-27 10:48:12,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:48:12,278 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-27 10:48:12,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:48:12,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:12,309 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 10:48:12,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:48:12,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:48:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:48:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:48:12,310 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:12,861 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-27 10:48:12,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:48:12,862 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-27 10:48:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:48:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 10:48:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 10:48:12,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-27 10:48:12,912 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 10:48:12,913 INFO L225 Difference]: With dead ends: 66 [2022-04-27 10:48:12,913 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 10:48:12,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:48:12,914 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:48:12,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 55 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:48:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 10:48:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-04-27 10:48:12,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:48:12,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:48:12,955 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:48:12,956 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:48:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:12,957 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-27 10:48:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-27 10:48:12,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:12,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:12,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-04-27 10:48:12,960 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-04-27 10:48:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:12,961 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-27 10:48:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-27 10:48:12,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:12,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:12,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:48:12,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:48:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:48:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-04-27 10:48:12,963 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 28 [2022-04-27 10:48:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:48:12,964 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-04-27 10:48:12,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:48:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 10:48:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 10:48:12,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:48:12,965 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:48:12,981 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 10:48:13,181 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 10:48:13,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:48:13,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:48:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash -186544382, now seen corresponding path program 1 times [2022-04-27 10:48:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:48:13,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590778795] [2022-04-27 10:48:13,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:48:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:48:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:13,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {1317#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1306#true} is VALID [2022-04-27 10:48:13,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-27 10:48:13,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1306#true} {1306#true} #94#return; {1306#true} is VALID [2022-04-27 10:48:13,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 10:48:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:13,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-27 10:48:13,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-27 10:48:13,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-27 10:48:13,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1307#false} #92#return; {1307#false} is VALID [2022-04-27 10:48:13,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1317#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:48:13,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {1317#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1306#true} is VALID [2022-04-27 10:48:13,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-27 10:48:13,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #94#return; {1306#true} is VALID [2022-04-27 10:48:13,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret7 := main(); {1306#true} is VALID [2022-04-27 10:48:13,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1306#true} is VALID [2022-04-27 10:48:13,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1306#true} is VALID [2022-04-27 10:48:13,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {1306#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1306#true} is VALID [2022-04-27 10:48:13,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {1306#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1306#true} is VALID [2022-04-27 10:48:13,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {1306#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1306#true} is VALID [2022-04-27 10:48:13,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {1306#true} ~i~0 := 0; {1306#true} is VALID [2022-04-27 10:48:13,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {1306#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1306#true} is VALID [2022-04-27 10:48:13,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {1306#true} assume !(~j~0 < 3 * ~i~0); {1306#true} is VALID [2022-04-27 10:48:13,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {1306#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1306#true} is VALID [2022-04-27 10:48:13,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {1306#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1311#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-27 10:48:13,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {1311#(<= (* main_~i~0 2) main_~j~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1312#(<= (+ main_~k~0 1) main_~j~0)} is VALID [2022-04-27 10:48:13,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {1312#(<= (+ main_~k~0 1) main_~j~0)} assume !(~k~0 < ~j~0); {1307#false} is VALID [2022-04-27 10:48:13,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {1307#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1307#false} is VALID [2022-04-27 10:48:13,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {1307#false} assume !(~j~0 < 3 * ~i~0); {1307#false} is VALID [2022-04-27 10:48:13,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {1307#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1307#false} is VALID [2022-04-27 10:48:13,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {1307#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1307#false} is VALID [2022-04-27 10:48:13,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {1307#false} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1307#false} is VALID [2022-04-27 10:48:13,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {1307#false} assume !!(~k~0 < ~j~0); {1307#false} is VALID [2022-04-27 10:48:13,245 INFO L272 TraceCheckUtils]: 23: Hoare triple {1307#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1306#true} is VALID [2022-04-27 10:48:13,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-27 10:48:13,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-27 10:48:13,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-27 10:48:13,245 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1306#true} {1307#false} #92#return; {1307#false} is VALID [2022-04-27 10:48:13,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {1307#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1307#false} is VALID [2022-04-27 10:48:13,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {1307#false} assume !!(~k~0 < ~j~0); {1307#false} is VALID [2022-04-27 10:48:13,245 INFO L272 TraceCheckUtils]: 30: Hoare triple {1307#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1307#false} is VALID [2022-04-27 10:48:13,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-27 10:48:13,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-27 10:48:13,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-27 10:48:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:48:13,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:48:13,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590778795] [2022-04-27 10:48:13,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590778795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:48:13,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:48:13,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:48:13,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102597373] [2022-04-27 10:48:13,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:48:13,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-04-27 10:48:13,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:48:13,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:48:13,266 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 10:48:13,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:48:13,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:48:13,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:48:13,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:48:13,267 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:48:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:13,408 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-27 10:48:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:48:13,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-04-27 10:48:13,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:48:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:48:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 10:48:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:48:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 10:48:13,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-27 10:48:13,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:13,444 INFO L225 Difference]: With dead ends: 66 [2022-04-27 10:48:13,444 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 10:48:13,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:48:13,445 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:48:13,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 30 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:48:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 10:48:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 10:48:13,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:48:13,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:48:13,493 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:48:13,493 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:48:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:13,494 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 10:48:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 10:48:13,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:13,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:13,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-27 10:48:13,495 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-27 10:48:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:13,496 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 10:48:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 10:48:13,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:13,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:13,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:48:13,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:48:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:48:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-27 10:48:13,497 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 34 [2022-04-27 10:48:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:48:13,498 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-27 10:48:13,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:48:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 10:48:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 10:48:13,498 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:48:13,498 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:48:13,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:48:13,498 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:48:13,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:48:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 50284442, now seen corresponding path program 2 times [2022-04-27 10:48:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:48:13,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863011270] [2022-04-27 10:48:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:48:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:48:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:13,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:48:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:13,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {1586#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1566#true} is VALID [2022-04-27 10:48:13,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-27 10:48:13,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-27 10:48:13,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 10:48:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:13,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-27 10:48:13,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-27 10:48:13,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-27 10:48:13,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1573#(<= 2 main_~n~0)} #92#return; {1573#(<= 2 main_~n~0)} is VALID [2022-04-27 10:48:13,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 10:48:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:13,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-27 10:48:13,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-27 10:48:13,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-27 10:48:13,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:13,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1586#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:48:13,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {1586#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~__BLAST_NONDET~0 := 0; {1566#true} is VALID [2022-04-27 10:48:13,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-27 10:48:13,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-27 10:48:13,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret7 := main(); {1566#true} is VALID [2022-04-27 10:48:13,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1566#true} is VALID [2022-04-27 10:48:13,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {1566#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1566#true} is VALID [2022-04-27 10:48:13,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1566#true} is VALID [2022-04-27 10:48:13,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1566#true} is VALID [2022-04-27 10:48:13,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1566#true} is VALID [2022-04-27 10:48:13,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {1566#true} ~i~0 := 0; {1571#(= main_~i~0 0)} is VALID [2022-04-27 10:48:13,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {1571#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1571#(= main_~i~0 0)} is VALID [2022-04-27 10:48:13,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#(= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {1571#(= main_~i~0 0)} is VALID [2022-04-27 10:48:13,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {1571#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1572#(<= 1 main_~i~0)} is VALID [2022-04-27 10:48:13,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {1572#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1573#(<= 2 main_~n~0)} is VALID [2022-04-27 10:48:13,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {1573#(<= 2 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1573#(<= 2 main_~n~0)} is VALID [2022-04-27 10:48:13,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {1573#(<= 2 main_~n~0)} assume !!(~k~0 < ~j~0); {1573#(<= 2 main_~n~0)} is VALID [2022-04-27 10:48:13,657 INFO L272 TraceCheckUtils]: 17: Hoare triple {1573#(<= 2 main_~n~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1566#true} is VALID [2022-04-27 10:48:13,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-27 10:48:13,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-27 10:48:13,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-27 10:48:13,657 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1566#true} {1573#(<= 2 main_~n~0)} #92#return; {1573#(<= 2 main_~n~0)} is VALID [2022-04-27 10:48:13,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {1573#(<= 2 main_~n~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1573#(<= 2 main_~n~0)} is VALID [2022-04-27 10:48:13,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {1573#(<= 2 main_~n~0)} assume !(~k~0 < ~j~0); {1573#(<= 2 main_~n~0)} is VALID [2022-04-27 10:48:13,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {1573#(<= 2 main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1573#(<= 2 main_~n~0)} is VALID [2022-04-27 10:48:13,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {1573#(<= 2 main_~n~0)} assume !(~j~0 < 3 * ~i~0); {1573#(<= 2 main_~n~0)} is VALID [2022-04-27 10:48:13,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {1573#(<= 2 main_~n~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1573#(<= 2 main_~n~0)} is VALID [2022-04-27 10:48:13,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {1573#(<= 2 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:13,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:13,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:13,660 INFO L272 TraceCheckUtils]: 30: Hoare triple {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1566#true} is VALID [2022-04-27 10:48:13,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-27 10:48:13,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-27 10:48:13,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-27 10:48:13,661 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1566#true} {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} #92#return; {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:13,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:13,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} assume !!(~k~0 < ~j~0); {1583#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:13,662 INFO L272 TraceCheckUtils]: 37: Hoare triple {1583#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:48:13,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {1584#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1585#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:48:13,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {1585#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1567#false} is VALID [2022-04-27 10:48:13,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-27 10:48:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 10:48:13,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:48:13,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863011270] [2022-04-27 10:48:13,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863011270] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:48:13,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102721681] [2022-04-27 10:48:13,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:48:13,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:13,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:48:13,667 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 10:48:13,671 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 10:48:13,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 10:48:13,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:48:13,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:48:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:48:13,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:48:14,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-27 10:48:14,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#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);~__BLAST_NONDET~0 := 0; {1566#true} is VALID [2022-04-27 10:48:14,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-27 10:48:14,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-27 10:48:14,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret7 := main(); {1566#true} is VALID [2022-04-27 10:48:14,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1566#true} is VALID [2022-04-27 10:48:14,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {1566#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {1566#true} ~i~0 := 0; {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {1566#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {1566#true} assume !(~j~0 < 3 * ~i~0); {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {1566#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {1566#true} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {1566#true} assume !!(~k~0 < ~j~0); {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L272 TraceCheckUtils]: 17: Hoare triple {1566#true} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-27 10:48:14,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-27 10:48:14,025 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1566#true} {1566#true} #92#return; {1566#true} is VALID [2022-04-27 10:48:14,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {1566#true} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1566#true} is VALID [2022-04-27 10:48:14,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} assume !(~k~0 < ~j~0); {1566#true} is VALID [2022-04-27 10:48:14,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1566#true} is VALID [2022-04-27 10:48:14,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} assume !(~j~0 < 3 * ~i~0); {1566#true} is VALID [2022-04-27 10:48:14,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {1566#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1566#true} is VALID [2022-04-27 10:48:14,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {1566#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1671#(< main_~i~0 main_~n~0)} is VALID [2022-04-27 10:48:14,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {1671#(< main_~i~0 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-27 10:48:14,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-27 10:48:14,031 INFO L272 TraceCheckUtils]: 30: Hoare triple {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1566#true} is VALID [2022-04-27 10:48:14,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-27 10:48:14,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-27 10:48:14,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-27 10:48:14,032 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1566#true} {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #92#return; {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-27 10:48:14,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-27 10:48:14,033 INFO L290 TraceCheckUtils]: 36: Hoare triple {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} assume !!(~k~0 < ~j~0); {1700#(and (< main_~i~0 main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} is VALID [2022-04-27 10:48:14,034 INFO L272 TraceCheckUtils]: 37: Hoare triple {1700#(and (< main_~i~0 main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:48:14,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:48:14,034 INFO L290 TraceCheckUtils]: 39: Hoare triple {1708#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-27 10:48:14,034 INFO L290 TraceCheckUtils]: 40: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-27 10:48:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 10:48:14,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:48:14,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-27 10:48:14,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {1708#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-27 10:48:14,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:48:14,240 INFO L272 TraceCheckUtils]: 37: Hoare triple {1724#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:48:14,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {1724#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:14,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-27 10:48:14,242 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1566#true} {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} #92#return; {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-27 10:48:14,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-27 10:48:14,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-27 10:48:14,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-27 10:48:14,242 INFO L272 TraceCheckUtils]: 30: Hoare triple {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1566#true} is VALID [2022-04-27 10:48:14,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} assume !!(~k~0 < ~j~0); {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-27 10:48:14,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {1753#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-27 10:48:14,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {1566#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1753#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-27 10:48:14,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {1566#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1566#true} is VALID [2022-04-27 10:48:14,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} assume !(~j~0 < 3 * ~i~0); {1566#true} is VALID [2022-04-27 10:48:14,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1566#true} is VALID [2022-04-27 10:48:14,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} assume !(~k~0 < ~j~0); {1566#true} is VALID [2022-04-27 10:48:14,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {1566#true} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1566#true} is VALID [2022-04-27 10:48:14,243 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1566#true} {1566#true} #92#return; {1566#true} is VALID [2022-04-27 10:48:14,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-27 10:48:14,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-27 10:48:14,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-27 10:48:14,244 INFO L272 TraceCheckUtils]: 17: Hoare triple {1566#true} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1566#true} is VALID [2022-04-27 10:48:14,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {1566#true} assume !!(~k~0 < ~j~0); {1566#true} is VALID [2022-04-27 10:48:14,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {1566#true} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1566#true} is VALID [2022-04-27 10:48:14,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {1566#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1566#true} is VALID [2022-04-27 10:48:14,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1566#true} is VALID [2022-04-27 10:48:14,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {1566#true} assume !(~j~0 < 3 * ~i~0); {1566#true} is VALID [2022-04-27 10:48:14,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {1566#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1566#true} is VALID [2022-04-27 10:48:14,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {1566#true} ~i~0 := 0; {1566#true} is VALID [2022-04-27 10:48:14,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1566#true} is VALID [2022-04-27 10:48:14,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1566#true} is VALID [2022-04-27 10:48:14,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1566#true} is VALID [2022-04-27 10:48:14,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {1566#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1566#true} is VALID [2022-04-27 10:48:14,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1566#true} is VALID [2022-04-27 10:48:14,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret7 := main(); {1566#true} is VALID [2022-04-27 10:48:14,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-27 10:48:14,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-27 10:48:14,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#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);~__BLAST_NONDET~0 := 0; {1566#true} is VALID [2022-04-27 10:48:14,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-27 10:48:14,246 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 10:48:14,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102721681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:48:14,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:48:14,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2022-04-27 10:48:14,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735489220] [2022-04-27 10:48:14,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:48:14,247 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-04-27 10:48:14,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:48:14,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:48:14,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:48:14,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 10:48:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:48:14,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 10:48:14,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:48:14,290 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:48:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:14,958 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-04-27 10:48:14,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:48:14,959 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-04-27 10:48:14,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:48:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:48:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-27 10:48:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:48:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-27 10:48:14,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 49 transitions. [2022-04-27 10:48:14,998 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 10:48:14,998 INFO L225 Difference]: With dead ends: 68 [2022-04-27 10:48:14,998 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:48:14,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2022-04-27 10:48:14,999 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:48:14,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 65 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:48:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:48:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:48:15,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:48:15,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:48:15,000 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:48:15,000 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:48:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:15,000 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:48:15,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:48:15,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:15,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:15,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:48:15,001 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:48:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:48:15,001 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:48:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:48:15,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:15,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:48:15,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:48:15,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:48:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:48:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:48:15,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-04-27 10:48:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:48:15,001 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:48:15,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 10:48:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:48:15,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:48:15,003 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:48:15,026 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 10:48:15,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:48:15,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:48:15,468 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:48:15,468 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:48:15,468 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:48:15,468 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:48:15,468 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:48:15,468 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:48:15,468 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:48:15,468 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 35 37) no Hoare annotation was computed. [2022-04-27 10:48:15,469 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 35 37) the Hoare annotation is: (let ((.cse2 (* main_~i~0 2))) (let ((.cse0 (< main_~i~0 main_~n~0)) (.cse3 (<= .cse2 main_~j~0)) (.cse1 (<= 1 main_~i~0))) (or (and (or (and .cse0 .cse1) (and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))) (<= main_~j~0 .cse2) (<= main_~i~0 1) .cse3) (let ((.cse4 (* main_~n~0 2))) (and .cse0 (<= main_~k~0 (+ main_~i~0 .cse4)) (<= main_~j~0 (+ main_~i~0 .cse4 1)) .cse3 .cse1))))) [2022-04-27 10:48:15,469 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-27 10:48:15,469 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 25 40) no Hoare annotation was computed. [2022-04-27 10:48:15,469 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 37) the Hoare annotation is: (and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)) (<= main_~k~0 (+ main_~i~0 (* main_~n~0 2))) (<= (* main_~i~0 2) main_~j~0)) [2022-04-27 10:48:15,469 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-27 10:48:15,469 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)) (<= (* main_~i~0 2) main_~j~0) (<= (+ main_~k~0 1) main_~j~0)) [2022-04-27 10:48:15,469 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 36 37) no Hoare annotation was computed. [2022-04-27 10:48:15,469 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-27 10:48:15,469 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-04-27 10:48:15,469 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 25 40) no Hoare annotation was computed. [2022-04-27 10:48:15,469 INFO L902 garLoopResultBuilder]: At program point L38(lines 25 40) the Hoare annotation is: true [2022-04-27 10:48:15,469 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 34 37) no Hoare annotation was computed. [2022-04-27 10:48:15,469 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: (let ((.cse0 (* main_~i~0 2)) (.cse3 (* main_~n~0 2))) (let ((.cse1 (<= .cse0 (+ 2 .cse3))) (.cse2 (<= 1 main_~i~0))) (or (and (<= main_~j~0 .cse0) (<= main_~i~0 1) .cse1 .cse2) (= main_~i~0 0) (and (<= 2 main_~n~0) (<= main_~k~0 (+ main_~i~0 .cse3)) (<= main_~j~0 (+ main_~i~0 .cse3 1)) .cse1 .cse2)))) [2022-04-27 10:48:15,469 INFO L899 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2022-04-27 10:48:15,469 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 25 40) the Hoare annotation is: true [2022-04-27 10:48:15,469 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:48:15,470 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:48:15,470 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:48:15,470 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:48:15,470 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:48:15,470 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:48:15,470 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:48:15,470 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:48:15,470 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:48:15,470 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:48:15,470 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:48:15,470 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:48:15,470 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:48:15,472 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-27 10:48:15,473 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:48:15,475 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:48:15,475 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:48:15,475 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 10:48:15,477 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 10:48:15,478 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:48:15,478 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:48:15,478 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:48:15,478 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 10:48:15,478 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 10:48:15,478 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:48:15,478 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-27 10:48:15,478 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-27 10:48:15,489 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-27 10:48:15,489 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 10:48:15,489 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 10:48:15,489 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 10:48:15,491 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 10:48:15,491 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:48:15,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:48:15 BoogieIcfgContainer [2022-04-27 10:48:15,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:48:15,498 INFO L158 Benchmark]: Toolchain (without parser) took 7473.30ms. Allocated memory was 255.9MB in the beginning and 364.9MB in the end (delta: 109.1MB). Free memory was 196.3MB in the beginning and 232.2MB in the end (delta: -35.9MB). Peak memory consumption was 74.7MB. Max. memory is 8.0GB. [2022-04-27 10:48:15,499 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 255.9MB. Free memory was 213.1MB in the beginning and 213.1MB in the end (delta: 88.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:48:15,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.79ms. Allocated memory was 255.9MB in the beginning and 364.9MB in the end (delta: 109.1MB). Free memory was 196.1MB in the beginning and 330.6MB in the end (delta: -134.5MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-27 10:48:15,499 INFO L158 Benchmark]: Boogie Preprocessor took 34.01ms. Allocated memory is still 364.9MB. Free memory was 330.6MB in the beginning and 329.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:48:15,499 INFO L158 Benchmark]: RCFGBuilder took 316.79ms. Allocated memory is still 364.9MB. Free memory was 329.0MB in the beginning and 315.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 10:48:15,499 INFO L158 Benchmark]: TraceAbstraction took 6892.26ms. Allocated memory is still 364.9MB. Free memory was 314.9MB in the beginning and 232.2MB in the end (delta: 82.6MB). Peak memory consumption was 84.2MB. Max. memory is 8.0GB. [2022-04-27 10:48:15,500 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 255.9MB. Free memory was 213.1MB in the beginning and 213.1MB in the end (delta: 88.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.79ms. Allocated memory was 255.9MB in the beginning and 364.9MB in the end (delta: 109.1MB). Free memory was 196.1MB in the beginning and 330.6MB in the end (delta: -134.5MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.01ms. Allocated memory is still 364.9MB. Free memory was 330.6MB in the beginning and 329.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 316.79ms. Allocated memory is still 364.9MB. Free memory was 329.0MB in the beginning and 315.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6892.26ms. Allocated memory is still 364.9MB. Free memory was 314.9MB in the beginning and 232.2MB in the end (delta: 82.6MB). Peak memory consumption was 84.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 335 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 210 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 690 IncrementalHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 125 mSDtfsCounter, 690 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=4, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 29 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 23 PreInvPairs, 40 NumberOfFragments, 170 HoareAnnotationTreeSize, 23 FomulaSimplifications, 39 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 810 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 282 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 903 SizeOfPredicates, 12 NumberOfNonLiveVariables, 348 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 101/130 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((i < n && 1 <= i) || (i + 1 <= n && i == 0)) && j <= i * 2) && i <= 1) && i * 2 <= j) || ((((i < n && k <= i + n * 2) && j <= i + n * 2 + 1) && i * 2 <= j) && 1 <= i) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((j <= i * 2 && i <= 1) && i * 2 <= 2 + n * 2) && 1 <= i) || i == 0) || ((((2 <= n && k <= i + n * 2) && j <= i + n * 2 + 1) && i * 2 <= 2 + n * 2) && 1 <= i) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((i < n && j < i * 3) && k <= i + n * 2) && i * 2 <= j RESULT: Ultimate proved your program to be correct! [2022-04-27 10:48:15,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...