/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-zilu/benchmark34_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:44:39,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:44:39,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:44:39,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:44:39,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:44:39,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:44:40,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:44:40,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:44:40,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:44:40,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:44:40,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:44:40,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:44:40,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:44:40,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:44:40,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:44:40,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:44:40,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:44:40,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:44:40,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:44:40,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:44:40,013 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:44:40,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:44:40,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:44:40,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:44:40,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:44:40,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:44:40,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:44:40,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:44:40,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:44:40,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:44:40,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:44:40,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:44:40,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:44:40,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:44:40,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:44:40,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:44:40,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:44:40,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:44:40,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:44:40,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:44:40,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:44:40,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:44:40,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:44:40,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:44:40,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:44:40,059 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:44:40,059 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:44:40,060 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:44:40,060 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:44:40,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:44:40,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:44:40,061 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:44:40,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:44:40,061 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:44:40,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:44:40,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:44:40,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:44:40,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:44:40,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:44:40,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:44:40,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:44:40,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:44:40,063 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:44:40,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:44:40,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:44:40,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:44:40,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:44:40,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:44:40,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:44:40,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:44:40,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:44:40,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:44:40,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:44:40,064 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:44:40,064 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:44:40,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:44:40,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:44:40,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:44:40,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:44:40,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:44:40,252 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:44:40,253 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:44:40,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark34_conjunctive.i [2022-04-27 11:44:40,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/696baf92f/1fc3f052ccf24fdb81387c5cd107c7aa/FLAG78787eb2f [2022-04-27 11:44:40,620 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:44:40,620 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark34_conjunctive.i [2022-04-27 11:44:40,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/696baf92f/1fc3f052ccf24fdb81387c5cd107c7aa/FLAG78787eb2f [2022-04-27 11:44:41,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/696baf92f/1fc3f052ccf24fdb81387c5cd107c7aa [2022-04-27 11:44:41,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:44:41,081 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:44:41,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:44:41,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:44:41,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:44:41,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:44:41" (1/1) ... [2022-04-27 11:44:41,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce50209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:41, skipping insertion in model container [2022-04-27 11:44:41,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:44:41" (1/1) ... [2022-04-27 11:44:41,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:44:41,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:44:41,214 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-zilu/benchmark34_conjunctive.i[873,886] [2022-04-27 11:44:41,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:44:41,225 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:44:41,233 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-zilu/benchmark34_conjunctive.i[873,886] [2022-04-27 11:44:41,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:44:41,245 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:44:41,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:41 WrapperNode [2022-04-27 11:44:41,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:44:41,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:44:41,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:44:41,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:44:41,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:41" (1/1) ... [2022-04-27 11:44:41,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:41" (1/1) ... [2022-04-27 11:44:41,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:41" (1/1) ... [2022-04-27 11:44:41,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:41" (1/1) ... [2022-04-27 11:44:41,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:41" (1/1) ... [2022-04-27 11:44:41,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:41" (1/1) ... [2022-04-27 11:44:41,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:41" (1/1) ... [2022-04-27 11:44:41,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:44:41,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:44:41,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:44:41,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:44:41,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:41" (1/1) ... [2022-04-27 11:44:41,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:44:41,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:44:41,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:44:41,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:44:41,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:44:41,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:44:41,342 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:44:41,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:44:41,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:44:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:44:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 11:44:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 11:44:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:44:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:44:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:44:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 11:44:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:44:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:44:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:44:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:44:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:44:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:44:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:44:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:44:41,387 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:44:41,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:44:41,472 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:44:41,476 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:44:41,476 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:44:41,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:44:41 BoogieIcfgContainer [2022-04-27 11:44:41,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:44:41,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:44:41,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:44:41,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:44:41,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:44:41" (1/3) ... [2022-04-27 11:44:41,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68348513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:44:41, skipping insertion in model container [2022-04-27 11:44:41,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:41" (2/3) ... [2022-04-27 11:44:41,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68348513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:44:41, skipping insertion in model container [2022-04-27 11:44:41,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:44:41" (3/3) ... [2022-04-27 11:44:41,483 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark34_conjunctive.i [2022-04-27 11:44:41,491 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:44:41,491 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:44:41,518 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:44:41,522 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@26d33f22, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@618a3c2 [2022-04-27 11:44:41,522 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:44:41,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 11:44:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:44:41,531 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:41,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:41,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:41,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-27 11:44:41,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:41,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305795250] [2022-04-27 11:44:41,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:41,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:41,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:41,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-27 11:44:41,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:44:41,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-27 11:44:41,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:41,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-27 11:44:41,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:44:41,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-27 11:44:41,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2022-04-27 11:44:41,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {23#true} is VALID [2022-04-27 11:44:41,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!((0 == ~j~0 && ~k~0 == ~n~0) && ~n~0 > 0); {28#(and (not (<= main_~n~0 0)) (= main_~j~0 0))} is VALID [2022-04-27 11:44:41,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(and (not (<= main_~n~0 0)) (= main_~j~0 0))} assume !(~j~0 < ~n~0 && ~n~0 > 0); {24#false} is VALID [2022-04-27 11:44:41,745 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {24#false} is VALID [2022-04-27 11:44:41,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 11:44:41,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 11:44:41,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 11:44:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:41,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:41,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305795250] [2022-04-27 11:44:41,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305795250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:44:41,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:44:41,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:44:41,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070091706] [2022-04-27 11:44:41,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:44:41,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-27 11:44:41,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:41,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:44:41,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:41,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:44:41,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:41,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:44:41,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:44:41,803 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:44:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:41,917 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 11:44:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:44:41,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-27 11:44:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:44:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-27 11:44:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:44:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-27 11:44:41,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-27 11:44:41,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:41,968 INFO L225 Difference]: With dead ends: 33 [2022-04-27 11:44:41,968 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 11:44:41,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:44:41,974 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:41,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 11:44:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 11:44:41,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:41,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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 11:44:41,999 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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 11:44:41,999 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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 11:44:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:42,003 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:44:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:44:42,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:42,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:42,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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) Second operand 14 states. [2022-04-27 11:44:42,004 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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) Second operand 14 states. [2022-04-27 11:44:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:42,007 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:44:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:44:42,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:42,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:42,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:42,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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 11:44:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 11:44:42,009 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 11:44:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:42,010 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 11:44:42,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:44:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:44:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 11:44:42,015 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:42,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:42,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:44:42,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:42,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:42,023 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-27 11:44:42,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:42,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767300413] [2022-04-27 11:44:42,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:42,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:42,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:42,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {127#true} is VALID [2022-04-27 11:44:42,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 11:44:42,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-27 11:44:42,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:42,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {127#true} is VALID [2022-04-27 11:44:42,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 11:44:42,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-27 11:44:42,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret6 := main(); {127#true} is VALID [2022-04-27 11:44:42,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {127#true} is VALID [2022-04-27 11:44:42,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !!((0 == ~j~0 && ~k~0 == ~n~0) && ~n~0 > 0); {132#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 11:44:42,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {132#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} assume !!(~j~0 < ~n~0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {133#(and (< 0 (+ main_~k~0 1)) (or (<= main_~k~0 0) (<= (+ main_~k~0 main_~j~0) main_~n~0)) (not (<= main_~n~0 0)))} is VALID [2022-04-27 11:44:42,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(and (< 0 (+ main_~k~0 1)) (or (<= main_~k~0 0) (<= (+ main_~k~0 main_~j~0) main_~n~0)) (not (<= main_~n~0 0)))} assume !(~j~0 < ~n~0 && ~n~0 > 0); {134#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-27 11:44:42,179 INFO L272 TraceCheckUtils]: 9: Hoare triple {134#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {135#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:44:42,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {135#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {136#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:44:42,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {136#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {128#false} is VALID [2022-04-27 11:44:42,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-27 11:44:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:42,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:42,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767300413] [2022-04-27 11:44:42,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767300413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:44:42,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838709054] [2022-04-27 11:44:42,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:42,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:44:42,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:44:42,182 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:44:42,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:44:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:42,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:44:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:42,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:44:42,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {127#true} is VALID [2022-04-27 11:44:42,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#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(26, 2); {127#true} is VALID [2022-04-27 11:44:42,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 11:44:42,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-27 11:44:42,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret6 := main(); {127#true} is VALID [2022-04-27 11:44:42,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {127#true} is VALID [2022-04-27 11:44:42,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !!((0 == ~j~0 && ~k~0 == ~n~0) && ~n~0 > 0); {159#(and (< 0 main_~n~0) (<= main_~j~0 0) (= main_~n~0 main_~k~0))} is VALID [2022-04-27 11:44:42,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {159#(and (< 0 main_~n~0) (<= main_~j~0 0) (= main_~n~0 main_~k~0))} assume !!(~j~0 < ~n~0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {163#(and (< 0 main_~n~0) (= (+ main_~k~0 1) main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 11:44:42,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#(and (< 0 main_~n~0) (= (+ main_~k~0 1) main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0 && ~n~0 > 0); {134#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-27 11:44:42,491 INFO L272 TraceCheckUtils]: 9: Hoare triple {134#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {170#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:44:42,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {174#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:44:42,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {128#false} is VALID [2022-04-27 11:44:42,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-27 11:44:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:42,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:44:42,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-27 11:44:42,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {128#false} is VALID [2022-04-27 11:44:42,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {174#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:44:42,748 INFO L272 TraceCheckUtils]: 9: Hoare triple {134#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {170#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:44:42,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(or (and (< 0 main_~n~0) (< main_~j~0 main_~n~0)) (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)))} assume !(~j~0 < ~n~0 && ~n~0 > 0); {134#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-27 11:44:42,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(or (and (<= main_~k~0 1) (< 0 main_~k~0)) (and (< 0 main_~n~0) (< (+ main_~j~0 1) main_~n~0)))} assume !!(~j~0 < ~n~0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {193#(or (and (< 0 main_~n~0) (< main_~j~0 main_~n~0)) (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)))} is VALID [2022-04-27 11:44:42,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !!((0 == ~j~0 && ~k~0 == ~n~0) && ~n~0 > 0); {197#(or (and (<= main_~k~0 1) (< 0 main_~k~0)) (and (< 0 main_~n~0) (< (+ main_~j~0 1) main_~n~0)))} is VALID [2022-04-27 11:44:42,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {127#true} is VALID [2022-04-27 11:44:42,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret6 := main(); {127#true} is VALID [2022-04-27 11:44:42,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-27 11:44:42,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 11:44:42,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#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(26, 2); {127#true} is VALID [2022-04-27 11:44:42,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {127#true} is VALID [2022-04-27 11:44:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:42,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838709054] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:44:42,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:44:42,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 11:44:42,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181697334] [2022-04-27 11:44:42,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:44:42,758 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 11:44:42,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:42,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:42,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:42,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:44:42,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:42,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:44:42,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:44:42,776 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:42,962 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 11:44:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:44:42,963 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 11:44:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-04-27 11:44:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-04-27 11:44:42,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2022-04-27 11:44:42,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:42,981 INFO L225 Difference]: With dead ends: 20 [2022-04-27 11:44:42,981 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 11:44:42,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:44:42,982 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:42,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 11:44:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 11:44:42,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:42,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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 11:44:42,987 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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 11:44:42,987 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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 11:44:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:42,988 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 11:44:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:44:42,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:42,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:42,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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) Second operand 15 states. [2022-04-27 11:44:42,988 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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) Second operand 15 states. [2022-04-27 11:44:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:42,989 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 11:44:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:44:42,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:42,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:42,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:42,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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 11:44:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 11:44:42,990 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-27 11:44:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:42,991 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 11:44:42,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:44:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:44:42,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:42,991 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:43,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:44:43,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:44:43,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:43,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash 106583640, now seen corresponding path program 2 times [2022-04-27 11:44:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:43,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037034120] [2022-04-27 11:44:43,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:43,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {316#true} is VALID [2022-04-27 11:44:43,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-27 11:44:43,337 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {316#true} {316#true} #45#return; {316#true} is VALID [2022-04-27 11:44:43,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:43,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {316#true} is VALID [2022-04-27 11:44:43,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-27 11:44:43,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #45#return; {316#true} is VALID [2022-04-27 11:44:43,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret6 := main(); {316#true} is VALID [2022-04-27 11:44:43,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {316#true} is VALID [2022-04-27 11:44:43,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {316#true} assume !!((0 == ~j~0 && ~k~0 == ~n~0) && ~n~0 > 0); {321#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 11:44:43,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {321#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} assume !!(~j~0 < ~n~0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {322#(and (<= main_~n~0 (+ main_~k~0 main_~j~0)) (not (<= main_~n~0 0)) (<= (+ main_~k~0 main_~j~0) main_~n~0))} is VALID [2022-04-27 11:44:43,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {322#(and (<= main_~n~0 (+ main_~k~0 main_~j~0)) (not (<= main_~n~0 0)) (<= (+ main_~k~0 main_~j~0) main_~n~0))} assume !!(~j~0 < ~n~0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {323#(and (< 0 (+ main_~k~0 1)) (or (<= main_~k~0 0) (<= (+ main_~k~0 main_~j~0) main_~n~0)) (not (<= main_~n~0 0)))} is VALID [2022-04-27 11:44:43,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {323#(and (< 0 (+ main_~k~0 1)) (or (<= main_~k~0 0) (<= (+ main_~k~0 main_~j~0) main_~n~0)) (not (<= main_~n~0 0)))} assume !(~j~0 < ~n~0 && ~n~0 > 0); {324#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-27 11:44:43,341 INFO L272 TraceCheckUtils]: 10: Hoare triple {324#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {325#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:44:43,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {326#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:44:43,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {326#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {317#false} is VALID [2022-04-27 11:44:43,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-27 11:44:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:43,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037034120] [2022-04-27 11:44:43,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037034120] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:44:43,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500351917] [2022-04-27 11:44:43,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:44:43,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:44:43,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:44:43,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:44:43,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 11:44:43,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:44:43,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:44:43,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 11:44:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:43,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:44:43,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2022-04-27 11:44:43,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#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(26, 2); {316#true} is VALID [2022-04-27 11:44:43,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-27 11:44:43,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #45#return; {316#true} is VALID [2022-04-27 11:44:43,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret6 := main(); {316#true} is VALID [2022-04-27 11:44:43,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {316#true} is VALID [2022-04-27 11:44:43,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {316#true} assume !!((0 == ~j~0 && ~k~0 == ~n~0) && ~n~0 > 0); {321#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 11:44:43,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {321#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} assume !!(~j~0 < ~n~0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {352#(and (not (<= main_~n~0 0)) (= (+ (- 1) main_~j~0) 0) (<= main_~n~0 (+ main_~k~0 1)) (<= (+ main_~k~0 1) main_~n~0))} is VALID [2022-04-27 11:44:43,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {352#(and (not (<= main_~n~0 0)) (= (+ (- 1) main_~j~0) 0) (<= main_~n~0 (+ main_~k~0 1)) (<= (+ main_~k~0 1) main_~n~0))} assume !!(~j~0 < ~n~0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {356#(and (<= main_~n~0 (+ main_~k~0 2)) (<= main_~j~0 2) (< 1 main_~n~0) (<= (+ main_~k~0 2) main_~n~0))} is VALID [2022-04-27 11:44:43,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#(and (<= main_~n~0 (+ main_~k~0 2)) (<= main_~j~0 2) (< 1 main_~n~0) (<= (+ main_~k~0 2) main_~n~0))} assume !(~j~0 < ~n~0 && ~n~0 > 0); {324#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-27 11:44:43,603 INFO L272 TraceCheckUtils]: 10: Hoare triple {324#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {363#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:44:43,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {363#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {367#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:44:43,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {367#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {317#false} is VALID [2022-04-27 11:44:43,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-27 11:44:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:43,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:44:43,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-27 11:44:43,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {367#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {317#false} is VALID [2022-04-27 11:44:43,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {363#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {367#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:44:43,855 INFO L272 TraceCheckUtils]: 10: Hoare triple {324#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~k~0 then 1 else 0)); {363#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:44:43,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {386#(or (and (< 0 main_~n~0) (< main_~j~0 main_~n~0)) (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)))} assume !(~j~0 < ~n~0 && ~n~0 > 0); {324#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-27 11:44:43,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#(or (not (< main_~j~0 main_~n~0)) (and (<= main_~k~0 1) (< 0 main_~k~0)) (and (< 0 main_~n~0) (< (+ main_~j~0 1) main_~n~0)))} assume !!(~j~0 < ~n~0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {386#(or (and (< 0 main_~n~0) (< main_~j~0 main_~n~0)) (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)))} is VALID [2022-04-27 11:44:43,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {394#(or (and (< 0 main_~n~0) (< (+ main_~j~0 2) main_~n~0)) (not (< (+ main_~j~0 1) main_~n~0)) (and (< 1 main_~k~0) (<= main_~k~0 2)))} assume !!(~j~0 < ~n~0 && ~n~0 > 0);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {390#(or (not (< main_~j~0 main_~n~0)) (and (<= main_~k~0 1) (< 0 main_~k~0)) (and (< 0 main_~n~0) (< (+ main_~j~0 1) main_~n~0)))} is VALID [2022-04-27 11:44:43,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {316#true} assume !!((0 == ~j~0 && ~k~0 == ~n~0) && ~n~0 > 0); {394#(or (and (< 0 main_~n~0) (< (+ main_~j~0 2) main_~n~0)) (not (< (+ main_~j~0 1) main_~n~0)) (and (< 1 main_~k~0) (<= main_~k~0 2)))} is VALID [2022-04-27 11:44:43,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {316#true} is VALID [2022-04-27 11:44:43,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret6 := main(); {316#true} is VALID [2022-04-27 11:44:43,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #45#return; {316#true} is VALID [2022-04-27 11:44:43,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-27 11:44:43,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#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(26, 2); {316#true} is VALID [2022-04-27 11:44:43,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2022-04-27 11:44:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:43,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500351917] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:44:43,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:44:43,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-27 11:44:43,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465850821] [2022-04-27 11:44:43,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:44:43,860 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:44:43,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:43,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:43,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:43,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:44:43,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:43,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:44:43,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:44:43,876 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:44,174 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 11:44:44,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:44:44,174 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:44:44,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2022-04-27 11:44:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2022-04-27 11:44:44,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 18 transitions. [2022-04-27 11:44:44,192 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 11:44:44,192 INFO L225 Difference]: With dead ends: 17 [2022-04-27 11:44:44,192 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:44:44,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2022-04-27 11:44:44,193 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:44,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:44:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:44:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:44:44,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:44,194 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 11:44:44,194 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 11:44:44,194 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 11:44:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:44,194 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:44:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:44,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:44,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:44,195 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 11:44:44,195 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 11:44:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:44,195 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:44:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:44,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:44,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:44,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:44,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:44,195 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 11:44:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:44:44,195 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 11:44:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:44,196 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:44:44,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:44,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:44,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:44:44,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:44:44,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 11:44:44,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:44:44,486 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-27 11:44:44,486 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-27 11:44:44,486 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-27 11:44:44,486 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 29) the Hoare annotation is: true [2022-04-27 11:44:44,487 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-27 11:44:44,487 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 29) no Hoare annotation was computed. [2022-04-27 11:44:44,487 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-04-27 11:44:44,487 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 24 26) the Hoare annotation is: (let ((.cse0 (+ main_~k~0 main_~j~0))) (and (<= main_~n~0 .cse0) (< 0 (+ main_~k~0 1)) (not (<= main_~n~0 0)) (<= .cse0 main_~n~0))) [2022-04-27 11:44:44,487 INFO L895 garLoopResultBuilder]: At program point L24-3(lines 24 26) the Hoare annotation is: (let ((.cse1 (+ main_~k~0 1))) (let ((.cse0 (< 0 .cse1)) (.cse2 (<= main_~k~0 0))) (or (and .cse0 (= .cse1 main_~n~0) .cse2 (<= main_~j~0 1)) (let ((.cse3 (+ main_~k~0 main_~j~0))) (and (<= main_~n~0 .cse3) .cse0 (not (<= main_~n~0 0)) .cse2 (<= .cse3 main_~n~0)))))) [2022-04-27 11:44:44,487 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 29) no Hoare annotation was computed. [2022-04-27 11:44:44,487 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:44:44,487 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:44:44,487 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:44:44,487 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:44:44,487 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:44:44,488 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:44:44,488 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:44:44,488 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 11:44:44,488 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 11:44:44,488 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-27 11:44:44,488 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:44:44,488 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:44:44,488 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 11:44:44,490 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-27 11:44:44,492 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:44:44,494 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:44:44,494 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:44:44,494 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:44:44,494 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:44:44,494 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:44,494 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-27 11:44:44,494 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:44:44,495 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:44:44,495 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:44:44,495 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:44:44,495 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:44,495 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:44,495 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:44:44,495 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:44:44,495 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:44:44,503 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:44:44,503 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:44:44,503 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 11:44:44,503 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:44:44,503 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 11:44:44,503 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:44:44,503 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 11:44:44,503 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:44:44,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:44:44 BoogieIcfgContainer [2022-04-27 11:44:44,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:44:44,509 INFO L158 Benchmark]: Toolchain (without parser) took 3427.96ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 120.6MB in the beginning and 135.8MB in the end (delta: -15.2MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. [2022-04-27 11:44:44,509 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 174.1MB. Free memory was 137.5MB in the beginning and 137.4MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:44:44,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.14ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 120.4MB in the beginning and 185.9MB in the end (delta: -65.5MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-04-27 11:44:44,510 INFO L158 Benchmark]: Boogie Preprocessor took 33.89ms. Allocated memory is still 209.7MB. Free memory was 185.9MB in the beginning and 184.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:44:44,510 INFO L158 Benchmark]: RCFGBuilder took 197.67ms. Allocated memory is still 209.7MB. Free memory was 184.2MB in the beginning and 172.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 11:44:44,510 INFO L158 Benchmark]: TraceAbstraction took 3029.81ms. Allocated memory is still 209.7MB. Free memory was 172.0MB in the beginning and 136.3MB in the end (delta: 35.7MB). Peak memory consumption was 37.3MB. Max. memory is 8.0GB. [2022-04-27 11:44:44,511 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 174.1MB. Free memory was 137.5MB in the beginning and 137.4MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 162.14ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 120.4MB in the beginning and 185.9MB in the end (delta: -65.5MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.89ms. Allocated memory is still 209.7MB. Free memory was 185.9MB in the beginning and 184.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 197.67ms. Allocated memory is still 209.7MB. Free memory was 184.2MB in the beginning and 172.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3029.81ms. Allocated memory is still 209.7MB. Free memory was 172.0MB in the beginning and 136.3MB in the end (delta: 35.7MB). Peak memory consumption was 37.3MB. 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: 16]: 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 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 37 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 16 NumberOfFragments, 72 HoareAnnotationTreeSize, 10 FomulaSimplifications, 19 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 59 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 421 SizeOfPredicates, 12 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/12 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: 24]: Loop Invariant Derived loop invariant: ((n <= k + j && 0 < k + 1) && !(n <= 0)) && k + j <= n RESULT: Ultimate proved your program to be correct! [2022-04-27 11:44:44,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...