/usr/bin/java -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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:31:43,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:31:43,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:31:43,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:31:43,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:31:43,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:31:44,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:31:44,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:31:44,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:31:44,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:31:44,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:31:44,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:31:44,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:31:44,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:31:44,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:31:44,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:31:44,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:31:44,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:31:44,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:31:44,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:31:44,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:31:44,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:31:44,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:31:44,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:31:44,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:31:44,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:31:44,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:31:44,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:31:44,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:31:44,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:31:44,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:31:44,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:31:44,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:31:44,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:31:44,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:31:44,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:31:44,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:31:44,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:31:44,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:31:44,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:31:44,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:31:44,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:31:44,071 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:31:44,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:31:44,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:31:44,073 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:31:44,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:31:44,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:31:44,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:31:44,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:31:44,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:31:44,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:31:44,075 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:31:44,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:31:44,075 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:31:44,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:31:44,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:31:44,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:31:44,076 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:31:44,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:31:44,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:31:44,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:31:44,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:31:44,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:31:44,076 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:31:44,076 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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; [2021-05-02 23:31:44,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:31:44,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:31:44,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:31:44,327 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:31:44,328 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:31:44,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2021-05-02 23:31:44,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08630c04b/9fa356b842ca45fdb0997a4e1b71463b/FLAG2ea814c00 [2021-05-02 23:31:44,761 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:31:44,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2021-05-02 23:31:44,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08630c04b/9fa356b842ca45fdb0997a4e1b71463b/FLAG2ea814c00 [2021-05-02 23:31:44,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08630c04b/9fa356b842ca45fdb0997a4e1b71463b [2021-05-02 23:31:44,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:31:44,782 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:31:44,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:31:44,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:31:44,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:31:44,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:31:44" (1/1) ... [2021-05-02 23:31:44,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b186791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:44, skipping insertion in model container [2021-05-02 23:31:44,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:31:44" (1/1) ... [2021-05-02 23:31:44,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:31:44,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:31:44,886 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2021-05-02 23:31:44,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:31:44,909 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:31:44,917 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2021-05-02 23:31:44,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:31:44,946 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:31:44,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:44 WrapperNode [2021-05-02 23:31:44,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:31:44,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:31:44,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:31:44,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:31:44,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:44" (1/1) ... [2021-05-02 23:31:44,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:44" (1/1) ... [2021-05-02 23:31:44,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:44" (1/1) ... [2021-05-02 23:31:44,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:44" (1/1) ... [2021-05-02 23:31:44,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:44" (1/1) ... [2021-05-02 23:31:44,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:44" (1/1) ... [2021-05-02 23:31:44,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:44" (1/1) ... [2021-05-02 23:31:44,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:31:44,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:31:44,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:31:44,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:31:44,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:31:45,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:31:45,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:31:45,036 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:31:45,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 23:31:45,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:31:45,036 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:31:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:31:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:31:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 23:31:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 23:31:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:31:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:31:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 23:31:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:31:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 23:31:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:31:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:31:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:31:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:31:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:31:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:31:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:31:45,197 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:31:45,197 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:31:45,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:31:45 BoogieIcfgContainer [2021-05-02 23:31:45,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:31:45,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:31:45,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:31:45,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:31:45,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:31:44" (1/3) ... [2021-05-02 23:31:45,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332fc844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:31:45, skipping insertion in model container [2021-05-02 23:31:45,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:44" (2/3) ... [2021-05-02 23:31:45,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332fc844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:31:45, skipping insertion in model container [2021-05-02 23:31:45,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:31:45" (3/3) ... [2021-05-02 23:31:45,204 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2021-05-02 23:31:45,208 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:31:45,227 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:31:45,239 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:31:45,262 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:31:45,262 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:31:45,262 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:31:45,262 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:31:45,262 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:31:45,262 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:31:45,262 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:31:45,262 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:31:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-05-02 23:31:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:31:45,278 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:45,278 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:45,279 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1361038294, now seen corresponding path program 1 times [2021-05-02 23:31:45,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:45,289 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [402031725] [2021-05-02 23:31:45,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:45,345 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:45,519 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:45,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [402031725] [2021-05-02 23:31:45,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [402031725] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:45,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:45,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 23:31:45,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487646978] [2021-05-02 23:31:45,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 23:31:45,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:45,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 23:31:45,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:31:45,539 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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) [2021-05-02 23:31:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:45,670 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2021-05-02 23:31:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 23:31:45,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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 15 [2021-05-02 23:31:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:45,678 INFO L225 Difference]: With dead ends: 62 [2021-05-02 23:31:45,678 INFO L226 Difference]: Without dead ends: 30 [2021-05-02 23:31:45,683 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:31:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-05-02 23:31:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-05-02 23:31:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 23:31:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-05-02 23:31:45,737 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2021-05-02 23:31:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:45,737 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-05-02 23:31:45,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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) [2021-05-02 23:31:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2021-05-02 23:31:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 23:31:45,739 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:45,739 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:45,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:31:45,739 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:45,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:45,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1347976123, now seen corresponding path program 1 times [2021-05-02 23:31:45,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:45,740 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [358713689] [2021-05-02 23:31:45,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:45,742 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:45,890 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:45,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [358713689] [2021-05-02 23:31:45,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [358713689] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:45,890 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:45,891 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:31:45,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326882916] [2021-05-02 23:31:45,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:31:45,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:45,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:31:45,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:31:45,895 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-05-02 23:31:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:46,101 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2021-05-02 23:31:46,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:31:46,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2021-05-02 23:31:46,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:46,102 INFO L225 Difference]: With dead ends: 36 [2021-05-02 23:31:46,103 INFO L226 Difference]: Without dead ends: 34 [2021-05-02 23:31:46,104 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 100.5ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:31:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-05-02 23:31:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-05-02 23:31:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 23:31:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-05-02 23:31:46,111 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2021-05-02 23:31:46,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:46,111 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-05-02 23:31:46,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-05-02 23:31:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2021-05-02 23:31:46,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 23:31:46,112 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:46,112 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:46,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:31:46,113 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:46,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:46,113 INFO L82 PathProgramCache]: Analyzing trace with hash -863391162, now seen corresponding path program 1 times [2021-05-02 23:31:46,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:46,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [716069110] [2021-05-02 23:31:46,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:46,115 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 23:31:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:46,212 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:46,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [716069110] [2021-05-02 23:31:46,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [716069110] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:46,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:46,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:31:46,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78051142] [2021-05-02 23:31:46,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:31:46,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:46,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:31:46,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:31:46,214 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-05-02 23:31:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:46,457 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2021-05-02 23:31:46,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:31:46,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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 21 [2021-05-02 23:31:46,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:46,459 INFO L225 Difference]: With dead ends: 49 [2021-05-02 23:31:46,459 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 23:31:46,459 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 124.2ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:31:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 23:31:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-05-02 23:31:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-02 23:31:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2021-05-02 23:31:46,468 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2021-05-02 23:31:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:46,468 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2021-05-02 23:31:46,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-05-02 23:31:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2021-05-02 23:31:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:31:46,469 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:46,469 INFO L523 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:46,469 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:31:46,469 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:46,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:46,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1742477006, now seen corresponding path program 1 times [2021-05-02 23:31:46,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:46,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [906080580] [2021-05-02 23:31:46,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:46,472 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-02 23:31:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-02 23:31:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:46,554 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:46,554 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [906080580] [2021-05-02 23:31:46,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [906080580] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:46,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:46,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:31:46,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506560314] [2021-05-02 23:31:46,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:31:46,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:46,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:31:46,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:31:46,559 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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) [2021-05-02 23:31:46,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:46,788 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2021-05-02 23:31:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:31:46,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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 29 [2021-05-02 23:31:46,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:46,791 INFO L225 Difference]: With dead ends: 56 [2021-05-02 23:31:46,791 INFO L226 Difference]: Without dead ends: 54 [2021-05-02 23:31:46,792 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 92.2ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:31:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-05-02 23:31:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2021-05-02 23:31:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-02 23:31:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2021-05-02 23:31:46,806 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 29 [2021-05-02 23:31:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:46,806 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2021-05-02 23:31:46,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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) [2021-05-02 23:31:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2021-05-02 23:31:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-02 23:31:46,807 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:46,807 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:46,808 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:31:46,808 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:46,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:46,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1571308956, now seen corresponding path program 1 times [2021-05-02 23:31:46,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:46,808 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1072623565] [2021-05-02 23:31:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:46,812 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 23:31:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 23:31:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-05-02 23:31:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-02 23:31:46,911 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:46,912 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1072623565] [2021-05-02 23:31:46,912 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1072623565] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:46,912 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:46,912 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:31:46,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295655983] [2021-05-02 23:31:46,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:31:46,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:46,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:31:46,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:31:46,913 INFO L87 Difference]: Start difference. First operand 49 states and 60 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 23:31:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:47,270 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2021-05-02 23:31:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:31:47,270 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2021-05-02 23:31:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:47,271 INFO L225 Difference]: With dead ends: 75 [2021-05-02 23:31:47,271 INFO L226 Difference]: Without dead ends: 68 [2021-05-02 23:31:47,272 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 146.0ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:31:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-02 23:31:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2021-05-02 23:31:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 23:31:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2021-05-02 23:31:47,282 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2021-05-02 23:31:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:47,282 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2021-05-02 23:31:47,282 INFO L481 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 23:31:47,282 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2021-05-02 23:31:47,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-02 23:31:47,283 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:47,283 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:47,283 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:31:47,283 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:47,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:47,283 INFO L82 PathProgramCache]: Analyzing trace with hash 173943289, now seen corresponding path program 1 times [2021-05-02 23:31:47,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:47,284 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [199291537] [2021-05-02 23:31:47,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:47,285 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-02 23:31:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-02 23:31:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 23:31:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:47,387 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:47,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [199291537] [2021-05-02 23:31:47,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [199291537] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:47,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:47,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:31:47,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612445060] [2021-05-02 23:31:47,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:31:47,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:47,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:31:47,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:31:47,388 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 23:31:47,617 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:31:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:47,986 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2021-05-02 23:31:47,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:31:47,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2021-05-02 23:31:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:47,987 INFO L225 Difference]: With dead ends: 77 [2021-05-02 23:31:47,988 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 23:31:47,988 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 360.0ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:31:47,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 23:31:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2021-05-02 23:31:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 23:31:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2021-05-02 23:31:48,001 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2021-05-02 23:31:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:48,001 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2021-05-02 23:31:48,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 23:31:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2021-05-02 23:31:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-02 23:31:48,002 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:48,002 INFO L523 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 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] [2021-05-02 23:31:48,002 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:31:48,002 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:48,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:48,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1755534668, now seen corresponding path program 1 times [2021-05-02 23:31:48,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:48,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2058313982] [2021-05-02 23:31:48,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:48,038 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (+ v_main_~in~0_12 1))) (and (<= 0 v_main_~buf~0_26) (not (= v_main_~buflim~0_5 v_main_~buf~0_26)) (< .cse0 v_main_~inlen~0_9) (<= 0 .cse0) (< v_main_~buf~0_26 v_main_~bufferlen~0_14) (<= |v_main_#t~nondet5_7| 2147483647) (not (= |v_main_#t~nondet5_7| 0)) (<= 0 (+ |v_main_#t~nondet5_7| 2147483648)))) InVars {main_#t~nondet5=|v_main_#t~nondet5_7|, main_~in~0=v_main_~in~0_12, main_~buf~0=v_main_~buf~0_26, main_~buflim~0=v_main_~buflim~0_5, main_~inlen~0=v_main_~inlen~0_9, main_~bufferlen~0=v_main_~bufferlen~0_14} OutVars{main_#t~nondet5=|v_main_#t~nondet5_7|, main_~in~0=v_main_~in~0_12, main_~buf~0=v_main_~buf~0_26, main_~buflim~0=v_main_~buflim~0_5, main_~inlen~0=v_main_~inlen~0_9, main_~bufferlen~0=v_main_~bufferlen~0_14} AuxVars[] AssignedVars[] [2021-05-02 23:31:48,062 WARN L240 tifierPushTermWalker]: treesize reduction 23, result has 89.2 percent of original size [2021-05-02 23:31:48,133 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:48,137 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:48,163 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-05-02 23:31:48,172 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:48,201 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-05-02 23:31:48,215 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-05-02 23:31:48,283 WARN L245 tifierPushTermWalker]: treesize reduction 23, result has 89.2 percent of original size 189 [2021-05-02 23:31:48,357 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:48,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:48,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-02 23:31:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:48,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-02 23:31:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:48,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-02 23:31:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-02 23:31:48,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,743 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,761 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,840 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,847 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,941 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,281 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,282 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,318 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,363 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,364 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,371 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,383 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,432 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,433 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,529 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,657 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,688 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,690 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,730 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,731 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,778 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:49,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:50,156 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:50,158 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:50,163 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:50,164 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:50,170 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:50,172 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:50,176 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:50,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:50,181 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:50,229 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:50,230 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2058313982] [2021-05-02 23:31:50,230 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2058313982] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:50,230 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:50,230 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-02 23:31:50,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494338897] [2021-05-02 23:31:50,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 23:31:50,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:50,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 23:31:50,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:31:50,231 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 24 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 16 states have internal predecessors, (30), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2021-05-02 23:31:51,205 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2021-05-02 23:32:04,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:04,465 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2021-05-02 23:32:04,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 23:32:04,471 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 16 states have internal predecessors, (30), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 57 [2021-05-02 23:32:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:04,473 INFO L225 Difference]: With dead ends: 74 [2021-05-02 23:32:04,473 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 23:32:04,474 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 11225.8ms TimeCoverageRelationStatistics Valid=292, Invalid=1420, Unknown=10, NotChecked=0, Total=1722 [2021-05-02 23:32:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 23:32:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-05-02 23:32:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2021-05-02 23:32:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2021-05-02 23:32:04,486 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 57 [2021-05-02 23:32:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:04,486 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2021-05-02 23:32:04,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 16 states have internal predecessors, (30), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2021-05-02 23:32:04,486 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2021-05-02 23:32:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 23:32:04,487 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:04,487 INFO L523 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:04,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:32:04,488 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:04,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:04,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1121193385, now seen corresponding path program 1 times [2021-05-02 23:32:04,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:04,488 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1921074131] [2021-05-02 23:32:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:04,502 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (+ v_main_~in~0_20 1))) (and (<= |v_main_#t~nondet5_11| 2147483647) (< v_main_~buf~0_34 v_main_~bufferlen~0_17) (<= 0 v_main_~buf~0_34) (not (= v_main_~buflim~0_6 v_main_~buf~0_34)) (<= 0 .cse0) (<= 0 (+ |v_main_#t~nondet5_11| 2147483648)) (not (= |v_main_#t~nondet5_11| 0)) (< .cse0 v_main_~inlen~0_12))) InVars {main_#t~nondet5=|v_main_#t~nondet5_11|, main_~in~0=v_main_~in~0_20, main_~buf~0=v_main_~buf~0_34, main_~buflim~0=v_main_~buflim~0_6, main_~inlen~0=v_main_~inlen~0_12, main_~bufferlen~0=v_main_~bufferlen~0_17} OutVars{main_#t~nondet5=|v_main_#t~nondet5_11|, main_~in~0=v_main_~in~0_20, main_~buf~0=v_main_~buf~0_34, main_~buflim~0=v_main_~buflim~0_6, main_~inlen~0=v_main_~inlen~0_12, main_~bufferlen~0=v_main_~bufferlen~0_17} AuxVars[] AssignedVars[] [2021-05-02 23:32:04,507 WARN L240 tifierPushTermWalker]: treesize reduction 23, result has 89.2 percent of original size [2021-05-02 23:32:04,565 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:04,566 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:04,585 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-05-02 23:32:04,587 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:04,615 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-05-02 23:32:04,627 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-05-02 23:32:04,698 WARN L245 tifierPushTermWalker]: treesize reduction 23, result has 89.2 percent of original size 189 [2021-05-02 23:32:04,752 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:04,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:32:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:04,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-05-02 23:32:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:04,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-05-02 23:32:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:04,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-05-02 23:32:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:32:04,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,043 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,160 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,223 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,252 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,282 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,287 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,376 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,430 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,478 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,529 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,538 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,689 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,776 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,814 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,817 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,902 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,949 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,967 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,968 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,971 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,972 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,975 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:32:05,999 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:32:05,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1921074131] [2021-05-02 23:32:05,999 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1921074131] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:32:05,999 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:32:05,999 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-02 23:32:05,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772631721] [2021-05-02 23:32:06,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-02 23:32:06,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:32:06,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-02 23:32:06,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:32:06,001 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 27 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 20 states have internal predecessors, (35), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2021-05-02 23:32:07,225 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2021-05-02 23:32:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:07,773 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2021-05-02 23:32:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 23:32:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 20 states have internal predecessors, (35), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 59 [2021-05-02 23:32:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:07,774 INFO L225 Difference]: With dead ends: 65 [2021-05-02 23:32:07,775 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:32:07,776 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 2167.0ms TimeCoverageRelationStatistics Valid=373, Invalid=1789, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:32:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:32:07,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:32:07,776 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) [2021-05-02 23:32:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:32:07,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2021-05-02 23:32:07,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:07,776 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:32:07,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 20 states have internal predecessors, (35), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2021-05-02 23:32:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:32:07,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:32:07,777 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 23:32:07,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:32:08,522 WARN L205 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 61 [2021-05-02 23:32:08,704 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 58 [2021-05-02 23:32:24,607 WARN L205 SmtUtils]: Spent 15.90 s on a formula simplification. DAG size of input: 240 DAG size of output: 61 [2021-05-02 23:32:25,029 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 61 [2021-05-02 23:32:25,228 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 21 [2021-05-02 23:32:25,399 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 54 [2021-05-02 23:32:25,610 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 49 [2021-05-02 23:32:25,772 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 49 [2021-05-02 23:32:26,092 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 64 [2021-05-02 23:32:26,337 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 58 [2021-05-02 23:32:26,467 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2021-05-02 23:32:26,877 WARN L205 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 60 [2021-05-02 23:32:27,331 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 60 [2021-05-02 23:32:27,412 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-02 23:32:27,413 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-02 23:32:27,413 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-02 23:32:27,413 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:32:27,413 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2021-05-02 23:32:27,413 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:32:27,413 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:32:27,413 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 23:32:27,413 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:32:27,413 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:32:27,413 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-02 23:32:27,413 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:32:27,413 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:32:27,413 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:32:27,413 INFO L201 CegarLoopUtils]: At program point L31(line 31) the Hoare annotation is: true [2021-05-02 23:32:27,413 INFO L194 CegarLoopUtils]: At program point L31-1(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2021-05-02 23:32:27,414 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 24 56) the Hoare annotation is: true [2021-05-02 23:32:27,414 INFO L194 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: (and (let ((.cse0 (<= 0 main_~buf~0)) (.cse1 (<= 2 main_~bufferlen~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and .cse0 (= main_~in~0 0) .cse1))) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2021-05-02 23:32:27,414 INFO L194 CegarLoopUtils]: At program point L52-1(line 52) the Hoare annotation is: (and (let ((.cse0 (<= 0 main_~buf~0)) (.cse1 (<= 2 main_~bufferlen~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and .cse0 (= main_~in~0 0) .cse1))) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2021-05-02 23:32:27,414 INFO L194 CegarLoopUtils]: At program point L44(lines 44 45) the Hoare annotation is: (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (let ((.cse0 (<= 2 main_~bufferlen~0))) (or (and (<= 1 main_~in~0) .cse0) (and (= main_~in~0 0) .cse0))) (exists ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v_main_~inlen~0_BEFORE_RETURN_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_3 Int) (v_main_~buf~0_36 Int)) (let ((.cse1 (+ v_main_~bufferlen~0_BEFORE_RETURN_3 1))) (and (= (ite (<= 0 main_~buf~0) 1 0) (ite (<= 0 v_main_~buf~0_36) 1 0)) (or (and (< v_main_~in~0_BEFORE_RETURN_2 .cse1) (<= v_main_~bufferlen~0_BEFORE_RETURN_3 v_main_~in~0_BEFORE_RETURN_2) (or (< v_main_~buflim~0_BEFORE_RETURN_2 1) (< v_main_~in~0_BEFORE_RETURN_2 (+ v_main_~buflim~0_BEFORE_RETURN_2 1))) (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36) (< 0 v_main_~in~0_BEFORE_RETURN_2) (not (= v_main_~buflim~0_BEFORE_RETURN_2 0))) (and (= v_main_~in~0_BEFORE_RETURN_2 0) (= v_main_~buf~0_36 0))) (<= .cse1 v_main_~inlen~0_BEFORE_RETURN_2) (not (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2)) (<= 3 v_main_~inlen~0_BEFORE_RETURN_2)))) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2021-05-02 23:32:27,414 INFO L194 CegarLoopUtils]: At program point L32(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2021-05-02 23:32:27,414 INFO L201 CegarLoopUtils]: At program point L53(line 53) the Hoare annotation is: true [2021-05-02 23:32:27,414 INFO L194 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: (or (and (exists ((v_main_~buf~0_28 Int) (v_main_~buflim~0_BEFORE_RETURN_1 Int) (v_main_~inlen~0_BEFORE_RETURN_1 Int) (v_main_~bufferlen~0_BEFORE_RETURN_1 Int) (v_main_~in~0_BEFORE_RETURN_1 Int)) (let ((.cse0 (+ v_main_~buflim~0_BEFORE_RETURN_1 1))) (and (= (ite (<= 0 v_main_~buf~0_28) 1 0) (ite (<= 0 main_~buf~0) 1 0)) (<= (+ v_main_~buflim~0_BEFORE_RETURN_1 2) v_main_~bufferlen~0_BEFORE_RETURN_1) (< 0 .cse0) (or (let ((.cse1 (+ v_main_~in~0_BEFORE_RETURN_1 1))) (and (< v_main_~buf~0_28 .cse0) (<= v_main_~buf~0_28 .cse1) (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1) (< 0 v_main_~buf~0_28) (<= v_main_~inlen~0_BEFORE_RETURN_1 .cse1))) (= v_main_~buf~0_28 0)) (not (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1))))) (exists ((v_main_~buf~0_28 Int) (v_main_~buf~0_BEFORE_CALL_2 Int) (v_main_~buflim~0_BEFORE_RETURN_1 Int) (v_main_~inlen~0_BEFORE_RETURN_1 Int) (v_main_~bufferlen~0_BEFORE_CALL_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_1 Int) (v_main_~in~0_BEFORE_RETURN_1 Int)) (let ((.cse3 (+ v_main_~buflim~0_BEFORE_RETURN_1 1)) (.cse2 (ite (< v_main_~buf~0_BEFORE_CALL_2 v_main_~bufferlen~0_BEFORE_CALL_2) 1 0))) (and (not (= .cse2 0)) (= (ite (<= 0 v_main_~buf~0_28) 1 0) (ite (<= 0 v_main_~buf~0_BEFORE_CALL_2) 1 0)) (<= (+ v_main_~buflim~0_BEFORE_RETURN_1 2) v_main_~bufferlen~0_BEFORE_RETURN_1) (< 0 .cse3) (or (let ((.cse4 (+ v_main_~in~0_BEFORE_RETURN_1 1))) (and (< v_main_~buf~0_28 .cse3) (<= v_main_~buf~0_28 .cse4) (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1) (< 0 v_main_~buf~0_28) (<= v_main_~inlen~0_BEFORE_RETURN_1 .cse4))) (= v_main_~buf~0_28 0)) (not (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1)) (= (ite (< main_~in~0 main_~inlen~0) 1 0) .cse2)))) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0)) (and (= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2021-05-02 23:32:27,414 INFO L194 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (not (= main_~buf~0 main_~buflim~0)) (= main_~in~0 0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (< 0 (+ main_~buflim~0 1)) (= main_~buf~0 0) .cse0) (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (exists ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v_main_~inlen~0_BEFORE_RETURN_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_3 Int) (v_main_~buf~0_36 Int)) (let ((.cse1 (+ v_main_~bufferlen~0_BEFORE_RETURN_3 1))) (and (= (ite (<= 0 main_~buf~0) 1 0) (ite (<= 0 v_main_~buf~0_36) 1 0)) (or (and (< v_main_~in~0_BEFORE_RETURN_2 .cse1) (<= v_main_~bufferlen~0_BEFORE_RETURN_3 v_main_~in~0_BEFORE_RETURN_2) (or (< v_main_~buflim~0_BEFORE_RETURN_2 1) (< v_main_~in~0_BEFORE_RETURN_2 (+ v_main_~buflim~0_BEFORE_RETURN_2 1))) (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36) (< 0 v_main_~in~0_BEFORE_RETURN_2) (not (= v_main_~buflim~0_BEFORE_RETURN_2 0))) (and (= v_main_~in~0_BEFORE_RETURN_2 0) (= v_main_~buf~0_36 0))) (<= .cse1 v_main_~inlen~0_BEFORE_RETURN_2) (not (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2)) (<= 3 v_main_~inlen~0_BEFORE_RETURN_2)))) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse0))) [2021-05-02 23:32:27,414 INFO L194 CegarLoopUtils]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (not (= main_~buf~0 main_~buflim~0)) (= main_~in~0 0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (< 0 (+ main_~buflim~0 1)) (= main_~buf~0 0) .cse0) (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (exists ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v_main_~inlen~0_BEFORE_RETURN_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_3 Int) (v_main_~buf~0_36 Int)) (let ((.cse1 (+ v_main_~bufferlen~0_BEFORE_RETURN_3 1))) (and (= (ite (<= 0 main_~buf~0) 1 0) (ite (<= 0 v_main_~buf~0_36) 1 0)) (or (and (< v_main_~in~0_BEFORE_RETURN_2 .cse1) (<= v_main_~bufferlen~0_BEFORE_RETURN_3 v_main_~in~0_BEFORE_RETURN_2) (or (< v_main_~buflim~0_BEFORE_RETURN_2 1) (< v_main_~in~0_BEFORE_RETURN_2 (+ v_main_~buflim~0_BEFORE_RETURN_2 1))) (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36) (< 0 v_main_~in~0_BEFORE_RETURN_2) (not (= v_main_~buflim~0_BEFORE_RETURN_2 0))) (and (= v_main_~in~0_BEFORE_RETURN_2 0) (= v_main_~buf~0_36 0))) (<= .cse1 v_main_~inlen~0_BEFORE_RETURN_2) (not (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2)) (<= 3 v_main_~inlen~0_BEFORE_RETURN_2)))) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse0))) [2021-05-02 23:32:27,415 INFO L194 CegarLoopUtils]: At program point L37-1(lines 37 48) the Hoare annotation is: (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 0 (+ |main_#t~nondet5| 2147483648)) (= main_~in~0 0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (< 0 (+ main_~buflim~0 1)) (<= |main_#t~nondet5| 2147483647) (= main_~buf~0 0) .cse0) (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (exists ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v_main_~inlen~0_BEFORE_RETURN_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_3 Int) (v_main_~buf~0_36 Int)) (let ((.cse1 (+ v_main_~bufferlen~0_BEFORE_RETURN_3 1))) (and (= (ite (<= 0 main_~buf~0) 1 0) (ite (<= 0 v_main_~buf~0_36) 1 0)) (or (and (< v_main_~in~0_BEFORE_RETURN_2 .cse1) (<= v_main_~bufferlen~0_BEFORE_RETURN_3 v_main_~in~0_BEFORE_RETURN_2) (or (< v_main_~buflim~0_BEFORE_RETURN_2 1) (< v_main_~in~0_BEFORE_RETURN_2 (+ v_main_~buflim~0_BEFORE_RETURN_2 1))) (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36) (< 0 v_main_~in~0_BEFORE_RETURN_2) (not (= v_main_~buflim~0_BEFORE_RETURN_2 0))) (and (= v_main_~in~0_BEFORE_RETURN_2 0) (= v_main_~buf~0_36 0))) (<= .cse1 v_main_~inlen~0_BEFORE_RETURN_2) (not (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2)) (<= 3 v_main_~inlen~0_BEFORE_RETURN_2)))) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse0))) [2021-05-02 23:32:27,415 INFO L194 CegarLoopUtils]: At program point L37-3(lines 37 48) the Hoare annotation is: (or (and (exists ((v_main_~buf~0_28 Int) (v_main_~buflim~0_BEFORE_RETURN_1 Int) (v_main_~inlen~0_BEFORE_RETURN_1 Int) (v_main_~bufferlen~0_BEFORE_RETURN_1 Int) (v_main_~in~0_BEFORE_RETURN_1 Int)) (let ((.cse0 (+ v_main_~buflim~0_BEFORE_RETURN_1 1))) (and (= (ite (<= 0 v_main_~buf~0_28) 1 0) (ite (<= 0 main_~buf~0) 1 0)) (<= (+ v_main_~buflim~0_BEFORE_RETURN_1 2) v_main_~bufferlen~0_BEFORE_RETURN_1) (< 0 .cse0) (or (let ((.cse1 (+ v_main_~in~0_BEFORE_RETURN_1 1))) (and (< v_main_~buf~0_28 .cse0) (<= v_main_~buf~0_28 .cse1) (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1) (< 0 v_main_~buf~0_28) (<= v_main_~inlen~0_BEFORE_RETURN_1 .cse1))) (= v_main_~buf~0_28 0)) (not (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1))))) (exists ((v_main_~buf~0_28 Int) (v_main_~buf~0_BEFORE_CALL_2 Int) (v_main_~buflim~0_BEFORE_RETURN_1 Int) (v_main_~inlen~0_BEFORE_RETURN_1 Int) (v_main_~bufferlen~0_BEFORE_CALL_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_1 Int) (v_main_~in~0_BEFORE_RETURN_1 Int)) (let ((.cse3 (+ v_main_~buflim~0_BEFORE_RETURN_1 1)) (.cse2 (ite (< v_main_~buf~0_BEFORE_CALL_2 v_main_~bufferlen~0_BEFORE_CALL_2) 1 0))) (and (not (= .cse2 0)) (= (ite (<= 0 v_main_~buf~0_28) 1 0) (ite (<= 0 v_main_~buf~0_BEFORE_CALL_2) 1 0)) (<= (+ v_main_~buflim~0_BEFORE_RETURN_1 2) v_main_~bufferlen~0_BEFORE_RETURN_1) (< 0 .cse3) (or (let ((.cse4 (+ v_main_~in~0_BEFORE_RETURN_1 1))) (and (< v_main_~buf~0_28 .cse3) (<= v_main_~buf~0_28 .cse4) (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1) (< 0 v_main_~buf~0_28) (<= v_main_~inlen~0_BEFORE_RETURN_1 .cse4))) (= v_main_~buf~0_28 0)) (not (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1)) (= (ite (< main_~in~0 main_~inlen~0) 1 0) .cse2)))) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0)) (and (= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2021-05-02 23:32:27,415 INFO L194 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2021-05-02 23:32:27,415 INFO L194 CegarLoopUtils]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (let ((.cse4 (<= 0 main_~buf~0))) (or (and .cse4 (<= 1 main_~in~0)) (and .cse4 (= main_~in~0 0)))))) (or (and (= main_~buf~0 0) (<= 2 main_~bufferlen~0) .cse0) (and (exists ((v_main_~buf~0_28 Int) (v_main_~buf~0_BEFORE_CALL_2 Int) (v_main_~buflim~0_BEFORE_RETURN_1 Int) (v_main_~inlen~0_BEFORE_RETURN_1 Int) (v_main_~bufferlen~0_BEFORE_CALL_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_1 Int) (v_main_~in~0_BEFORE_RETURN_1 Int)) (let ((.cse2 (+ v_main_~buflim~0_BEFORE_RETURN_1 1)) (.cse1 (ite (< v_main_~buf~0_BEFORE_CALL_2 v_main_~bufferlen~0_BEFORE_CALL_2) 1 0))) (and (not (= .cse1 0)) (= (ite (<= 0 v_main_~buf~0_28) 1 0) (ite (<= 0 v_main_~buf~0_BEFORE_CALL_2) 1 0)) (<= (+ v_main_~buflim~0_BEFORE_RETURN_1 2) v_main_~bufferlen~0_BEFORE_RETURN_1) (< 0 .cse2) (or (let ((.cse3 (+ v_main_~in~0_BEFORE_RETURN_1 1))) (and (< v_main_~buf~0_28 .cse2) (<= v_main_~buf~0_28 .cse3) (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1) (< 0 v_main_~buf~0_28) (<= v_main_~inlen~0_BEFORE_RETURN_1 .cse3))) (= v_main_~buf~0_28 0)) (not (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1)) (= (ite (< main_~in~0 main_~inlen~0) 1 0) .cse1)))) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) .cse0))) [2021-05-02 23:32:27,415 INFO L194 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~in~0 1) main_~inlen~0) (exists ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v_main_~inlen~0_BEFORE_RETURN_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_3 Int) (v_main_~buf~0_36 Int)) (let ((.cse0 (+ v_main_~bufferlen~0_BEFORE_RETURN_3 1))) (and (= (ite (<= 0 main_~buf~0) 1 0) (ite (<= 0 v_main_~buf~0_36) 1 0)) (or (and (< v_main_~in~0_BEFORE_RETURN_2 .cse0) (<= v_main_~bufferlen~0_BEFORE_RETURN_3 v_main_~in~0_BEFORE_RETURN_2) (or (< v_main_~buflim~0_BEFORE_RETURN_2 1) (< v_main_~in~0_BEFORE_RETURN_2 (+ v_main_~buflim~0_BEFORE_RETURN_2 1))) (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36) (< 0 v_main_~in~0_BEFORE_RETURN_2) (not (= v_main_~buflim~0_BEFORE_RETURN_2 0))) (and (= v_main_~in~0_BEFORE_RETURN_2 0) (= v_main_~buf~0_36 0))) (<= .cse0 v_main_~inlen~0_BEFORE_RETURN_2) (not (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2)) (<= 3 v_main_~inlen~0_BEFORE_RETURN_2)))) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 1 main_~in~0) (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2021-05-02 23:32:27,415 INFO L194 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ main_~in~0 1) main_~inlen~0) (exists ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v_main_~inlen~0_BEFORE_RETURN_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_3 Int) (v_main_~buf~0_36 Int)) (let ((.cse0 (+ v_main_~bufferlen~0_BEFORE_RETURN_3 1))) (and (= (ite (<= 0 main_~buf~0) 1 0) (ite (<= 0 v_main_~buf~0_36) 1 0)) (or (and (< v_main_~in~0_BEFORE_RETURN_2 .cse0) (<= v_main_~bufferlen~0_BEFORE_RETURN_3 v_main_~in~0_BEFORE_RETURN_2) (or (< v_main_~buflim~0_BEFORE_RETURN_2 1) (< v_main_~in~0_BEFORE_RETURN_2 (+ v_main_~buflim~0_BEFORE_RETURN_2 1))) (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36) (< 0 v_main_~in~0_BEFORE_RETURN_2) (not (= v_main_~buflim~0_BEFORE_RETURN_2 0))) (and (= v_main_~in~0_BEFORE_RETURN_2 0) (= v_main_~buf~0_36 0))) (<= .cse0 v_main_~inlen~0_BEFORE_RETURN_2) (not (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2)) (<= 3 v_main_~inlen~0_BEFORE_RETURN_2)))) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 1 main_~in~0) (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2021-05-02 23:32:27,415 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 24 56) the Hoare annotation is: true [2021-05-02 23:32:27,415 INFO L194 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (let ((.cse0 (<= 0 main_~buf~0))) (or (and .cse0 (<= 1 main_~in~0)) (and .cse0 (= main_~in~0 0))))) [2021-05-02 23:32:27,415 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2021-05-02 23:32:27,415 INFO L201 CegarLoopUtils]: At program point L55(lines 25 56) the Hoare annotation is: true [2021-05-02 23:32:27,416 INFO L194 CegarLoopUtils]: At program point L47(lines 37 48) the Hoare annotation is: (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (= main_~in~0 0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (< 0 (+ main_~buflim~0 1)) (= main_~buf~0 0) .cse0) (and (<= (+ main_~in~0 1) main_~inlen~0) (exists ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v_main_~inlen~0_BEFORE_RETURN_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_3 Int) (v_main_~buf~0_36 Int)) (let ((.cse1 (+ v_main_~bufferlen~0_BEFORE_RETURN_3 1))) (and (= (ite (<= 0 main_~buf~0) 1 0) (ite (<= 0 v_main_~buf~0_36) 1 0)) (or (and (< v_main_~in~0_BEFORE_RETURN_2 .cse1) (<= v_main_~bufferlen~0_BEFORE_RETURN_3 v_main_~in~0_BEFORE_RETURN_2) (or (< v_main_~buflim~0_BEFORE_RETURN_2 1) (< v_main_~in~0_BEFORE_RETURN_2 (+ v_main_~buflim~0_BEFORE_RETURN_2 1))) (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36) (< 0 v_main_~in~0_BEFORE_RETURN_2) (not (= v_main_~buflim~0_BEFORE_RETURN_2 0))) (and (= v_main_~in~0_BEFORE_RETURN_2 0) (= v_main_~buf~0_36 0))) (<= .cse1 v_main_~inlen~0_BEFORE_RETURN_2) (not (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2)) (<= 3 v_main_~inlen~0_BEFORE_RETURN_2)))) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 1 main_~in~0) (<= 2 main_~bufferlen~0) .cse0))) [2021-05-02 23:32:27,416 INFO L194 CegarLoopUtils]: At program point L39(lines 39 40) the Hoare annotation is: (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (= main_~in~0 0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (< 0 (+ main_~buflim~0 1)) (= main_~buf~0 0) .cse0) (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (exists ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v_main_~inlen~0_BEFORE_RETURN_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_3 Int) (v_main_~buf~0_36 Int)) (let ((.cse1 (+ v_main_~bufferlen~0_BEFORE_RETURN_3 1))) (and (= (ite (<= 0 main_~buf~0) 1 0) (ite (<= 0 v_main_~buf~0_36) 1 0)) (or (and (< v_main_~in~0_BEFORE_RETURN_2 .cse1) (<= v_main_~bufferlen~0_BEFORE_RETURN_3 v_main_~in~0_BEFORE_RETURN_2) (or (< v_main_~buflim~0_BEFORE_RETURN_2 1) (< v_main_~in~0_BEFORE_RETURN_2 (+ v_main_~buflim~0_BEFORE_RETURN_2 1))) (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36) (< 0 v_main_~in~0_BEFORE_RETURN_2) (not (= v_main_~buflim~0_BEFORE_RETURN_2 0))) (and (= v_main_~in~0_BEFORE_RETURN_2 0) (= v_main_~buf~0_36 0))) (<= .cse1 v_main_~inlen~0_BEFORE_RETURN_2) (not (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2)) (<= 3 v_main_~inlen~0_BEFORE_RETURN_2)))) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse0))) [2021-05-02 23:32:27,416 INFO L194 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or .cse0 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~bufferlen~0_BEFORE_CALL_5 Int) (v_main_~buf~0_BEFORE_CALL_5 Int)) (or (forall ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v_main_~inlen~0_BEFORE_RETURN_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_3 Int) (v_main_~buf~0_36 Int)) (let ((.cse1 (+ v_main_~bufferlen~0_BEFORE_RETURN_3 1))) (or (and (or (not (= v_main_~buf~0_36 0)) (not (= v_main_~in~0_BEFORE_RETURN_2 0))) (or (not (< v_main_~in~0_BEFORE_RETURN_2 .cse1)) (and (not (< v_main_~buflim~0_BEFORE_RETURN_2 1)) (not (< v_main_~in~0_BEFORE_RETURN_2 (+ v_main_~buflim~0_BEFORE_RETURN_2 1)))) (not (<= v_main_~bufferlen~0_BEFORE_RETURN_3 v_main_~in~0_BEFORE_RETURN_2)) (not (< 0 v_main_~in~0_BEFORE_RETURN_2)) (= v_main_~buflim~0_BEFORE_RETURN_2 0) (not (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36)))) (not (<= .cse1 v_main_~inlen~0_BEFORE_RETURN_2)) (not (= (ite (<= 0 v_main_~buf~0_BEFORE_CALL_5) 1 0) (ite (<= 0 v_main_~buf~0_36) 1 0))) (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2) (not (<= 3 v_main_~inlen~0_BEFORE_RETURN_2))))) (not (= (ite (< v_main_~buf~0_BEFORE_CALL_5 v_main_~bufferlen~0_BEFORE_CALL_5) 1 0) |__VERIFIER_assert_#in~cond|))))) (or .cse0 (not (= __VERIFIER_assert_~cond 0))))) [2021-05-02 23:32:27,416 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-02 23:32:27,416 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or .cse0 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~bufferlen~0_BEFORE_CALL_5 Int) (v_main_~buf~0_BEFORE_CALL_5 Int)) (or (forall ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v_main_~inlen~0_BEFORE_RETURN_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_3 Int) (v_main_~buf~0_36 Int)) (let ((.cse1 (+ v_main_~bufferlen~0_BEFORE_RETURN_3 1))) (or (and (or (not (= v_main_~buf~0_36 0)) (not (= v_main_~in~0_BEFORE_RETURN_2 0))) (or (not (< v_main_~in~0_BEFORE_RETURN_2 .cse1)) (and (not (< v_main_~buflim~0_BEFORE_RETURN_2 1)) (not (< v_main_~in~0_BEFORE_RETURN_2 (+ v_main_~buflim~0_BEFORE_RETURN_2 1)))) (not (<= v_main_~bufferlen~0_BEFORE_RETURN_3 v_main_~in~0_BEFORE_RETURN_2)) (not (< 0 v_main_~in~0_BEFORE_RETURN_2)) (= v_main_~buflim~0_BEFORE_RETURN_2 0) (not (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36)))) (not (<= .cse1 v_main_~inlen~0_BEFORE_RETURN_2)) (not (= (ite (<= 0 v_main_~buf~0_BEFORE_CALL_5) 1 0) (ite (<= 0 v_main_~buf~0_36) 1 0))) (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2) (not (<= 3 v_main_~inlen~0_BEFORE_RETURN_2))))) (not (= (ite (< v_main_~buf~0_BEFORE_CALL_5 v_main_~bufferlen~0_BEFORE_CALL_5) 1 0) |__VERIFIER_assert_#in~cond|))))) (or .cse0 (not (= __VERIFIER_assert_~cond 0))))) [2021-05-02 23:32:27,416 INFO L194 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:32:27,416 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:32:27,416 INFO L194 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or .cse0 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~bufferlen~0_BEFORE_CALL_5 Int) (v_main_~buf~0_BEFORE_CALL_5 Int)) (or (forall ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v_main_~inlen~0_BEFORE_RETURN_2 Int) (v_main_~bufferlen~0_BEFORE_RETURN_3 Int) (v_main_~buf~0_36 Int)) (let ((.cse1 (+ v_main_~bufferlen~0_BEFORE_RETURN_3 1))) (or (and (or (not (= v_main_~buf~0_36 0)) (not (= v_main_~in~0_BEFORE_RETURN_2 0))) (or (not (< v_main_~in~0_BEFORE_RETURN_2 .cse1)) (and (not (< v_main_~buflim~0_BEFORE_RETURN_2 1)) (not (< v_main_~in~0_BEFORE_RETURN_2 (+ v_main_~buflim~0_BEFORE_RETURN_2 1)))) (not (<= v_main_~bufferlen~0_BEFORE_RETURN_3 v_main_~in~0_BEFORE_RETURN_2)) (not (< 0 v_main_~in~0_BEFORE_RETURN_2)) (= v_main_~buflim~0_BEFORE_RETURN_2 0) (not (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36)))) (not (<= .cse1 v_main_~inlen~0_BEFORE_RETURN_2)) (not (= (ite (<= 0 v_main_~buf~0_BEFORE_CALL_5) 1 0) (ite (<= 0 v_main_~buf~0_36) 1 0))) (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2) (not (<= 3 v_main_~inlen~0_BEFORE_RETURN_2))))) (not (= (ite (< v_main_~buf~0_BEFORE_CALL_5 v_main_~bufferlen~0_BEFORE_CALL_5) 1 0) |__VERIFIER_assert_#in~cond|))))) (or .cse0 (not (= __VERIFIER_assert_~cond 0))))) [2021-05-02 23:32:27,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_5,QUANTIFIED] [2021-05-02 23:32:27,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_5,QUANTIFIED] [2021-05-02 23:32:27,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_CALL_5,QUANTIFIED] [2021-05-02 23:32:27,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:32:27 BoogieIcfgContainer [2021-05-02 23:32:27,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:32:27,438 INFO L168 Benchmark]: Toolchain (without parser) took 42656.67 ms. Allocated memory was 186.6 MB in the beginning and 273.7 MB in the end (delta: 87.0 MB). Free memory was 151.7 MB in the beginning and 241.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 142.4 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:27,439 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 186.6 MB. Free memory is still 168.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:32:27,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.21 ms. Allocated memory is still 186.6 MB. Free memory was 151.5 MB in the beginning and 169.3 MB in the end (delta: -17.8 MB). Peak memory consumption was 11.9 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:27,439 INFO L168 Benchmark]: Boogie Preprocessor took 22.55 ms. Allocated memory is still 186.6 MB. Free memory was 169.3 MB in the beginning and 167.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:27,439 INFO L168 Benchmark]: RCFGBuilder took 227.83 ms. Allocated memory is still 186.6 MB. Free memory was 167.9 MB in the beginning and 151.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:27,439 INFO L168 Benchmark]: TraceAbstraction took 42238.47 ms. Allocated memory was 186.6 MB in the beginning and 273.7 MB in the end (delta: 87.0 MB). Free memory was 151.5 MB in the beginning and 241.0 MB in the end (delta: -89.5 MB). Peak memory consumption was 142.1 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:27,439 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 186.6 MB. Free memory is still 168.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 164.21 ms. Allocated memory is still 186.6 MB. Free memory was 151.5 MB in the beginning and 169.3 MB in the end (delta: -17.8 MB). Peak memory consumption was 11.9 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 22.55 ms. Allocated memory is still 186.6 MB. Free memory was 169.3 MB in the beginning and 167.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 227.83 ms. Allocated memory is still 186.6 MB. Free memory was 167.9 MB in the beginning and 151.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 42238.47 ms. Allocated memory was 186.6 MB in the beginning and 273.7 MB in the end (delta: 87.0 MB). Free memory was 151.5 MB in the beginning and 241.0 MB in the end (delta: -89.5 MB). Peak memory consumption was 142.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_CALL_5,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 22517.0ms, OverallIterations: 8, TraceHistogramMax: 8, EmptinessCheckTime: 13.9ms, AutomataDifference: 17825.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 19635.1ms, InitialAbstractionConstructionTime: 7.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 218 SDtfs, 509 SDslu, 433 SDs, 0 SdLazy, 1219 SolverSat, 553 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5553.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 14256.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=6, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 107.1ms AutomataMinimizationTime, 8 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 36 LocationsWithAnnotation, 198 PreInvPairs, 287 NumberOfFragments, 1701 HoareAnnotationTreeSize, 198 FomulaSimplifications, 3429 FormulaSimplificationTreeSizeReduction, 300.2ms HoareSimplificationTime, 36 FomulaSimplificationsInter, 12294 FormulaSimplificationTreeSizeReductionInter, 19293.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant [2021-05-02 23:32:27,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] Derived loop invariant: ((((in == 0 && buflim + 2 <= bufferlen) && 0 < buflim + 1) && buf == 0) && bufferlen + 1 <= inlen) || (((((in + 1 <= inlen && (\exists v_main_~buflim~0_BEFORE_RETURN_2 : int, v_main_~in~0_BEFORE_RETURN_2 : int, v_main_~inlen~0_BEFORE_RETURN_2 : int, v_main_~bufferlen~0_BEFORE_RETURN_3 : int, v_main_~buf~0_36 : int :: ((((if 0 <= buf then 1 else 0) == (if 0 <= v_main_~buf~0_36 then 1 else 0) && ((((((v_main_~in~0_BEFORE_RETURN_2 < v_main_~bufferlen~0_BEFORE_RETURN_3 + 1 && v_main_~bufferlen~0_BEFORE_RETURN_3 <= v_main_~in~0_BEFORE_RETURN_2) && (v_main_~buflim~0_BEFORE_RETURN_2 < 1 || v_main_~in~0_BEFORE_RETURN_2 < v_main_~buflim~0_BEFORE_RETURN_2 + 1)) && v_main_~in~0_BEFORE_RETURN_2 == v_main_~buf~0_36) && 0 < v_main_~in~0_BEFORE_RETURN_2) && !(v_main_~buflim~0_BEFORE_RETURN_2 == 0)) || (v_main_~in~0_BEFORE_RETURN_2 == 0 && v_main_~buf~0_36 == 0))) && v_main_~bufferlen~0_BEFORE_RETURN_3 + 1 <= v_main_~inlen~0_BEFORE_RETURN_2) && !(v_main_~buf~0_36 == v_main_~buflim~0_BEFORE_RETURN_2)) && 3 <= v_main_~inlen~0_BEFORE_RETURN_2)) && buf + 1 <= bufferlen) && 1 <= in) && 2 <= bufferlen) && bufferlen + 1 <= inlen) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert [2021-05-02 23:32:27,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_5,QUANTIFIED] [2021-05-02 23:32:27,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_5,QUANTIFIED] [2021-05-02 23:32:27,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_CALL_5,QUANTIFIED] [2021-05-02 23:32:27,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-02 23:32:27,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_5,QUANTIFIED] [2021-05-02 23:32:27,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-02 23:32:27,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-02 23:32:27,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_5,QUANTIFIED] [2021-05-02 23:32:27,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_CALL_5,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: ((\old(cond) == 0 || \old(cond) == cond) || (forall v_main_~bufferlen~0_BEFORE_CALL_5 : int, v_main_~buf~0_BEFORE_CALL_5 : int :: (forall v_main_~buflim~0_BEFORE_RETURN_2 : int, v_main_~in~0_BEFORE_RETURN_2 : int, v_main_~inlen~0_BEFORE_RETURN_2 : int, v_main_~bufferlen~0_BEFORE_RETURN_3 : int, v_main_~buf~0_36 : int :: (((((!(v_main_~buf~0_36 == 0) || !(v_main_~in~0_BEFORE_RETURN_2 == 0)) && (((((!(v_main_~in~0_BEFORE_RETURN_2 < v_main_~bufferlen~0_BEFORE_RETURN_3 + 1) || (!(v_main_~buflim~0_BEFORE_RETURN_2 < 1) && !(v_main_~in~0_BEFORE_RETURN_2 < v_main_~buflim~0_BEFORE_RETURN_2 + 1))) || !(v_main_~bufferlen~0_BEFORE_RETURN_3 <= v_main_~in~0_BEFORE_RETURN_2)) || !(0 < v_main_~in~0_BEFORE_RETURN_2)) || v_main_~buflim~0_BEFORE_RETURN_2 == 0) || !(v_main_~in~0_BEFORE_RETURN_2 == v_main_~buf~0_36))) || !(v_main_~bufferlen~0_BEFORE_RETURN_3 + 1 <= v_main_~inlen~0_BEFORE_RETURN_2)) || !((if 0 <= v_main_~buf~0_BEFORE_CALL_5 then 1 else 0) == (if 0 <= v_main_~buf~0_36 then 1 else 0))) || v_main_~buf~0_36 == v_main_~buflim~0_BEFORE_RETURN_2) || !(3 <= v_main_~inlen~0_BEFORE_RETURN_2)) || !((if v_main_~buf~0_BEFORE_CALL_5 < v_main_~bufferlen~0_BEFORE_CALL_5 then 1 else 0) == \old(cond)))) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! Received shutdown request...