/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:45:04,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:45:04,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:45:04,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:45:04,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:45:04,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:45:04,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:45:04,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:45:04,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:45:04,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:45:04,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:45:04,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:45:04,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:45:04,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:45:04,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:45:04,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:45:04,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:45:04,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:45:04,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:45:04,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:45:04,235 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:45:04,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:45:04,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:45:04,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:45:04,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:45:04,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:45:04,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:45:04,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:45:04,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:45:04,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:45:04,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:45:04,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:45:04,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:45:04,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:45:04,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:45:04,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:45:04,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:45:04,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:45:04,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:45:04,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:45:04,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:45:04,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:45:04,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:45:04,268 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:45:04,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:45:04,268 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:45:04,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:45:04,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:45:04,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:45:04,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:45:04,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:45:04,269 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:45:04,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:45:04,270 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:45:04,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:45:04,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:45:04,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:45:04,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:45:04,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:45:04,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:45:04,271 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:45:04,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:45:04,271 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:45:04,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:45:04,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:45:04,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:45:04,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:45:04,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:45:04,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:45:04,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:45:04,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:45:04,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:45:04,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:45:04,272 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:45:04,272 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:45:04,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:45:04,272 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:45:04,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:45:04,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:45:04,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:45:04,469 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:45:04,469 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:45:04,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2022-04-27 10:45:04,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e659ef3e/20e0d0d30553460294d71756589bc4bd/FLAG2dcc14e55 [2022-04-27 10:45:04,884 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:45:04,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2022-04-27 10:45:04,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e659ef3e/20e0d0d30553460294d71756589bc4bd/FLAG2dcc14e55 [2022-04-27 10:45:04,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e659ef3e/20e0d0d30553460294d71756589bc4bd [2022-04-27 10:45:04,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:45:04,912 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:45:04,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:45:04,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:45:04,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:45:04,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:45:04" (1/1) ... [2022-04-27 10:45:04,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7116e10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:04, skipping insertion in model container [2022-04-27 10:45:04,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:45:04" (1/1) ... [2022-04-27 10:45:04,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:45:04,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:45:05,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2022-04-27 10:45:05,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:45:05,113 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:45:05,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2022-04-27 10:45:05,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:45:05,154 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:45:05,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:05 WrapperNode [2022-04-27 10:45:05,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:45:05,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:45:05,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:45:05,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:45:05,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:05" (1/1) ... [2022-04-27 10:45:05,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:05" (1/1) ... [2022-04-27 10:45:05,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:05" (1/1) ... [2022-04-27 10:45:05,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:05" (1/1) ... [2022-04-27 10:45:05,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:05" (1/1) ... [2022-04-27 10:45:05,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:05" (1/1) ... [2022-04-27 10:45:05,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:05" (1/1) ... [2022-04-27 10:45:05,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:45:05,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:45:05,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:45:05,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:45:05,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:05" (1/1) ... [2022-04-27 10:45:05,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:45:05,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:45:05,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:45:05,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:45:05,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:45:05,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:45:05,256 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:45:05,257 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:45:05,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:45:05,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:45:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:45:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:45:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:45:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:45:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:45:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:45:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:45:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:45:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:45:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:45:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:45:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:45:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:45:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:45:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:45:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:45:05,356 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:45:05,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:45:05,526 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:45:05,536 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:45:05,536 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:45:05,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:45:05 BoogieIcfgContainer [2022-04-27 10:45:05,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:45:05,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:45:05,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:45:05,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:45:05,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:45:04" (1/3) ... [2022-04-27 10:45:05,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5d0d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:45:05, skipping insertion in model container [2022-04-27 10:45:05,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:05" (2/3) ... [2022-04-27 10:45:05,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5d0d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:45:05, skipping insertion in model container [2022-04-27 10:45:05,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:45:05" (3/3) ... [2022-04-27 10:45:05,542 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2022-04-27 10:45:05,552 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:45:05,553 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:45:05,581 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:45:05,585 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@69f9e3cb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@42ce7cb1 [2022-04-27 10:45:05,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:45:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:45:05,596 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:05,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:05,596 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:05,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:05,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1772946259, now seen corresponding path program 1 times [2022-04-27 10:45:05,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:05,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944111450] [2022-04-27 10:45:05,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:05,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:05,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:05,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {46#true} is VALID [2022-04-27 10:45:05,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} assume true; {46#true} is VALID [2022-04-27 10:45:05,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} #126#return; {46#true} is VALID [2022-04-27 10:45:05,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:05,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {46#true} is VALID [2022-04-27 10:45:05,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#true} assume true; {46#true} is VALID [2022-04-27 10:45:05,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} #126#return; {46#true} is VALID [2022-04-27 10:45:05,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {46#true} call #t~ret11 := main(); {46#true} is VALID [2022-04-27 10:45:05,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {46#true} is VALID [2022-04-27 10:45:05,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {46#true} is VALID [2022-04-27 10:45:05,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {46#true} is VALID [2022-04-27 10:45:05,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#true} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {46#true} is VALID [2022-04-27 10:45:05,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#true} assume 1 + ~i~0 < ~len~0; {51#(not (<= main_~len~0 (+ main_~i~0 1)))} is VALID [2022-04-27 10:45:05,761 INFO L272 TraceCheckUtils]: 10: Hoare triple {51#(not (<= main_~len~0 (+ main_~i~0 1)))} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {52#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:45:05,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {52#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {53#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:45:05,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {47#false} is VALID [2022-04-27 10:45:05,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#false} assume !false; {47#false} is VALID [2022-04-27 10:45:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:05,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:05,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944111450] [2022-04-27 10:45:05,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944111450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:05,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:05,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696867750] [2022-04-27 10:45:05,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:05,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-27 10:45:05,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:05,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:05,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:05,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:05,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:05,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:05,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:05,798 INFO L87 Difference]: Start difference. First operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:06,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:06,572 INFO L93 Difference]: Finished difference Result 88 states and 155 transitions. [2022-04-27 10:45:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-27 10:45:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2022-04-27 10:45:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2022-04-27 10:45:06,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 155 transitions. [2022-04-27 10:45:06,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:06,736 INFO L225 Difference]: With dead ends: 88 [2022-04-27 10:45:06,736 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 10:45:06,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:45:06,742 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:06,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 68 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:45:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 10:45:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-04-27 10:45:06,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:06,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:06,780 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:06,781 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:06,787 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-04-27 10:45:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2022-04-27 10:45:06,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:06,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:06,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 47 states. [2022-04-27 10:45:06,789 INFO L87 Difference]: Start difference. First operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 47 states. [2022-04-27 10:45:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:06,794 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-04-27 10:45:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2022-04-27 10:45:06,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:06,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:06,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:06,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-27 10:45:06,808 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 14 [2022-04-27 10:45:06,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:06,809 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-27 10:45:06,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-27 10:45:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:45:06,810 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:06,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:06,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:45:06,810 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:06,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:06,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1794902226, now seen corresponding path program 1 times [2022-04-27 10:45:06,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:06,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330071783] [2022-04-27 10:45:06,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:06,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:06,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:06,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {362#true} is VALID [2022-04-27 10:45:06,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume true; {362#true} is VALID [2022-04-27 10:45:06,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {362#true} {362#true} #126#return; {362#true} is VALID [2022-04-27 10:45:06,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:06,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {362#true} is VALID [2022-04-27 10:45:06,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2022-04-27 10:45:06,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #126#return; {362#true} is VALID [2022-04-27 10:45:06,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret11 := main(); {362#true} is VALID [2022-04-27 10:45:06,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {362#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {362#true} is VALID [2022-04-27 10:45:06,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {362#true} is VALID [2022-04-27 10:45:06,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {367#(not (<= main_~len~0 main_~i~0))} is VALID [2022-04-27 10:45:06,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {367#(not (<= main_~len~0 main_~i~0))} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {367#(not (<= main_~len~0 main_~i~0))} is VALID [2022-04-27 10:45:06,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#(not (<= main_~len~0 main_~i~0))} assume !(1 + ~i~0 < ~len~0); {367#(not (<= main_~len~0 main_~i~0))} is VALID [2022-04-27 10:45:06,928 INFO L272 TraceCheckUtils]: 10: Hoare triple {367#(not (<= main_~len~0 main_~i~0))} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:45:06,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {369#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:45:06,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {369#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {363#false} is VALID [2022-04-27 10:45:06,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {363#false} assume !false; {363#false} is VALID [2022-04-27 10:45:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:06,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:06,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330071783] [2022-04-27 10:45:06,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330071783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:06,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:06,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633233315] [2022-04-27 10:45:06,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:06,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-27 10:45:06,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:06,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:06,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:06,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:06,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:06,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:06,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:06,943 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:07,427 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-04-27 10:45:07,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:07,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-27 10:45:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-27 10:45:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-27 10:45:07,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-27 10:45:07,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:07,485 INFO L225 Difference]: With dead ends: 55 [2022-04-27 10:45:07,485 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 10:45:07,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:45:07,487 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:07,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 10:45:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-04-27 10:45:07,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:07,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:07,519 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:07,520 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:07,522 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 10:45:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-27 10:45:07,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:07,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:07,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 53 states. [2022-04-27 10:45:07,524 INFO L87 Difference]: Start difference. First operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 53 states. [2022-04-27 10:45:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:07,526 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 10:45:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-27 10:45:07,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:07,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:07,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:07,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2022-04-27 10:45:07,529 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 14 [2022-04-27 10:45:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:07,529 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2022-04-27 10:45:07,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-27 10:45:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:45:07,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:07,530 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:07,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:45:07,530 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1560251136, now seen corresponding path program 1 times [2022-04-27 10:45:07,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:07,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058996968] [2022-04-27 10:45:07,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:07,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:07,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:07,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {649#true} is VALID [2022-04-27 10:45:07,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-27 10:45:07,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {649#true} {649#true} #126#return; {649#true} is VALID [2022-04-27 10:45:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 10:45:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:07,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {649#true} ~cond := #in~cond; {649#true} is VALID [2022-04-27 10:45:07,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} assume !(0 == ~cond); {649#true} is VALID [2022-04-27 10:45:07,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-27 10:45:07,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {649#true} {654#(<= 0 main_~i~0)} #94#return; {654#(<= 0 main_~i~0)} is VALID [2022-04-27 10:45:07,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:07,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {649#true} is VALID [2022-04-27 10:45:07,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-27 10:45:07,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} #126#return; {649#true} is VALID [2022-04-27 10:45:07,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#true} call #t~ret11 := main(); {649#true} is VALID [2022-04-27 10:45:07,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {649#true} is VALID [2022-04-27 10:45:07,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {649#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {654#(<= 0 main_~i~0)} is VALID [2022-04-27 10:45:07,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {654#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {654#(<= 0 main_~i~0)} is VALID [2022-04-27 10:45:07,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {654#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {654#(<= 0 main_~i~0)} is VALID [2022-04-27 10:45:07,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {654#(<= 0 main_~i~0)} assume 1 + ~i~0 < ~len~0; {654#(<= 0 main_~i~0)} is VALID [2022-04-27 10:45:07,605 INFO L272 TraceCheckUtils]: 10: Hoare triple {654#(<= 0 main_~i~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {649#true} is VALID [2022-04-27 10:45:07,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#true} ~cond := #in~cond; {649#true} is VALID [2022-04-27 10:45:07,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {649#true} assume !(0 == ~cond); {649#true} is VALID [2022-04-27 10:45:07,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-27 10:45:07,606 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {649#true} {654#(<= 0 main_~i~0)} #94#return; {654#(<= 0 main_~i~0)} is VALID [2022-04-27 10:45:07,606 INFO L272 TraceCheckUtils]: 15: Hoare triple {654#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:45:07,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {659#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {660#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:45:07,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {660#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {650#false} is VALID [2022-04-27 10:45:07,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-27 10:45:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:07,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:07,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058996968] [2022-04-27 10:45:07,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058996968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:07,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:07,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:07,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231634615] [2022-04-27 10:45:07,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:07,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-27 10:45:07,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:07,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:45:07,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:07,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:07,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:07,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:07,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:07,620 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:45:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:08,075 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-27 10:45:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:08,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-27 10:45:08,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:45:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-27 10:45:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:45:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-27 10:45:08,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-27 10:45:08,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:08,127 INFO L225 Difference]: With dead ends: 57 [2022-04-27 10:45:08,127 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 10:45:08,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:45:08,134 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:08,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 50 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 10:45:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 10:45:08,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:08,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:08,170 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:08,172 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:08,177 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 10:45:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 10:45:08,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:08,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:08,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 55 states. [2022-04-27 10:45:08,179 INFO L87 Difference]: Start difference. First operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 55 states. [2022-04-27 10:45:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:08,183 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 10:45:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 10:45:08,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:08,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:08,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:08,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-04-27 10:45:08,188 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 19 [2022-04-27 10:45:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:08,188 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-04-27 10:45:08,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:45:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 10:45:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 10:45:08,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:08,189 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:08,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:45:08,189 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:08,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1084781042, now seen corresponding path program 1 times [2022-04-27 10:45:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:08,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189362263] [2022-04-27 10:45:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:08,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:08,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {950#true} is VALID [2022-04-27 10:45:08,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#true} assume true; {950#true} is VALID [2022-04-27 10:45:08,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {950#true} {950#true} #126#return; {950#true} is VALID [2022-04-27 10:45:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 10:45:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:08,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {950#true} ~cond := #in~cond; {950#true} is VALID [2022-04-27 10:45:08,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#true} assume !(0 == ~cond); {950#true} is VALID [2022-04-27 10:45:08,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {950#true} assume true; {950#true} is VALID [2022-04-27 10:45:08,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {950#true} {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} #118#return; {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:08,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 10:45:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:08,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {950#true} ~cond := #in~cond; {950#true} is VALID [2022-04-27 10:45:08,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#true} assume !(0 == ~cond); {950#true} is VALID [2022-04-27 10:45:08,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {950#true} assume true; {950#true} is VALID [2022-04-27 10:45:08,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {950#true} {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} #120#return; {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:08,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {950#true} call ULTIMATE.init(); {967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:08,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {950#true} is VALID [2022-04-27 10:45:08,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {950#true} assume true; {950#true} is VALID [2022-04-27 10:45:08,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {950#true} {950#true} #126#return; {950#true} is VALID [2022-04-27 10:45:08,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {950#true} call #t~ret11 := main(); {950#true} is VALID [2022-04-27 10:45:08,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {950#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {950#true} is VALID [2022-04-27 10:45:08,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {950#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {955#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:08,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {955#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {955#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:08,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {955#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:08,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume !(1 + ~i~0 < ~len~0); {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:08,273 INFO L272 TraceCheckUtils]: 10: Hoare triple {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {950#true} is VALID [2022-04-27 10:45:08,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#true} ~cond := #in~cond; {950#true} is VALID [2022-04-27 10:45:08,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#true} assume !(0 == ~cond); {950#true} is VALID [2022-04-27 10:45:08,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#true} assume true; {950#true} is VALID [2022-04-27 10:45:08,274 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {950#true} {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} #118#return; {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:08,274 INFO L272 TraceCheckUtils]: 15: Hoare triple {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {950#true} is VALID [2022-04-27 10:45:08,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {950#true} ~cond := #in~cond; {950#true} is VALID [2022-04-27 10:45:08,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {950#true} assume !(0 == ~cond); {950#true} is VALID [2022-04-27 10:45:08,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {950#true} assume true; {950#true} is VALID [2022-04-27 10:45:08,275 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {950#true} {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} #120#return; {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:08,283 INFO L272 TraceCheckUtils]: 20: Hoare triple {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {965#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:45:08,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {965#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {966#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:45:08,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {966#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {951#false} is VALID [2022-04-27 10:45:08,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {951#false} assume !false; {951#false} is VALID [2022-04-27 10:45:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:45:08,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:08,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189362263] [2022-04-27 10:45:08,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189362263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:08,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:08,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:08,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429822216] [2022-04-27 10:45:08,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:08,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 10:45:08,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:08,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:45:08,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:08,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:08,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:08,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:08,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:08,299 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:45:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:08,891 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-27 10:45:08,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:08,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 10:45:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:45:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-27 10:45:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:45:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-27 10:45:08,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2022-04-27 10:45:08,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:08,949 INFO L225 Difference]: With dead ends: 61 [2022-04-27 10:45:08,949 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 10:45:08,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:45:08,950 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:08,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 59 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:45:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 10:45:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-27 10:45:08,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:08,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:08,987 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:08,987 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:08,989 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 10:45:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 10:45:08,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:08,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:08,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 59 states. [2022-04-27 10:45:08,990 INFO L87 Difference]: Start difference. First operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 59 states. [2022-04-27 10:45:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:08,992 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 10:45:08,992 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 10:45:08,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:08,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:08,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:08,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-27 10:45:08,994 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 24 [2022-04-27 10:45:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:08,995 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2022-04-27 10:45:08,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:45:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 10:45:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:45:08,995 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:08,995 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:08,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:45:08,996 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:08,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1893905473, now seen corresponding path program 1 times [2022-04-27 10:45:08,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:08,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155178029] [2022-04-27 10:45:08,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {1296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1276#true} is VALID [2022-04-27 10:45:09,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {1276#true} assume true; {1276#true} is VALID [2022-04-27 10:45:09,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1276#true} {1276#true} #126#return; {1276#true} is VALID [2022-04-27 10:45:09,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 10:45:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {1276#true} ~cond := #in~cond; {1276#true} is VALID [2022-04-27 10:45:09,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {1276#true} assume !(0 == ~cond); {1276#true} is VALID [2022-04-27 10:45:09,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {1276#true} assume true; {1276#true} is VALID [2022-04-27 10:45:09,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1281#(<= 0 main_~j~0)} #118#return; {1281#(<= 0 main_~j~0)} is VALID [2022-04-27 10:45:09,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 10:45:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {1276#true} ~cond := #in~cond; {1276#true} is VALID [2022-04-27 10:45:09,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {1276#true} assume !(0 == ~cond); {1276#true} is VALID [2022-04-27 10:45:09,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {1276#true} assume true; {1276#true} is VALID [2022-04-27 10:45:09,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1281#(<= 0 main_~j~0)} #120#return; {1281#(<= 0 main_~j~0)} is VALID [2022-04-27 10:45:09,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-27 10:45:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {1276#true} ~cond := #in~cond; {1276#true} is VALID [2022-04-27 10:45:09,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {1276#true} assume !(0 == ~cond); {1276#true} is VALID [2022-04-27 10:45:09,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {1276#true} assume true; {1276#true} is VALID [2022-04-27 10:45:09,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1281#(<= 0 main_~j~0)} #122#return; {1281#(<= 0 main_~j~0)} is VALID [2022-04-27 10:45:09,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {1276#true} call ULTIMATE.init(); {1296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:09,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {1296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1276#true} is VALID [2022-04-27 10:45:09,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {1276#true} assume true; {1276#true} is VALID [2022-04-27 10:45:09,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1276#true} #126#return; {1276#true} is VALID [2022-04-27 10:45:09,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {1276#true} call #t~ret11 := main(); {1276#true} is VALID [2022-04-27 10:45:09,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {1276#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {1276#true} is VALID [2022-04-27 10:45:09,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {1276#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {1276#true} is VALID [2022-04-27 10:45:09,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {1276#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {1281#(<= 0 main_~j~0)} is VALID [2022-04-27 10:45:09,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {1281#(<= 0 main_~j~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1281#(<= 0 main_~j~0)} is VALID [2022-04-27 10:45:09,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {1281#(<= 0 main_~j~0)} assume !(1 + ~i~0 < ~len~0); {1281#(<= 0 main_~j~0)} is VALID [2022-04-27 10:45:09,060 INFO L272 TraceCheckUtils]: 10: Hoare triple {1281#(<= 0 main_~j~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1276#true} is VALID [2022-04-27 10:45:09,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {1276#true} ~cond := #in~cond; {1276#true} is VALID [2022-04-27 10:45:09,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {1276#true} assume !(0 == ~cond); {1276#true} is VALID [2022-04-27 10:45:09,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {1276#true} assume true; {1276#true} is VALID [2022-04-27 10:45:09,063 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1276#true} {1281#(<= 0 main_~j~0)} #118#return; {1281#(<= 0 main_~j~0)} is VALID [2022-04-27 10:45:09,063 INFO L272 TraceCheckUtils]: 15: Hoare triple {1281#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1276#true} is VALID [2022-04-27 10:45:09,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {1276#true} ~cond := #in~cond; {1276#true} is VALID [2022-04-27 10:45:09,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {1276#true} assume !(0 == ~cond); {1276#true} is VALID [2022-04-27 10:45:09,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {1276#true} assume true; {1276#true} is VALID [2022-04-27 10:45:09,064 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1276#true} {1281#(<= 0 main_~j~0)} #120#return; {1281#(<= 0 main_~j~0)} is VALID [2022-04-27 10:45:09,064 INFO L272 TraceCheckUtils]: 20: Hoare triple {1281#(<= 0 main_~j~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1276#true} is VALID [2022-04-27 10:45:09,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {1276#true} ~cond := #in~cond; {1276#true} is VALID [2022-04-27 10:45:09,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {1276#true} assume !(0 == ~cond); {1276#true} is VALID [2022-04-27 10:45:09,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {1276#true} assume true; {1276#true} is VALID [2022-04-27 10:45:09,075 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1276#true} {1281#(<= 0 main_~j~0)} #122#return; {1281#(<= 0 main_~j~0)} is VALID [2022-04-27 10:45:09,076 INFO L272 TraceCheckUtils]: 25: Hoare triple {1281#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {1294#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:45:09,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {1294#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1295#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:45:09,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {1295#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1277#false} is VALID [2022-04-27 10:45:09,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {1277#false} assume !false; {1277#false} is VALID [2022-04-27 10:45:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:45:09,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:09,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155178029] [2022-04-27 10:45:09,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155178029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:09,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:09,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:09,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874667513] [2022-04-27 10:45:09,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:09,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 10:45:09,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:09,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 10:45:09,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:09,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:09,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:09,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:09,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:09,090 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 10:45:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:09,528 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-27 10:45:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:09,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 10:45:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 10:45:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-27 10:45:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 10:45:09,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-27 10:45:09,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-27 10:45:09,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:09,589 INFO L225 Difference]: With dead ends: 66 [2022-04-27 10:45:09,589 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 10:45:09,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:45:09,590 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:09,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 53 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:09,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 10:45:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-27 10:45:09,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:09,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:09,640 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:09,641 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:09,643 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 10:45:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 10:45:09,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:09,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:09,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-27 10:45:09,644 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-27 10:45:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:09,645 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 10:45:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 10:45:09,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:09,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:09,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:09,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-27 10:45:09,648 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 29 [2022-04-27 10:45:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:09,648 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-27 10:45:09,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 10:45:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 10:45:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 10:45:09,649 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:09,649 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:09,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:45:09,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:09,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:09,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1991737873, now seen corresponding path program 1 times [2022-04-27 10:45:09,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:09,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064999609] [2022-04-27 10:45:09,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:09,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {1658#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1625#true} is VALID [2022-04-27 10:45:09,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1625#true} {1625#true} #126#return; {1625#true} is VALID [2022-04-27 10:45:09,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 10:45:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} ~cond := #in~cond; {1625#true} is VALID [2022-04-27 10:45:09,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} assume !(0 == ~cond); {1625#true} is VALID [2022-04-27 10:45:09,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} #94#return; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 10:45:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} ~cond := #in~cond; {1625#true} is VALID [2022-04-27 10:45:09,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} assume !(0 == ~cond); {1625#true} is VALID [2022-04-27 10:45:09,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} #96#return; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 10:45:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} ~cond := #in~cond; {1625#true} is VALID [2022-04-27 10:45:09,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} assume !(0 == ~cond); {1625#true} is VALID [2022-04-27 10:45:09,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} #98#return; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-27 10:45:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} ~cond := #in~cond; {1625#true} is VALID [2022-04-27 10:45:09,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} assume !(0 == ~cond); {1625#true} is VALID [2022-04-27 10:45:09,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} #100#return; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 10:45:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} ~cond := #in~cond; {1625#true} is VALID [2022-04-27 10:45:09,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} assume !(0 == ~cond); {1625#true} is VALID [2022-04-27 10:45:09,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} #102#return; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 10:45:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:09,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} ~cond := #in~cond; {1625#true} is VALID [2022-04-27 10:45:09,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} assume !(0 == ~cond); {1625#true} is VALID [2022-04-27 10:45:09,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} #104#return; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {1625#true} call ULTIMATE.init(); {1658#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:09,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {1658#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1625#true} is VALID [2022-04-27 10:45:09,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1625#true} #126#return; {1625#true} is VALID [2022-04-27 10:45:09,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {1625#true} call #t~ret11 := main(); {1625#true} is VALID [2022-04-27 10:45:09,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {1625#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {1625#true} is VALID [2022-04-27 10:45:09,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {1625#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {1625#true} is VALID [2022-04-27 10:45:09,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {1625#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {1625#true} is VALID [2022-04-27 10:45:09,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {1625#true} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1625#true} is VALID [2022-04-27 10:45:09,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {1625#true} assume 1 + ~i~0 < ~len~0; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,758 INFO L272 TraceCheckUtils]: 10: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {1625#true} is VALID [2022-04-27 10:45:09,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {1625#true} ~cond := #in~cond; {1625#true} is VALID [2022-04-27 10:45:09,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#true} assume !(0 == ~cond); {1625#true} is VALID [2022-04-27 10:45:09,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,770 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} #94#return; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,771 INFO L272 TraceCheckUtils]: 15: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1625#true} is VALID [2022-04-27 10:45:09,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {1625#true} ~cond := #in~cond; {1625#true} is VALID [2022-04-27 10:45:09,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {1625#true} assume !(0 == ~cond); {1625#true} is VALID [2022-04-27 10:45:09,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,773 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} #96#return; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} assume !(0 != #t~nondet3);havoc #t~nondet3; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,774 INFO L272 TraceCheckUtils]: 22: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1625#true} is VALID [2022-04-27 10:45:09,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {1625#true} ~cond := #in~cond; {1625#true} is VALID [2022-04-27 10:45:09,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {1625#true} assume !(0 == ~cond); {1625#true} is VALID [2022-04-27 10:45:09,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,775 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} #98#return; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,775 INFO L272 TraceCheckUtils]: 27: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1625#true} is VALID [2022-04-27 10:45:09,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {1625#true} ~cond := #in~cond; {1625#true} is VALID [2022-04-27 10:45:09,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {1625#true} assume !(0 == ~cond); {1625#true} is VALID [2022-04-27 10:45:09,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,777 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} #100#return; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,777 INFO L272 TraceCheckUtils]: 32: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1625#true} is VALID [2022-04-27 10:45:09,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {1625#true} ~cond := #in~cond; {1625#true} is VALID [2022-04-27 10:45:09,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {1625#true} assume !(0 == ~cond); {1625#true} is VALID [2022-04-27 10:45:09,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,778 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} #102#return; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,778 INFO L272 TraceCheckUtils]: 37: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {1625#true} is VALID [2022-04-27 10:45:09,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {1625#true} ~cond := #in~cond; {1625#true} is VALID [2022-04-27 10:45:09,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {1625#true} assume !(0 == ~cond); {1625#true} is VALID [2022-04-27 10:45:09,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-27 10:45:09,778 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} #104#return; {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 10:45:09,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1655#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2022-04-27 10:45:09,779 INFO L272 TraceCheckUtils]: 43: Hoare triple {1655#(<= (+ main_~i~0 1) main_~len~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:45:09,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {1656#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1657#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:45:09,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {1657#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1626#false} is VALID [2022-04-27 10:45:09,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {1626#false} assume !false; {1626#false} is VALID [2022-04-27 10:45:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 10:45:09,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:09,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064999609] [2022-04-27 10:45:09,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064999609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:09,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:09,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:09,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119736476] [2022-04-27 10:45:09,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:09,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-27 10:45:09,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:09,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 10:45:09,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:09,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:09,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:09,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:09,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:09,805 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 10:45:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:10,391 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-27 10:45:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:10,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-27 10:45:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 10:45:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-27 10:45:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 10:45:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-27 10:45:10,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2022-04-27 10:45:10,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:10,456 INFO L225 Difference]: With dead ends: 75 [2022-04-27 10:45:10,456 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 10:45:10,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:45:10,457 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:10,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 57 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:45:10,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 10:45:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-04-27 10:45:10,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:10,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:10,506 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:10,506 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:10,508 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-27 10:45:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-27 10:45:10,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:10,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:10,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-27 10:45:10,509 INFO L87 Difference]: Start difference. First operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-27 10:45:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:10,511 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-27 10:45:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-27 10:45:10,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:10,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:10,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:10,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-27 10:45:10,514 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 47 [2022-04-27 10:45:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:10,514 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-27 10:45:10,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 10:45:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 10:45:10,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-27 10:45:10,515 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:10,515 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:10,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 10:45:10,515 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:10,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1947441265, now seen corresponding path program 1 times [2022-04-27 10:45:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:10,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684928268] [2022-04-27 10:45:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:10,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:10,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {2070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2028#true} is VALID [2022-04-27 10:45:10,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,573 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2028#true} {2028#true} #126#return; {2028#true} is VALID [2022-04-27 10:45:10,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 10:45:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:10,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #94#return; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 10:45:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:10,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #96#return; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 10:45:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:10,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #98#return; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-27 10:45:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:10,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #100#return; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 10:45:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:10,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #102#return; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 10:45:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:10,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #104#return; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-27 10:45:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:10,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} #106#return; {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 10:45:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:10,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} #108#return; {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:10,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2028#true} is VALID [2022-04-27 10:45:10,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #126#return; {2028#true} is VALID [2022-04-27 10:45:10,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret11 := main(); {2028#true} is VALID [2022-04-27 10:45:10,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {2028#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {2028#true} is VALID [2022-04-27 10:45:10,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {2028#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {2033#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {2033#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {2033#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {2033#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume 1 + ~i~0 < ~len~0; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,609 INFO L272 TraceCheckUtils]: 10: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {2028#true} is VALID [2022-04-27 10:45:10,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,610 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #94#return; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,610 INFO L272 TraceCheckUtils]: 15: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2028#true} is VALID [2022-04-27 10:45:10,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,611 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #96#return; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume !(0 != #t~nondet3);havoc #t~nondet3; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,611 INFO L272 TraceCheckUtils]: 22: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2028#true} is VALID [2022-04-27 10:45:10,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,612 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #98#return; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,612 INFO L272 TraceCheckUtils]: 27: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2028#true} is VALID [2022-04-27 10:45:10,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,613 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #100#return; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,613 INFO L272 TraceCheckUtils]: 32: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2028#true} is VALID [2022-04-27 10:45:10,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,613 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #102#return; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,613 INFO L272 TraceCheckUtils]: 37: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {2028#true} is VALID [2022-04-27 10:45:10,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,614 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #104#return; {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,615 INFO L272 TraceCheckUtils]: 43: Hoare triple {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2028#true} is VALID [2022-04-27 10:45:10,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,615 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2028#true} {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} #106#return; {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,616 INFO L272 TraceCheckUtils]: 48: Hoare triple {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2028#true} is VALID [2022-04-27 10:45:10,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-27 10:45:10,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-27 10:45:10,616 INFO L290 TraceCheckUtils]: 51: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-27 10:45:10,616 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2028#true} {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} #108#return; {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:10,617 INFO L272 TraceCheckUtils]: 53: Hoare triple {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2068#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:45:10,617 INFO L290 TraceCheckUtils]: 54: Hoare triple {2068#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2069#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:45:10,617 INFO L290 TraceCheckUtils]: 55: Hoare triple {2069#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2029#false} is VALID [2022-04-27 10:45:10,617 INFO L290 TraceCheckUtils]: 56: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2022-04-27 10:45:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 10:45:10,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:10,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684928268] [2022-04-27 10:45:10,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684928268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:10,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:10,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:45:10,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850632425] [2022-04-27 10:45:10,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:10,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-04-27 10:45:10,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:10,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 10:45:10,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:10,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:45:10,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:10,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:45:10,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:45:10,641 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 10:45:11,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:11,244 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2022-04-27 10:45:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:45:11,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-04-27 10:45:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 10:45:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-27 10:45:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 10:45:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-27 10:45:11,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-27 10:45:11,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:11,313 INFO L225 Difference]: With dead ends: 75 [2022-04-27 10:45:11,313 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 10:45:11,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:45:11,314 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:11,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 59 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 10:45:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-27 10:45:11,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:11,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:11,377 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:11,377 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:11,378 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-27 10:45:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-27 10:45:11,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:11,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:11,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-27 10:45:11,379 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-27 10:45:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:11,381 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-27 10:45:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-27 10:45:11,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:11,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:11,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:11,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:45:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-04-27 10:45:11,383 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 57 [2022-04-27 10:45:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:11,383 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-04-27 10:45:11,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 10:45:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-27 10:45:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 10:45:11,384 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:11,384 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:11,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 10:45:11,385 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:11,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1358511123, now seen corresponding path program 1 times [2022-04-27 10:45:11,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:11,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534807834] [2022-04-27 10:45:11,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:11,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:11,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:11,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {2495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2444#true} is VALID [2022-04-27 10:45:11,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2444#true} {2444#true} #126#return; {2444#true} is VALID [2022-04-27 10:45:11,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 10:45:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:11,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #94#return; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 10:45:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:11,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #96#return; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 10:45:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:11,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #98#return; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-27 10:45:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:11,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #100#return; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 10:45:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:11,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #102#return; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 10:45:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:11,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #104#return; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-27 10:45:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:11,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} #106#return; {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 10:45:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:11,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} #108#return; {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 10:45:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:11,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} #110#return; {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-27 10:45:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:11,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} #112#return; {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {2444#true} call ULTIMATE.init(); {2495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:11,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {2495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2444#true} is VALID [2022-04-27 10:45:11,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2444#true} #126#return; {2444#true} is VALID [2022-04-27 10:45:11,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {2444#true} call #t~ret11 := main(); {2444#true} is VALID [2022-04-27 10:45:11,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {2444#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {2444#true} is VALID [2022-04-27 10:45:11,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {2444#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {2449#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {2449#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {2449#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {2449#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume 1 + ~i~0 < ~len~0; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,524 INFO L272 TraceCheckUtils]: 10: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {2444#true} is VALID [2022-04-27 10:45:11,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,525 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #94#return; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,526 INFO L272 TraceCheckUtils]: 15: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2444#true} is VALID [2022-04-27 10:45:11,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,526 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #96#return; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume !(0 != #t~nondet3);havoc #t~nondet3; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,532 INFO L272 TraceCheckUtils]: 22: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2444#true} is VALID [2022-04-27 10:45:11,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,537 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #98#return; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,537 INFO L272 TraceCheckUtils]: 27: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2444#true} is VALID [2022-04-27 10:45:11,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,539 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #100#return; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,539 INFO L272 TraceCheckUtils]: 32: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2444#true} is VALID [2022-04-27 10:45:11,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,543 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #102#return; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,543 INFO L272 TraceCheckUtils]: 37: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {2444#true} is VALID [2022-04-27 10:45:11,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,544 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #104#return; {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,546 INFO L290 TraceCheckUtils]: 42: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,546 INFO L272 TraceCheckUtils]: 43: Hoare triple {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2444#true} is VALID [2022-04-27 10:45:11,546 INFO L290 TraceCheckUtils]: 44: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,546 INFO L290 TraceCheckUtils]: 45: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,547 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} #106#return; {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,547 INFO L272 TraceCheckUtils]: 48: Hoare triple {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2444#true} is VALID [2022-04-27 10:45:11,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,547 INFO L290 TraceCheckUtils]: 50: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,548 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} #108#return; {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,548 INFO L272 TraceCheckUtils]: 53: Hoare triple {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2444#true} is VALID [2022-04-27 10:45:11,548 INFO L290 TraceCheckUtils]: 54: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,548 INFO L290 TraceCheckUtils]: 55: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,548 INFO L290 TraceCheckUtils]: 56: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,548 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} #110#return; {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,548 INFO L272 TraceCheckUtils]: 58: Hoare triple {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {2444#true} is VALID [2022-04-27 10:45:11,548 INFO L290 TraceCheckUtils]: 59: Hoare triple {2444#true} ~cond := #in~cond; {2444#true} is VALID [2022-04-27 10:45:11,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {2444#true} assume !(0 == ~cond); {2444#true} is VALID [2022-04-27 10:45:11,549 INFO L290 TraceCheckUtils]: 61: Hoare triple {2444#true} assume true; {2444#true} is VALID [2022-04-27 10:45:11,550 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} #112#return; {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,550 INFO L290 TraceCheckUtils]: 63: Hoare triple {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6;#t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2492#(<= (+ main_~j~0 3) main_~bufsize~0)} is VALID [2022-04-27 10:45:11,551 INFO L272 TraceCheckUtils]: 64: Hoare triple {2492#(<= (+ main_~j~0 3) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:45:11,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {2493#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2494#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:45:11,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {2494#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2445#false} is VALID [2022-04-27 10:45:11,552 INFO L290 TraceCheckUtils]: 67: Hoare triple {2445#false} assume !false; {2445#false} is VALID [2022-04-27 10:45:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 10:45:11,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:11,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534807834] [2022-04-27 10:45:11,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534807834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:11,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:11,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 10:45:11,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443351994] [2022-04-27 10:45:11,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:11,554 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 68 [2022-04-27 10:45:11,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:11,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 10:45:11,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:11,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 10:45:11,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:11,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 10:45:11,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:45:11,583 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 10:45:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:12,228 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-27 10:45:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:45:12,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 68 [2022-04-27 10:45:12,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 10:45:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-27 10:45:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 10:45:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-27 10:45:12,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-27 10:45:12,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:12,290 INFO L225 Difference]: With dead ends: 73 [2022-04-27 10:45:12,290 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:45:12,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:45:12,292 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:12,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 56 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:45:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:45:12,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:12,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:45:12,293 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:45:12,293 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:45:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:12,293 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:45:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:45:12,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:12,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:12,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:45:12,293 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:45:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:12,293 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:45:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:45:12,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:12,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:12,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:12,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:45:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:45:12,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2022-04-27 10:45:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:12,294 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:45:12,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 10:45:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:45:12,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:12,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:45:12,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 10:45:12,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:45:12,626 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:45:12,626 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:45:12,626 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:45:12,627 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:45:12,627 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:45:12,627 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:45:12,627 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:45:12,627 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-27 10:45:12,627 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-27 10:45:12,627 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-04-27 10:45:12,627 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 67) no Hoare annotation was computed. [2022-04-27 10:45:12,627 INFO L895 garLoopResultBuilder]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-27 10:45:12,628 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-27 10:45:12,628 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-27 10:45:12,628 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-27 10:45:12,628 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-04-27 10:45:12,628 INFO L895 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-04-27 10:45:12,628 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 63) no Hoare annotation was computed. [2022-04-27 10:45:12,628 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-27 10:45:12,628 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-04-27 10:45:12,628 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-04-27 10:45:12,628 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-04-27 10:45:12,628 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-04-27 10:45:12,629 INFO L895 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-04-27 10:45:12,629 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-27 10:45:12,629 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-27 10:45:12,629 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-27 10:45:12,629 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 67) no Hoare annotation was computed. [2022-04-27 10:45:12,629 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-04-27 10:45:12,629 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-04-27 10:45:12,629 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-27 10:45:12,629 INFO L899 garLoopResultBuilder]: For program point L34-3(lines 34 65) no Hoare annotation was computed. [2022-04-27 10:45:12,629 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 67) the Hoare annotation is: true [2022-04-27 10:45:12,629 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-27 10:45:12,629 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-27 10:45:12,629 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-04-27 10:45:12,629 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-04-27 10:45:12,629 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:45:12,630 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 10:45:12,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:45:12,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:45:12,630 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:45:12,630 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:45:12,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:45:12,630 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:45:12,630 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:45:12,630 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:45:12,630 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:45:12,630 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:45:12,630 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:45:12,633 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:12,634 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:45:12,636 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:45:12,636 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:45:12,636 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 10:45:12,637 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 10:45:12,638 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:45:12,638 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:45:12,638 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:45:12,639 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:45:12,639 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 10:45:12,640 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 10:45:12,640 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,640 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 10:45:12,641 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 10:45:12,642 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 10:45:12,642 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 10:45:12,642 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-27 10:45:12,642 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-27 10:45:12,642 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 10:45:12,642 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 10:45:12,642 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:45:12,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:45:12 BoogieIcfgContainer [2022-04-27 10:45:12,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:45:12,650 INFO L158 Benchmark]: Toolchain (without parser) took 7738.29ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 118.3MB in the beginning and 80.2MB in the end (delta: 38.1MB). Peak memory consumption was 73.3MB. Max. memory is 8.0GB. [2022-04-27 10:45:12,650 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:45:12,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.20ms. Allocated memory is still 169.9MB. Free memory was 118.2MB in the beginning and 143.5MB in the end (delta: -25.3MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-27 10:45:12,650 INFO L158 Benchmark]: Boogie Preprocessor took 39.91ms. Allocated memory is still 169.9MB. Free memory was 143.5MB in the beginning and 141.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:45:12,650 INFO L158 Benchmark]: RCFGBuilder took 335.59ms. Allocated memory is still 169.9MB. Free memory was 141.8MB in the beginning and 127.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 10:45:12,651 INFO L158 Benchmark]: TraceAbstraction took 7110.73ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 126.7MB in the beginning and 80.2MB in the end (delta: 46.5MB). Peak memory consumption was 81.9MB. Max. memory is 8.0GB. [2022-04-27 10:45:12,652 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.09ms. Allocated memory is still 169.9MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.20ms. Allocated memory is still 169.9MB. Free memory was 118.2MB in the beginning and 143.5MB in the end (delta: -25.3MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.91ms. Allocated memory is still 169.9MB. Free memory was 143.5MB in the beginning and 141.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 335.59ms. Allocated memory is still 169.9MB. Free memory was 141.8MB in the beginning and 127.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7110.73ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 126.7MB in the beginning and 80.2MB in the end (delta: 46.5MB). Peak memory consumption was 81.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 254 mSDsluCounter, 454 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 497 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1453 IncrementalHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 497 mSolverCounterUnsat, 294 mSDtfsCounter, 1453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 55 PreInvPairs, 76 NumberOfFragments, 374 HoareAnnotationTreeSize, 55 FomulaSimplifications, 98 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 532 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((i + 1 <= len && 0 <= j) && 5 + j <= bufsize) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize RESULT: Ultimate proved your program to be correct! [2022-04-27 10:45:12,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...