/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-6253b08 [2021-05-06 11:35:22,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 11:35:22,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 11:35:22,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 11:35:22,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 11:35:22,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 11:35:22,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 11:35:22,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 11:35:22,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 11:35:22,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 11:35:22,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 11:35:22,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 11:35:22,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 11:35:22,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 11:35:22,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 11:35:22,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 11:35:22,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 11:35:22,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 11:35:22,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 11:35:22,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 11:35:22,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 11:35:22,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 11:35:22,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 11:35:22,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 11:35:22,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 11:35:22,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 11:35:22,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 11:35:22,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 11:35:22,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 11:35:22,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 11:35:22,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 11:35:22,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 11:35:22,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 11:35:22,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 11:35:22,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 11:35:22,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 11:35:22,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 11:35:22,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 11:35:22,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 11:35:22,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 11:35:22,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 11:35:22,614 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-06 11:35:22,626 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 11:35:22,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 11:35:22,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 11:35:22,628 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 11:35:22,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 11:35:22,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 11:35:22,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 11:35:22,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 11:35:22,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 11:35:22,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 11:35:22,629 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 11:35:22,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 11:35:22,629 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 11:35:22,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 11:35:22,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 11:35:22,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 11:35:22,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 11:35:22,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 11:35:22,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 11:35:22,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 11:35:22,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 11:35:22,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 11:35:22,631 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 11:35:22,631 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-06 11:35:22,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 11:35:22,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 11:35:22,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 11:35:22,866 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 11:35:22,866 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 11:35:22,867 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-06 11:35:22,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b0ce20a2/afb693af7b35417da8dc7eb567c5dc2a/FLAGd6e4e2ede [2021-05-06 11:35:23,228 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 11:35:23,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2021-05-06 11:35:23,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b0ce20a2/afb693af7b35417da8dc7eb567c5dc2a/FLAGd6e4e2ede [2021-05-06 11:35:23,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b0ce20a2/afb693af7b35417da8dc7eb567c5dc2a [2021-05-06 11:35:23,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 11:35:23,663 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 11:35:23,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 11:35:23,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 11:35:23,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 11:35:23,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:35:23" (1/1) ... [2021-05-06 11:35:23,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d21b304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:35:23, skipping insertion in model container [2021-05-06 11:35:23,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:35:23" (1/1) ... [2021-05-06 11:35:23,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 11:35:23,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 11:35:23,782 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-06 11:35:23,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:35:23,836 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 11:35:23,846 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-06 11:35:23,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:35:23,869 INFO L208 MainTranslator]: Completed translation [2021-05-06 11:35:23,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:35:23 WrapperNode [2021-05-06 11:35:23,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 11:35:23,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 11:35:23,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 11:35:23,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 11:35:23,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:35:23" (1/1) ... [2021-05-06 11:35:23,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:35:23" (1/1) ... [2021-05-06 11:35:23,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:35:23" (1/1) ... [2021-05-06 11:35:23,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:35:23" (1/1) ... [2021-05-06 11:35:23,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:35:23" (1/1) ... [2021-05-06 11:35:23,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:35:23" (1/1) ... [2021-05-06 11:35:23,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:35:23" (1/1) ... [2021-05-06 11:35:23,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 11:35:23,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 11:35:23,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 11:35:23,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 11:35:23,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:35:23" (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-06 11:35:23,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 11:35:23,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 11:35:23,964 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 11:35:23,964 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 11:35:23,964 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-06 11:35:23,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 11:35:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 11:35:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 11:35:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-06 11:35:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-06 11:35:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 11:35:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 11:35:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 11:35:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 11:35:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 11:35:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 11:35:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 11:35:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 11:35:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 11:35:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 11:35:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 11:35:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 11:35:24,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 11:35:24,202 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-06 11:35:24,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:35:24 BoogieIcfgContainer [2021-05-06 11:35:24,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 11:35:24,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 11:35:24,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 11:35:24,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 11:35:24,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:35:23" (1/3) ... [2021-05-06 11:35:24,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a021da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:35:24, skipping insertion in model container [2021-05-06 11:35:24,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:35:23" (2/3) ... [2021-05-06 11:35:24,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a021da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:35:24, skipping insertion in model container [2021-05-06 11:35:24,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:35:24" (3/3) ... [2021-05-06 11:35:24,208 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2021-05-06 11:35:24,229 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 11:35:24,232 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 11:35:24,242 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 11:35:24,254 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 11:35:24,254 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 11:35:24,254 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 11:35:24,254 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 11:35:24,254 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 11:35:24,254 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 11:35:24,254 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 11:35:24,255 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 11:35:24,263 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-06 11:35:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-06 11:35:24,268 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:35:24,268 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:35:24,269 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:35:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:35:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1361038294, now seen corresponding path program 1 times [2021-05-06 11:35:24,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:35:24,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [379095775] [2021-05-06 11:35:24,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:35:24,315 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:35:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:24,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:35:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:24,402 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-06 11:35:24,403 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:35:24,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [379095775] [2021-05-06 11:35:24,404 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [379095775] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:35:24,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:35:24,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-06 11:35:24,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097926849] [2021-05-06 11:35:24,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-06 11:35:24,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:35:24,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-06 11:35:24,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-06 11:35:24,417 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-06 11:35:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:24,494 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2021-05-06 11:35:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-06 11:35:24,495 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-06 11:35:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:24,500 INFO L225 Difference]: With dead ends: 62 [2021-05-06 11:35:24,500 INFO L226 Difference]: Without dead ends: 30 [2021-05-06 11:35:24,503 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-06 11:35:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-05-06 11:35:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-05-06 11:35:24,547 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-06 11:35:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-05-06 11:35:24,549 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2021-05-06 11:35:24,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:24,549 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-05-06 11:35:24,550 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-06 11:35:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2021-05-06 11:35:24,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-06 11:35:24,551 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:35:24,552 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:35:24,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 11:35:24,552 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:35:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:35:24,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1347976123, now seen corresponding path program 1 times [2021-05-06 11:35:24,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:35:24,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1589695519] [2021-05-06 11:35:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:35:24,560 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:35:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:24,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:35:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:24,715 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-06 11:35:24,716 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:35:24,716 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1589695519] [2021-05-06 11:35:24,716 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1589695519] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:35:24,716 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:35:24,716 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:35:24,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246639225] [2021-05-06 11:35:24,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:35:24,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:35:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:35:24,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:35:24,718 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-06 11:35:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:24,946 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2021-05-06 11:35:24,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:35:24,946 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-06 11:35:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:24,947 INFO L225 Difference]: With dead ends: 36 [2021-05-06 11:35:24,947 INFO L226 Difference]: Without dead ends: 34 [2021-05-06 11:35:24,949 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 138.8ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:35:24,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-05-06 11:35:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-05-06 11:35:24,966 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-06 11:35:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-05-06 11:35:24,969 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2021-05-06 11:35:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:24,970 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-05-06 11:35:24,970 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-06 11:35:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2021-05-06 11:35:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-06 11:35:24,972 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:35:24,972 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-06 11:35:24,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 11:35:24,972 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:35:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:35:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash -863391162, now seen corresponding path program 1 times [2021-05-06 11:35:24,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:35:24,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [310206018] [2021-05-06 11:35:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:35:24,978 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:35:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:25,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:35:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:25,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 11:35:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:25,094 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-06 11:35:25,094 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:35:25,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [310206018] [2021-05-06 11:35:25,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [310206018] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:35:25,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:35:25,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:35:25,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722114328] [2021-05-06 11:35:25,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:35:25,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:35:25,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:35:25,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:35:25,096 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-06 11:35:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:25,346 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2021-05-06 11:35:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:35:25,346 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-06 11:35:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:25,347 INFO L225 Difference]: With dead ends: 49 [2021-05-06 11:35:25,347 INFO L226 Difference]: Without dead ends: 47 [2021-05-06 11:35:25,348 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 133.2ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-06 11:35:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-06 11:35:25,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-05-06 11:35:25,354 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-06 11:35:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2021-05-06 11:35:25,355 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2021-05-06 11:35:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:25,355 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2021-05-06 11:35:25,355 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-06 11:35:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2021-05-06 11:35:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-06 11:35:25,356 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:35:25,356 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-06 11:35:25,356 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 11:35:25,356 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:35:25,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:35:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1742477006, now seen corresponding path program 1 times [2021-05-06 11:35:25,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:35:25,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1781461963] [2021-05-06 11:35:25,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:35:25,358 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:35:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:25,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:35:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:25,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-06 11:35:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:25,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 11:35:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:25,428 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-06 11:35:25,428 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:35:25,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1781461963] [2021-05-06 11:35:25,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1781461963] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:35:25,429 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:35:25,429 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:35:25,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766963028] [2021-05-06 11:35:25,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:35:25,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:35:25,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:35:25,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:35:25,430 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-06 11:35:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:25,680 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2021-05-06 11:35:25,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:35:25,680 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-06 11:35:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:25,681 INFO L225 Difference]: With dead ends: 56 [2021-05-06 11:35:25,681 INFO L226 Difference]: Without dead ends: 54 [2021-05-06 11:35:25,681 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 109.0ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-05-06 11:35:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-05-06 11:35:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2021-05-06 11:35:25,689 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-06 11:35:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2021-05-06 11:35:25,690 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 29 [2021-05-06 11:35:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:25,690 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2021-05-06 11:35:25,691 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-06 11:35:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2021-05-06 11:35:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-06 11:35:25,691 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:35:25,691 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-06 11:35:25,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 11:35:25,692 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:35:25,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:35:25,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1571308956, now seen corresponding path program 1 times [2021-05-06 11:35:25,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:35:25,692 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1160229429] [2021-05-06 11:35:25,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:35:25,694 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:35:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:25,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:35:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:25,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 11:35:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:25,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 11:35:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:25,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-05-06 11:35:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:25,772 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-06 11:35:25,772 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:35:25,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1160229429] [2021-05-06 11:35:25,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1160229429] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:35:25,773 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:35:25,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-06 11:35:25,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5797935] [2021-05-06 11:35:25,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-06 11:35:25,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:35:25,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-06 11:35:25,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-05-06 11:35:25,774 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-06 11:35:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:26,075 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2021-05-06 11:35:26,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 11:35:26,075 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-06 11:35:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:26,076 INFO L225 Difference]: With dead ends: 75 [2021-05-06 11:35:26,076 INFO L226 Difference]: Without dead ends: 68 [2021-05-06 11:35:26,077 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 129.6ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-05-06 11:35:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-06 11:35:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2021-05-06 11:35:26,085 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-06 11:35:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2021-05-06 11:35:26,086 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2021-05-06 11:35:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:26,086 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2021-05-06 11:35:26,086 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-06 11:35:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2021-05-06 11:35:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-06 11:35:26,087 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:35:26,087 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-06 11:35:26,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 11:35:26,087 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:35:26,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:35:26,088 INFO L82 PathProgramCache]: Analyzing trace with hash 173943289, now seen corresponding path program 1 times [2021-05-06 11:35:26,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:35:26,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [666996023] [2021-05-06 11:35:26,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:35:26,089 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:35:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:26,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:35:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:26,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-06 11:35:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:26,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 11:35:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:26,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-06 11:35:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:26,167 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-06 11:35:26,167 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:35:26,168 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [666996023] [2021-05-06 11:35:26,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [666996023] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:35:26,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:35:26,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-06 11:35:26,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370353970] [2021-05-06 11:35:26,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 11:35:26,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:35:26,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 11:35:26,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:35:26,170 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-06 11:35:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:26,484 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2021-05-06 11:35:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 11:35:26,484 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-06 11:35:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:26,485 INFO L225 Difference]: With dead ends: 77 [2021-05-06 11:35:26,485 INFO L226 Difference]: Without dead ends: 75 [2021-05-06 11:35:26,486 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 146.3ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-05-06 11:35:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-06 11:35:26,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2021-05-06 11:35:26,494 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-06 11:35:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2021-05-06 11:35:26,494 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2021-05-06 11:35:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:26,495 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2021-05-06 11:35:26,495 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-06 11:35:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2021-05-06 11:35:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-06 11:35:26,496 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:35:26,496 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-06 11:35:26,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 11:35:26,496 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:35:26,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:35:26,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1755534668, now seen corresponding path program 1 times [2021-05-06 11:35:26,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:35:26,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [861196328] [2021-05-06 11:35:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:35:26,545 WARN L240 tifierPushTermWalker]: treesize reduction 17, result has 89.8 percent of original size [2021-05-06 11:35:26,596 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:35:26,598 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:35:26,621 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-05-06 11:35:26,628 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:35:26,652 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-05-06 11:35:26,663 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-05-06 11:35:26,705 WARN L245 tifierPushTermWalker]: treesize reduction 17, result has 89.8 percent of original size 150 [2021-05-06 11:35:26,745 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2021-05-06 11:35:26,751 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-06 11:35:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:26,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:35:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:26,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-06 11:35:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:26,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 11:35:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:26,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 11:35:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:26,852 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-06 11:35:26,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:26,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:26,982 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,000 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,021 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,047 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,068 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,076 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,110 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,153 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,361 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,366 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,395 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,397 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,436 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,438 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,449 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,454 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,510 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,511 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,780 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,820 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,838 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,841 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,868 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,869 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,967 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,968 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,970 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,971 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:27,977 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:28,022 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:35:28,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [861196328] [2021-05-06 11:35:28,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [861196328] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:35:28,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:35:28,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-06 11:35:28,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339714661] [2021-05-06 11:35:28,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-06 11:35:28,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:35:28,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-06 11:35:28,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2021-05-06 11:35:28,024 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 23 states, 20 states have (on average 1.5) internal successors, (30), 15 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-06 11:35:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:35,508 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2021-05-06 11:35:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-06 11:35:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.5) internal successors, (30), 15 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-06 11:35:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:35,510 INFO L225 Difference]: With dead ends: 74 [2021-05-06 11:35:35,511 INFO L226 Difference]: Without dead ends: 65 [2021-05-06 11:35:35,511 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 5794.9ms TimeCoverageRelationStatistics Valid=283, Invalid=1353, Unknown=4, NotChecked=0, Total=1640 [2021-05-06 11:35:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-06 11:35:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-05-06 11:35:35,522 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-06 11:35:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2021-05-06 11:35:35,522 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 57 [2021-05-06 11:35:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:35,523 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2021-05-06 11:35:35,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 20 states have (on average 1.5) internal successors, (30), 15 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-06 11:35:35,523 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2021-05-06 11:35:35,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-06 11:35:35,523 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:35:35,524 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-06 11:35:35,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-06 11:35:35,524 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:35:35,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:35:35,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1121193385, now seen corresponding path program 1 times [2021-05-06 11:35:35,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:35:35,524 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [281980772] [2021-05-06 11:35:35,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:35:35,541 WARN L240 tifierPushTermWalker]: treesize reduction 17, result has 89.8 percent of original size [2021-05-06 11:35:35,581 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:35:35,584 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:35:35,606 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-05-06 11:35:35,608 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:35:35,629 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-05-06 11:35:35,639 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-05-06 11:35:35,674 WARN L245 tifierPushTermWalker]: treesize reduction 17, result has 89.8 percent of original size 150 [2021-05-06 11:35:35,712 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2021-05-06 11:35:35,719 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-06 11:35:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:35,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:35:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:35,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-05-06 11:35:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:35,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-05-06 11:35:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:35,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-05-06 11:35:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:35:35,842 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-06 11:35:35,846 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:35,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,011 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,063 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,094 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,175 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,176 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,215 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,363 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,366 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,373 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,375 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,427 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,428 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,456 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,502 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,591 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,592 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,655 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,655 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,679 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,680 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,684 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,688 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,689 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,692 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:36,696 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:35:37,284 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:35:37,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [281980772] [2021-05-06 11:35:37,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [281980772] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:35:37,284 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:35:37,285 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-06 11:35:37,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754975394] [2021-05-06 11:35:37,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-06 11:35:37,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:35:37,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-06 11:35:37,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2021-05-06 11:35:37,286 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 26 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 19 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-06 11:35:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:35:38,442 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2021-05-06 11:35:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-06 11:35:38,443 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 19 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-06 11:35:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:35:38,443 INFO L225 Difference]: With dead ends: 65 [2021-05-06 11:35:38,443 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 11:35:38,444 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 2168.8ms TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2021-05-06 11:35:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 11:35:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 11:35:38,444 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-06 11:35:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 11:35:38,444 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2021-05-06 11:35:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:35:38,445 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 11:35:38,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 19 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-06 11:35:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 11:35:38,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 11:35:38,445 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-06 11:35:38,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-06 11:35:38,959 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 53 [2021-05-06 11:35:39,096 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 57 [2021-05-06 11:35:39,389 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 53 [2021-05-06 11:35:39,879 WARN L205 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 53 [2021-05-06 11:35:40,033 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 21 [2021-05-06 11:35:40,193 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 22 [2021-05-06 11:35:40,307 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2021-05-06 11:35:40,560 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 63 [2021-05-06 11:35:40,718 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 57 [2021-05-06 11:35:40,824 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2021-05-06 11:35:40,984 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 59 [2021-05-06 11:35:41,247 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 59 [2021-05-06 11:35:41,334 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-06 11:35:41,334 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-06 11:35:41,334 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-06 11:35:41,334 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:35:41,335 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-06 11:35:41,335 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:35:41,335 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:35:41,335 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-06 11:35:41,335 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-06 11:35:41,335 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:35:41,335 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-06 11:35:41,335 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-06 11:35:41,335 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-06 11:35:41,335 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-06 11:35:41,335 INFO L201 CegarLoopUtils]: At program point L31(line 31) the Hoare annotation is: true [2021-05-06 11:35:41,335 INFO L194 CegarLoopUtils]: At program point L31-1(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2021-05-06 11:35:41,335 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 24 56) the Hoare annotation is: true [2021-05-06 11:35:41,335 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-06 11:35:41,335 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-06 11:35:41,335 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 (<= 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) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2021-05-06 11:35:41,336 INFO L194 CegarLoopUtils]: At program point L32(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2021-05-06 11:35:41,336 INFO L201 CegarLoopUtils]: At program point L53(line 53) the Hoare annotation is: true [2021-05-06 11:35:41,336 INFO L194 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: (or (and (<= 3 main_~inlen~0) (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) (not (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1)) (or (and (< v_main_~buf~0_28 .cse0) (<= v_main_~buf~0_28 (+ v_main_~in~0_BEFORE_RETURN_1 1)) (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1) (< 0 v_main_~buf~0_28)) (= v_main_~buf~0_28 0))))) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (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) (not (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1)) (or (and (< v_main_~buf~0_28 .cse2) (<= v_main_~buf~0_28 (+ v_main_~in~0_BEFORE_RETURN_1 1)) (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1) (< 0 v_main_~buf~0_28)) (= v_main_~buf~0_28 0)) (= (ite (< main_~in~0 main_~inlen~0) 1 0) .cse1))))) (and (= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2021-05-06 11:35:41,336 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) (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-06 11:35:41,336 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) (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-06 11:35:41,336 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) (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-06 11:35:41,336 INFO L194 CegarLoopUtils]: At program point L37-3(lines 37 48) the Hoare annotation is: (or (and (<= 3 main_~inlen~0) (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) (not (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1)) (or (and (< v_main_~buf~0_28 .cse0) (<= v_main_~buf~0_28 (+ v_main_~in~0_BEFORE_RETURN_1 1)) (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1) (< 0 v_main_~buf~0_28)) (= v_main_~buf~0_28 0))))) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (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) (not (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1)) (or (and (< v_main_~buf~0_28 .cse2) (<= v_main_~buf~0_28 (+ v_main_~in~0_BEFORE_RETURN_1 1)) (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1) (< 0 v_main_~buf~0_28)) (= v_main_~buf~0_28 0)) (= (ite (< main_~in~0 main_~inlen~0) 1 0) .cse1))))) (and (= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2021-05-06 11:35:41,336 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-06 11:35:41,337 INFO L194 CegarLoopUtils]: At program point L50(line 50) the Hoare annotation is: (let ((.cse2 (let ((.cse3 (<= 0 main_~buf~0))) (or (and .cse3 (<= 1 main_~in~0)) (and .cse3 (= main_~in~0 0)))))) (or (and (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (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 ((.cse1 (+ v_main_~buflim~0_BEFORE_RETURN_1 1)) (.cse0 (ite (< v_main_~buf~0_BEFORE_CALL_2 v_main_~bufferlen~0_BEFORE_CALL_2) 1 0))) (and (not (= .cse0 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 .cse1) (not (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1)) (or (and (< v_main_~buf~0_28 .cse1) (<= v_main_~buf~0_28 (+ v_main_~in~0_BEFORE_RETURN_1 1)) (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1) (< 0 v_main_~buf~0_28)) (= v_main_~buf~0_28 0)) (= (ite (< main_~in~0 main_~inlen~0) 1 0) .cse0)))) .cse2) (and (= main_~buf~0 0) (<= 2 main_~bufferlen~0) .cse2))) [2021-05-06 11:35:41,337 INFO L194 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (and (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) (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_~in~0 1) main_~inlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 1 main_~in~0) (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2021-05-06 11:35:41,337 INFO L194 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: (and (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) (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_~in~0 1) main_~inlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 1 main_~in~0) (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2021-05-06 11:35:41,337 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 24 56) the Hoare annotation is: true [2021-05-06 11:35:41,337 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-06 11:35:41,337 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2021-05-06 11:35:41,337 INFO L201 CegarLoopUtils]: At program point L55(lines 25 56) the Hoare annotation is: true [2021-05-06 11:35:41,337 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 (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) (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_~in~0 1) main_~inlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 1 main_~in~0) (<= 2 main_~bufferlen~0) .cse0))) [2021-05-06 11:35:41,337 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) (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-06 11:35:41,337 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 (not (= __VERIFIER_assert_~cond 0))) (or .cse0 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~buf~0_BEFORE_CALL_2 Int) (v_main_~bufferlen~0_BEFORE_CALL_2 Int)) (or (not (= |__VERIFIER_assert_#in~cond| (ite (< v_main_~buf~0_BEFORE_CALL_2 v_main_~bufferlen~0_BEFORE_CALL_2) 1 0))) (forall ((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 ((.cse1 (+ v_main_~buflim~0_BEFORE_RETURN_1 1))) (or (not (= (ite (<= 0 v_main_~buf~0_28) 1 0) (ite (<= 0 v_main_~buf~0_BEFORE_CALL_2) 1 0))) (and (not (= v_main_~buf~0_28 0)) (or (not (< v_main_~buf~0_28 .cse1)) (not (<= v_main_~buf~0_28 (+ v_main_~in~0_BEFORE_RETURN_1 1))) (not (< 0 v_main_~buf~0_28)) (not (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1)))) (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1) (not (<= (+ v_main_~buflim~0_BEFORE_RETURN_1 2) v_main_~bufferlen~0_BEFORE_RETURN_1)) (not (< 0 .cse1)))))))))) [2021-05-06 11:35:41,338 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-06 11:35:41,338 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 (not (= __VERIFIER_assert_~cond 0))) (or .cse0 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~buf~0_BEFORE_CALL_2 Int) (v_main_~bufferlen~0_BEFORE_CALL_2 Int)) (or (not (= |__VERIFIER_assert_#in~cond| (ite (< v_main_~buf~0_BEFORE_CALL_2 v_main_~bufferlen~0_BEFORE_CALL_2) 1 0))) (forall ((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 ((.cse1 (+ v_main_~buflim~0_BEFORE_RETURN_1 1))) (or (not (= (ite (<= 0 v_main_~buf~0_28) 1 0) (ite (<= 0 v_main_~buf~0_BEFORE_CALL_2) 1 0))) (and (not (= v_main_~buf~0_28 0)) (or (not (< v_main_~buf~0_28 .cse1)) (not (<= v_main_~buf~0_28 (+ v_main_~in~0_BEFORE_RETURN_1 1))) (not (< 0 v_main_~buf~0_28)) (not (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1)))) (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1) (not (<= (+ v_main_~buflim~0_BEFORE_RETURN_1 2) v_main_~bufferlen~0_BEFORE_RETURN_1)) (not (< 0 .cse1)))))))))) [2021-05-06 11:35:41,338 INFO L194 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-06 11:35:41,338 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-06 11:35:41,338 INFO L194 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or .cse0 (not (= __VERIFIER_assert_~cond 0))) (or .cse0 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~buf~0_BEFORE_CALL_2 Int) (v_main_~bufferlen~0_BEFORE_CALL_2 Int)) (or (not (= |__VERIFIER_assert_#in~cond| (ite (< v_main_~buf~0_BEFORE_CALL_2 v_main_~bufferlen~0_BEFORE_CALL_2) 1 0))) (forall ((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 ((.cse1 (+ v_main_~buflim~0_BEFORE_RETURN_1 1))) (or (not (= (ite (<= 0 v_main_~buf~0_28) 1 0) (ite (<= 0 v_main_~buf~0_BEFORE_CALL_2) 1 0))) (and (not (= v_main_~buf~0_28 0)) (or (not (< v_main_~buf~0_28 .cse1)) (not (<= v_main_~buf~0_28 (+ v_main_~in~0_BEFORE_RETURN_1 1))) (not (< 0 v_main_~buf~0_28)) (not (< v_main_~in~0_BEFORE_RETURN_1 v_main_~inlen~0_BEFORE_RETURN_1)))) (= v_main_~buf~0_28 v_main_~buflim~0_BEFORE_RETURN_1) (not (<= (+ v_main_~buflim~0_BEFORE_RETURN_1 2) v_main_~bufferlen~0_BEFORE_RETURN_1)) (not (< 0 .cse1)))))))))) [2021-05-06 11:35:41,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-06 11:35:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-06 11:35:41,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-06 11:35:41,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-06 11:35:41,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-06 11:35:41,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-06 11:35:41,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-06 11:35:41,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:35:41 BoogieIcfgContainer [2021-05-06 11:35:41,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 11:35:41,371 INFO L168 Benchmark]: Toolchain (without parser) took 17708.27 ms. Allocated memory was 199.2 MB in the beginning and 287.3 MB in the end (delta: 88.1 MB). Free memory was 163.3 MB in the beginning and 268.2 MB in the end (delta: -104.9 MB). Peak memory consumption was 149.6 MB. Max. memory is 8.0 GB. [2021-05-06 11:35:41,371 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 199.2 MB. Free memory is still 179.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 11:35:41,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.56 ms. Allocated memory is still 199.2 MB. Free memory was 163.1 MB in the beginning and 181.2 MB in the end (delta: -18.1 MB). Peak memory consumption was 10.7 MB. Max. memory is 8.0 GB. [2021-05-06 11:35:41,371 INFO L168 Benchmark]: Boogie Preprocessor took 37.32 ms. Allocated memory is still 199.2 MB. Free memory was 181.2 MB in the beginning and 179.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 11:35:41,371 INFO L168 Benchmark]: RCFGBuilder took 295.47 ms. Allocated memory is still 199.2 MB. Free memory was 179.7 MB in the beginning and 161.8 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2021-05-06 11:35:41,372 INFO L168 Benchmark]: TraceAbstraction took 17166.56 ms. Allocated memory was 199.2 MB in the beginning and 287.3 MB in the end (delta: 88.1 MB). Free memory was 161.3 MB in the beginning and 268.2 MB in the end (delta: -106.9 MB). Peak memory consumption was 148.4 MB. Max. memory is 8.0 GB. [2021-05-06 11:35:41,372 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.11 ms. Allocated memory is still 199.2 MB. Free memory is still 179.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 203.56 ms. Allocated memory is still 199.2 MB. Free memory was 163.1 MB in the beginning and 181.2 MB in the end (delta: -18.1 MB). Peak memory consumption was 10.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 37.32 ms. Allocated memory is still 199.2 MB. Free memory was 181.2 MB in the beginning and 179.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 295.47 ms. Allocated memory is still 199.2 MB. Free memory was 179.7 MB in the beginning and 161.8 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17166.56 ms. Allocated memory was 199.2 MB in the beginning and 287.3 MB in the end (delta: 88.1 MB). Free memory was 161.3 MB in the beginning and 268.2 MB in the end (delta: -106.9 MB). Peak memory consumption was 148.4 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_~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_~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_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,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: 14192.6ms, OverallIterations: 8, TraceHistogramMax: 8, EmptinessCheckTime: 12.4ms, AutomataDifference: 10096.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 2888.6ms, InitialAbstractionConstructionTime: 6.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 218 SDtfs, 486 SDslu, 433 SDs, 0 SdLazy, 1192 SolverSat, 516 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3470.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 75 SyntacticMatches, 14 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 8642.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=6, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 102.1ms AutomataMinimizationTime, 8 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 36 LocationsWithAnnotation, 198 PreInvPairs, 287 NumberOfFragments, 1553 HoareAnnotationTreeSize, 198 FomulaSimplifications, 5483 FormulaSimplificationTreeSizeReduction, 214.5ms HoareSimplificationTime, 36 FomulaSimplificationsInter, 9890 FormulaSimplificationTreeSizeReductionInter, 2642.9ms 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-06 11:35:41,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-06 11:35:41,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_3,QUANTIFIED] [2021-05-06 11:35:41,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2021-05-06 11:35:41,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2021-05-06 11:35:41,377 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) || ((((((\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_~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) && in + 1 <= inlen) && 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-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-06 11:35:41,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-06 11:35:41,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-06 11:35:41,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~inlen~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_28,QUANTIFIED] [2021-05-06 11:35:41,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_BEFORE_RETURN_1,QUANTIFIED] [2021-05-06 11:35:41,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_1,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: (\old(cond) == 0 || !(cond == 0)) && ((\old(cond) == 0 || \old(cond) == cond) || (forall v_main_~buf~0_BEFORE_CALL_2 : int, v_main_~bufferlen~0_BEFORE_CALL_2 : int :: !(\old(cond) == (if v_main_~buf~0_BEFORE_CALL_2 < v_main_~bufferlen~0_BEFORE_CALL_2 then 1 else 0)) || (forall 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 :: (((!((if 0 <= v_main_~buf~0_28 then 1 else 0) == (if 0 <= v_main_~buf~0_BEFORE_CALL_2 then 1 else 0)) || (!(v_main_~buf~0_28 == 0) && (((!(v_main_~buf~0_28 < v_main_~buflim~0_BEFORE_RETURN_1 + 1) || !(v_main_~buf~0_28 <= v_main_~in~0_BEFORE_RETURN_1 + 1)) || !(0 < v_main_~buf~0_28)) || !(v_main_~in~0_BEFORE_RETURN_1 < v_main_~inlen~0_BEFORE_RETURN_1)))) || v_main_~buf~0_28 == v_main_~buflim~0_BEFORE_RETURN_1) || !(v_main_~buflim~0_BEFORE_RETURN_1 + 2 <= v_main_~bufferlen~0_BEFORE_RETURN_1)) || !(0 < v_main_~buflim~0_BEFORE_RETURN_1 + 1)))) RESULT: Ultimate proved your program to be correct! Received shutdown request...